58 #define BEST_LANE_LOOKAHEAD 3000.0 72 const std::string& streetName,
73 const std::string& edgeType,
75 Named(id), myNumericalID(numericalID), myLanes(0),
76 myLaneChanger(0), myFunction(function), myVaporizationRequests(0),
77 myLastFailedInsertionTime(-1),
78 myFromJunction(0), myToJunction(0),
79 myStreetName(streetName),
84 myEmptyTraveltime(-1.),
86 myAmRoundabout(false),
97 for (AllowedLanesCont::iterator i1 = (*i2).second.begin(); i1 != (*i2).second.end(); i1++) {
113 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
116 double widthBefore = 0;
117 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
118 (*i)->setRightSideOnEdge(widthBefore, (
int)
mySublaneSides.size());
123 widthBefore += (*i)->getWidth();
138 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
141 for (MSLinkCont::const_iterator j = lc.begin(); j != lc.end(); ++j) {
144 if (minPenalty == -1) {
145 minPenalty = linkPenalty;
147 minPenalty =
MIN2(minPenalty, linkPenalty);
151 if (minPenalty > 0) {
160 myAllowed[0] =
new std::vector<MSLane*>();
161 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
164 for (MSLinkCont::const_iterator j = lc.begin(); j != lc.end(); ++j) {
165 (*j)->initParallelLinks();
166 MSLane* toL = (*j)->getLane();
178 myAllowed[&to] =
new std::vector<MSLane*>();
185 toL = (*j)->getViaLane();
227 for (std::vector<MSLane*>::const_iterator it =
myLanes->begin(); it !=
myLanes->end(); ++it) {
250 for (AllowedLanesCont::iterator i1 = (*i2).second.begin(); i1 != (*i2).second.end(); i1++) {
259 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
282 if (index == (
int)
myLanes->size()) {
285 const int resultIndex = index + offset;
286 if (resultIndex >= (
int)
myLanes->size() || resultIndex < 0) {
289 return (*
myLanes)[resultIndex];
294 const std::vector<MSLane*>*
300 const std::vector<MSLane*>*
306 const std::vector<MSLane*>*
308 AllowedLanesCont::const_iterator it = c.find(dest);
316 const std::vector<MSLane*>*
332 if (MSDevice_Routing::isParallel()) {
333 MSDevice_Routing::lock();
336 for (AllowedLanesCont::const_iterator i1 =
myAllowed.begin(); i1 !=
myAllowed.end(); ++i1) {
337 const MSEdge* edge = i1->first;
338 const std::vector<MSLane*>* lanes = i1->second;
341 for (std::vector<MSLane*>::const_iterator i2 = lanes->begin(); i2 != lanes->end(); ++i2) {
343 if ((*i2)->allowsVehicleClass(vclass)) {
349 for (MSLinkCont::const_iterator it_link = lc.begin(); it_link != lc.end(); ++it_link) {
350 const MSLane* targetLane = (*it_link)->getLane();
367 if (MSDevice_Routing::isParallel()) {
368 MSDevice_Routing::unlock();
398 double largestGap = 0;
400 double leastOccupancy = std::numeric_limits<double>::max();;
401 for (std::vector<MSLane*>::const_iterator i = allowed->begin(); i != allowed->end(); ++i) {
402 const double occupancy = (*i)->getBruttoOccupancy();
403 if (occupancy < leastOccupancy) {
405 leastOccupancy = occupancy;
407 const MSVehicle* last = (*i)->getLastFullVehicle();
409 if (lastGap > largestGap) {
410 largestGap = lastGap;
446 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
447 MSVehicle* last = (*i)->getLastFullVehicle();
486 const std::vector<MSVehicle::LaneQ>& bl = veh.
getBestLanes();
487 double bestLength = -1;
488 for (std::vector<MSVehicle::LaneQ>::const_iterator i = bl.begin(); i != bl.end(); ++i) {
489 if ((*i).length > bestLength) {
490 bestLength = (*i).length;
496 double departPos = 0;
501 std::vector<MSLane*>* bestLanes =
new std::vector<MSLane*>();
502 for (std::vector<MSVehicle::LaneQ>::const_iterator i = bl.begin(); i != bl.end(); ++i) {
503 if (((*i).length - departPos) >= bestLength) {
504 bestLanes->push_back((*i).lane);
513 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
539 if (speedFactorParams[1] > 0.) {
547 "' is too high for the departure edge '" +
getID() +
"'.");
564 v.
getID() +
"'. Inserting at lane end instead.");
579 while (segment != 0 && !result) {
602 if (insertionLane == 0) {
610 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
611 const double occupancy = (*i)->getBruttoOccupancy();
620 if (insertionLane == 0) {
636 bool success = insertionLane->
insertVehicle(static_cast<MSVehicle&>(v));
658 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
661 for (MSLinkCont::const_iterator j = lc.begin(); j != lc.end(); ++j) {
677 assert(followerAfterInternal != 0);
691 const MSEdge* result =
this;
705 const double vehNo = (double) segment->getCarNumber();
706 v += vehNo * segment->getMeanSpeed();
713 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
714 const double vehNo = (double)(*i)->getVehicleNumber();
715 v += vehNo * (*i)->getMeanSpeed();
728 assert(minSpeed > 0);
745 DictType::iterator it =
myDict.find(
id);
761 DictType::iterator it =
myDict.find(
id);
772 return (
int)
myDict.size();
784 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
794 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
795 into.push_back((*i).first);
802 const std::string& rid) {
804 std::istringstream in(desc, std::ios::binary);
817 const std::string& rid) {
818 for (std::vector<std::string>::const_iterator i = desc.begin(); i != desc.end(); ++i) {
822 throw ProcessError(
"The edge '" + *i +
"' within the route " + rid +
" is not known." 823 +
"\n The route can not be build.");
825 into.push_back(edge);
854 return myLanes->empty() ? 1 :
getLanes()[0]->getLengthGeometryFactor();
867 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
868 (*i)->setMaxSpeed(val);
875 std::vector<MSTransportable*>
879 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
881 for (MSLane::VehCont::const_iterator j = vehs.begin(); j != vehs.end(); ++j) {
882 const std::vector<MSTransportable*>& persons = (*j)->getPersons();
883 result.insert(result.end(), persons.begin(), persons.end());
885 (*i)->releaseVehicles();
893 std::vector<MSTransportable*>
932 if (MSDevice_Routing::isParallel()) {
933 MSDevice_Routing::lock();
943 if ((*it)->isTazConnector()) {
944 i->second.push_back(*it);
946 const std::vector<MSLane*>* allowed =
allowedLanes(*it, vClass);
947 if (allowed != 0 && allowed->size() > 0) {
948 i->second.push_back(*it);
955 if (MSDevice_Routing::isParallel()) {
956 MSDevice_Routing::unlock();
965 return (!
myLanes->empty() &&
myLanes->back()->getOpposite() != 0 &&
973 for (std::vector<MSLane*>::const_iterator i =
myLanes->begin(); i !=
myLanes->end(); ++i) {
975 for (MSLinkCont::const_iterator j = lc.begin(); j != lc.end(); ++j) {
976 if (!(*j)->havePriority()) {
991 for (ConstMSEdgeVector::const_iterator it = candidates.begin(); it != candidates.end(); it++) {
1007 std::vector<MSLane*>::const_iterator it1 =
myLanes->begin();
1008 std::vector<MSLane*>::const_reverse_iterator it2 = other->
getLanes().rbegin();
1010 if ((*it1)->getShape().reverse() != (*it2)->getShape()) {
1015 }
while (it1 !=
myLanes->end());
double distanceTo2D(const Position &p) const
returns the euclidean distance in the x-y-plane
void laneChange(SUMOTime t)
Start lane-change-process for all vehicles on the edge'e lanes.
const SumoXMLEdgeFunc myFunction
the purpose of the edge
bool myAmDelayed
whether this edge had a vehicle with less than max speed on it
double getDepartPosBound(const MSVehicle &veh, bool upper=true) const
return upper bound for the depart position on this edge
double getBruttoOccupancy() const
Returns the brutto (including minGaps) occupancy of this lane during the last step.
MESegment * getNextSegment() const
Returns the following segment on the same edge (0 if it is the last).
double getLengthWithGap() const
Get vehicle's length including the minimum gap [m].
static double gLateralResolution
MSLane * getLogicalPredecessorLane() const
get the most likely precedecessor lane (sorted using by_connections_to_sorter). The result is cached ...
bool allowsLaneChanging()
bool insertVehicle(SUMOVehicle &v, SUMOTime time, const bool checkOnly=false, const bool forceCheck=false) const
Tries to insert the given vehicle into the network.
std::set< MSTransportable * > myContainers
Containers on the edge.
MSEdge & getEdge() const
Returns the lane's edge.
Representation of a vehicle in the micro simulation.
static void insertIDs(std::vector< std::string > &into)
Inserts IDs of all known edges into the given vector.
Sorts edges by their ids.
A vehicle from the mesoscopic point of view.
void addSuccessor(MSEdge *edge)
Adds an edge to the list of edges which may be reached from this edge and to the incoming of the othe...
MSEdge(const std::string &id, int numericalID, const SumoXMLEdgeFunc function, const std::string &streetName, const std::string &edgeType, int priority)
Constructor.
MESegment * getSegmentForEdge(const MSEdge &e, double pos=0)
Get the segment for a given edge at a given position.
MSLane * parallelLane(const MSLane *const lane, int offset) const
Returns the lane with the given offset parallel to the given lane one or 0 if it does not exist...
MSLane * getLane() const
Returns the connected lane.
SUMOTime getMesoTLSPenalty() const
Returns the time penalty for passing a tls-controlled link (meso)
static double gMesoTLSPenalty
double getLengthGeometryFactor() const
return shape.length() / myLength
SUMOVehicleClass
Definition of vehicle classes to differ between different lane usage and authority types...
static int dictSize()
Returns the number of edges.
bool initialise(MEVehicle *veh, SUMOTime time)
Inserts (emits) vehicle into the segment.
double distanceTo2D(const Position &p2) const
returns the euclidean distance in the x-y-plane
static void readEdgeVector(std::istream &in, std::vector< const E *> &edges, const std::string &rid)
Reads an edge vector binary.
DepartLaneDefinition departLaneProcedure
Information how the vehicle shall choose the lane to depart from.
void recalcCache()
Recalculates the cached values.
This is an uncontrolled, minor link, has to stop.
static MSEdgeVector myEdges
Static list of edges.
std::vector< double > & getParameter()
Returns the parameters of this distribution.
double getPositionOnLane() const
Get the vehicle's position along the lane.
ClassedAllowedLanesCont myClassedAllowed
From vehicle class to lanes allowed to be used by it.
static double rand(std::mt19937 *rng=0)
Returns a random real number in [0, 1)
const SUMOVehicleParameter & getParameter() const
Returns the vehicle's parameter (including departure definition)
The least occupied lane is used.
The link is a 180 degree turn.
void buildSegmentsFor(const MSEdge &e, const OptionsCont &oc)
Build the segments for a given edge.
std::string time2string(SUMOTime t)
virtual ~MSEdge()
Destructor.
const std::vector< MSLane * > * allowedLanes(const MSEdge &destination, SUMOVehicleClass vclass=SVC_IGNORING) const
Get the allowed lanes to reach the destination-edge.
const std::vector< MSLane * > & getLanes() const
Returns this edge's lanes.
const MSEdge * myOppositingSuperposableEdge
the oppositing superposble edge
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
double getMeanSpeed() const
get the mean speed
const MSRoute & getRoute() const
Returns the current route.
static bool dictionary(const std::string &id, MSEdge *edge)
Inserts edge into the static dictionary Returns true if the key id isn't already in the dictionary...
std::vector< double > mySublaneSides
the right side for each sublane on this edge
This is an uncontrolled, right-before-left link.
SUMOTime incVaporization(SUMOTime t)
Enables vaporization.
The lane is chosen randomly.
std::vector< const MSEdge * > ConstMSEdgeVector
void initialize(const std::vector< MSLane *> *lanes)
Initialize the edge.
const std::string & getID() const
Returns the id.
const SVCPermissions SVCAll
all VClasses are allowed
int myVaporizationRequests
Vaporizer counter.
int operator()(const MSTransportable *const c1, const MSTransportable *const c2) const
comparing operator
double getLength() const
return the length of the edge
int size() const
Returns the number of edges to pass.
const MSJunction * getToJunction() const
std::vector< MSTransportable * > getSortedPersons(SUMOTime timestep, bool includeRiding=false) const
Returns this edge's persons sorted by pos.
The least occupied lane from best lanes.
The position is chosen randomly.
SUMOTime decVaporization(SUMOTime t)
Disables vaporization.
int getNumericalID() const
Returns the numerical id of the edge.
This is an uncontrolled, all-way stop link.
double getSpeedLimit() const
Returns the speed limit of the edge The speed limit of the first lane is retured; should probably be...
#define WRITE_WARNING(msg)
std::map< std::string, MSEdge *> DictType
definition of the static dictionary type
The car-following model and parameter.
bool isVaporizing() const
Returns whether vehicles on this edge shall be vaporized.
static OptionsCont & getOptions()
Retrieves the options.
Performs lane changing of vehicles.
LinkState getState() const
Returns the current state of the link.
double getCurrentTravelTime(const double minSpeed=NUMERICAL_EPS) const
Computes and returns the current travel time for this edge.
bool hasSpaceFor(const MEVehicle *veh, SUMOTime entryTime, bool init=false) const
Returns whether the given vehicle would still fit into the segment.
void checkAndRegisterBiDirEdge()
check and register the opposite superposable edge if any
The link is a straight direction.
Performs lane changing of vehicles.
double departSpeed
(optional) The initial speed of the vehicle
A road/street connecting two junctions.
bool insertVehicle(MSVehicle &v)
Tries to insert the given vehicle.
SUMOTime myLastFailedInsertionTime
The time of last insertion failure.
MSTransportable::Stage * getCurrentStage() const
Return the current stage.
std::map< SUMOVehicleClass, MSEdgeVector > myClassesSuccessorMap
The successors available for a given vClass.
void rebuildAllowedLanes()
int getIndex() const
Returns the lane's index.
#define BEST_LANE_LOOKAHEAD
DepartSpeedDefinition departSpeedProcedure
Information how the vehicle's initial speed shall be chosen.
virtual void setChosenSpeedFactor(const double factor)=0
double myLength
the length of the edge (cached value for speedup)
MSLane * getViaLane() const
Returns the following inner lane.
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
Representation of a vehicle.
virtual double getEdgePos(SUMOTime now) const =0
DepartPosDefinition departPosProcedure
Information how the vehicle shall choose the departure position.
The least occupied lane from lanes which allow the continuation.
This is an uncontrolled, minor link, has to brake.
AllowedLanesCont myAllowed
Associative container from destination-edge to allowed-lanes.
bool hasMinorLink() const
whether any lane has a minor link
void updateBestLanes(bool forceRebuild=false, const MSLane *startLane=0)
computes the best lanes to use in order to continue the route
static void clear()
Clears the dictionary.
SVCPermissions myMinimumPermissions
The intersection of lane permissions for this edge.
MSEdgeVector mySuccessors
The succeeding edges.
MSJunction * myToJunction
bool havePriority() const
Returns whether this link is a major link.
MSLaneChanger * myLaneChanger
This member will do the lane-change.
double getRoutingSpeed() const
Returns the averaged speed used by the routing device.
LinkState
The right-of-way state of a link between two lanes used when constructing a NBTrafficLightLogic, in MSLink and GNEInternalLane.
MSLane * leftLane(const MSLane *const lane) const
Returns the lane left to the one given, 0 if the given lane is leftmost.
const MSEdge * getNormalBefore() const
if this edge is an internal edge, return its first normal predecessor, otherwise the edge itself ...
static SUMOTime gMesoMinorPenalty
const Position & getPosition() const
const std::string & getID() const
returns the id of the transportable
bool myAmFringe
whether this edge is at the network fringe
MSLane * getDepartLane(MSVehicle &veh) const
Finds a depart lane for the given vehicle parameters.
const std::vector< MSLane * > * myLanes
Container for the edge's lane; should be sorted: (right-hand-traffic) the more left the lane...
bool isInternal() const
return whether this edge is an internal edge
virtual double getChosenSpeedFactor() const =0
If a fixed number of random choices fails, a free position is chosen.
std::vector< MSVehicle * > VehCont
Container for vehicles.
bool isSuperposable(const MSEdge *other)
bool canChangeToOpposite()
whether this edge allows changing to the opposite direction edge
Base class for objects which have an id.
The rightmost lane the vehicle may use.
int departLane
(optional) The lane the vehicle shall depart from (index in edge)
const MSEdge * getInternalFollowingEdge(const MSEdge *followerAfterInternal) const
double getVehicleMaxSpeed(const SUMOVehicle *const veh) const
Returns the maximum speed the vehicle may use on this edge.
const ConstMSEdgeVector & getOutgoing() const
std::vector< std::string > getVector()
SVCPermissions myCombinedPermissions
The union of lane permissions for this edge.
No information given; use default.
void buildLaneChanger()
Has to be called after all sucessors and predecessors have been set (after closeBuilding()) ...
double departPos
(optional) The position the vehicle shall depart from
Structure representing possible vehicle parameter.
const MSVehicleType & getVehicleType() const
Returns the vehicle's type definition.
bool isTazConnector() const
static MSLink * getConnectingLink(const MSLane &from, const MSLane &to)
Returns the link connecting both lanes Both lanes have to be non-internal; 0 may be returned if no co...
static const MSEdgeVector & getAllEdges()
Returns all edges with a numerical id.
virtual void changeLanes(SUMOTime t)
Performs lane changing on this edge.
static const T & getRandomFrom(const std::vector< T > &v, std::mt19937 *rng=0)
Returns a random element from the given vector.
virtual const SUMOVehicleParameter & getParameter() const =0
Returns the vehicle's parameter (including departure definition)
const MSJunction * getFromJunction() const
A single mesoscopic segment (cell)
double myWidth
Edge width [m].
SumoXMLEdgeFunc
Numbers representing special SUMO-XML-attribute values for representing edge functions used in netbui...
MSJunction * myFromJunction
the junctions for this edge
double getInternalFollowingLengthTo(const MSEdge *followerAfterInternal) const
returns the length of all internal edges on the junction until reaching the non-internal edge followe...
const MSEdgeVector & getSuccessors() const
Returns the following edges.
static MELoop * gMesoNet
mesoscopic simulation infrastructure
double getLength() const
Get vehicle's length [m].
void setMaxSpeed(double val) const
Sets a new maximum speed for all lanes (used by TraCI and MSCalibrator)
bool allowsVehicleClass(SUMOVehicleClass vclass) const
std::map< const MSEdge *, std::vector< MSLane * > *> AllowedLanesCont
Suceeding edges (keys) and allowed lanes to reach these edges (values).
static DictType myDict
Static dictionary to associate string-ids with objects.
Sorts transportables by their positions.
double getDistanceTo(const MSEdge *other) const
optimistic air distance heuristic for use in routing
MSRouteIterator begin() const
Returns the begin of the list of edges to pass.
No information given; use default.
A free position is chosen.
std::vector< MSEdge * > MSEdgeVector
Insert behind the last vehicle as close as possible to still allow the specified departSpeed. Fallback to DEPART_POS_BASE if there is no vehicle on the departLane yet.
double computeChosenSpeedDeviation(std::mt19937 *rng, const double minDev=-1.) const
Computes and returns the speed deviation.
const MSLinkCont & getLinkCont() const
returns the container with all links !!!
const std::vector< LaneQ > & getBestLanes() const
Returns the description of best lanes to use in order to continue the route.
static double getAssumedSpeed(const MSEdge *edge)
return current travel speed assumption
void add(double x, double y, double z=0)
Makes the boundary include the given coordinate.
Boundary myTazBoundary
The bounding rectangle of incoming or outgoing edges for taz connectors.
static SUMOTime gLaneChangeDuration
MSEdgeVector myPredecessors
The preceeding edges.
std::vector< MSTransportable * > getSortedContainers(SUMOTime timestep, bool includeRiding=false) const
Returns this edge's containers sorted by pos.
Representation of a lane in the micro simulation.
MSLane * rightLane(const MSLane *const lane) const
Returns the lane right to the one given, 0 if the given lane is rightmost.
double myEmptyTraveltime
the traveltime on the empty edge (cached value for speedup)
MSLane * getFreeLane(const std::vector< MSLane *> *allowed, const SUMOVehicleClass vclass, double departPos) const
Finds the emptiest lane allowing the vehicle class.
const Distribution_Parameterized & getSpeedFactor() const
Returns this type's speed factor.
static void parseEdgesList(const std::string &desc, ConstMSEdgeVector &into, const std::string &rid)
Parses the given string assuming it contains a list of edge ids divided by spaces.
virtual const std::string & getID() const =0
Get the vehicle's ID.
const std::vector< MSLane * > * getAllowedLanesWithDefault(const AllowedLanesCont &c, const MSEdge *dest) const
lookup in map and return 0 if not found
SumoXMLEdgeFunc getFunction() const
Returns the edge type (SumoXMLEdgeFunc)
vehicles ignoring classes
SUMOVehicleClass getVehicleClass() const
Get this vehicle type's vehicle class.
std::string id
The vehicle's id.
std::set< int > myFailedInsertionMemory
A cache for the rejected insertion attempts. Used to assure that no further insertion attempts are ma...
std::set< MSTransportable * > myPersons
Persons on the edge for drawing and pushbutton.
virtual const MSVehicleType & getVehicleType() const =0
Returns the vehicle's type.