Eclipse SUMO - Simulation of Urban MObility
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
MSTriggeredRerouter.cpp
Go to the documentation of this file.
1/****************************************************************************/
2// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.dev/sumo
3// Copyright (C) 2001-2025 German Aerospace Center (DLR) and others.
4// This program and the accompanying materials are made available under the
5// terms of the Eclipse Public License 2.0 which is available at
6// https://www.eclipse.org/legal/epl-2.0/
7// This Source Code may also be made available under the following Secondary
8// Licenses when the conditions for such availability set forth in the Eclipse
9// Public License 2.0 are satisfied: GNU General Public License, version 2
10// or later which is available at
11// https://www.gnu.org/licenses/old-licenses/gpl-2.0-standalone.html
12// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
13/****************************************************************************/
22// Reroutes vehicles passing an edge
23/****************************************************************************/
24#include <config.h>
25
26#include <string>
27#include <algorithm>
28#ifdef HAVE_FOX
30#endif
43#include <microsim/MSLane.h>
44#include <microsim/MSLink.h>
45#include <microsim/MSVehicle.h>
47#include <microsim/MSRoute.h>
48#include <microsim/MSEdge.h>
50#include <microsim/MSNet.h>
52#include <microsim/MSGlobals.h>
54#include <microsim/MSStop.h>
60#include "MSTriggeredRerouter.h"
61
62#include <mesosim/MELoop.h>
63#include <mesosim/MESegment.h>
64
65//#define DEBUG_REROUTER
66#define DEBUGCOND(veh) (veh.isSelected())
67//#define DEBUGCOND(veh) (true)
68//#define DEBUGCOND(veh) (veh.getID() == "")
69
71#define DEFAULT_PRIO_OVERTAKER 1
72#define DEFAULT_PRIO_OVERTAKEN 0
73#define DEFAULT_MAXDELAY 7200
74
75// ===========================================================================
76// static member definition
77// ===========================================================================
78MSEdge MSTriggeredRerouter::mySpecialDest_keepDestination("MSTriggeredRerouter_keepDestination", -1, SumoXMLEdgeFunc::UNKNOWN, "", "", -1, 0);
79MSEdge MSTriggeredRerouter::mySpecialDest_terminateRoute("MSTriggeredRerouter_terminateRoute", -1, SumoXMLEdgeFunc::UNKNOWN, "", "", -1, 0);
80std::map<std::string, MSTriggeredRerouter*> MSTriggeredRerouter::myInstances;
81
82
83// ===========================================================================
84// method definitions
85// ===========================================================================
87 const MSEdgeVector& edges, double prob, bool off, bool optional,
88 SUMOTime timeThreshold, const std::string& vTypes, const Position& pos, const double radius) :
89 Named(id),
91 MSStoppingPlaceRerouter("parking"),
92 myEdges(edges),
93 myProbability(prob),
94 myUserProbability(prob),
95 myAmInUserMode(false),
96 myAmOptional(optional),
97 myPosition(pos),
98 myRadius(radius),
99 myTimeThreshold(timeThreshold),
100 myHaveParkProbs(false) {
101 myInstances[id] = this;
102 // build actors
103 for (const MSEdge* const e : edges) {
106 }
107 for (MSLane* const lane : e->getLanes()) {
108 lane->addMoveReminder(this);
109 }
110 }
111 if (off) {
112 setUserMode(true);
114 }
115 const std::vector<std::string> vt = StringTokenizer(vTypes).getVector();
116 myVehicleTypes.insert(vt.begin(), vt.end());
118 myPosition = edges.front()->getLanes()[0]->getShape()[0];
119 }
120}
121
122
126
127
128// ------------ loading begin
129void
131 const SUMOSAXAttributes& attrs) {
132 if (element == SUMO_TAG_INTERVAL) {
133 bool ok = true;
138 throw ProcessError(TLF("rerouter '%': interval end % is not after begin %.", getID(),
141 }
142 }
143 if (element == SUMO_TAG_DEST_PROB_REROUTE) {
144 // by giving probabilities of new destinations
145 // get the destination edge
146 std::string dest = attrs.getStringSecure(SUMO_ATTR_ID, "");
147 if (dest == "") {
148 throw ProcessError(TLF("rerouter '%': destProbReroute has no destination edge id.", getID()));
149 }
150 MSEdge* to = MSEdge::dictionary(dest);
151 if (to == nullptr) {
152 if (dest == "keepDestination") {
154 } else if (dest == "terminateRoute") {
156 } else {
157 throw ProcessError(TLF("rerouter '%': Destination edge '%' is not known.", getID(), dest));
158 }
159 }
160 // get the probability to reroute
161 bool ok = true;
162 double prob = attrs.getOpt<double>(SUMO_ATTR_PROB, getID().c_str(), ok, 1.);
163 if (!ok) {
164 throw ProcessError();
165 }
166 if (prob < 0) {
167 throw ProcessError(TLF("rerouter '%': Attribute 'probability' for destination '%' is negative (must not).", getID(), dest));
168 }
169 // add
171 }
172
173 if (element == SUMO_TAG_CLOSING_REROUTE) {
174 // by closing edge
175 const std::string& closed_id = attrs.getStringSecure(SUMO_ATTR_ID, "");
176 MSEdge* const closedEdge = MSEdge::dictionary(closed_id);
177 if (closedEdge == nullptr) {
178 throw ProcessError(TLF("rerouter '%': Edge '%' to close is not known.", getID(), closed_id));
179 }
180 bool ok;
181 const std::string allow = attrs.getOpt<std::string>(SUMO_ATTR_ALLOW, getID().c_str(), ok, "", false);
182 const std::string disallow = attrs.getOpt<std::string>(SUMO_ATTR_DISALLOW, getID().c_str(), ok, "");
183 SVCPermissions permissions = parseVehicleClasses(allow, disallow);
184 myParsedRerouteInterval.closed[closedEdge] = permissions;
185 }
186
187 if (element == SUMO_TAG_CLOSING_LANE_REROUTE) {
188 // by closing lane
189 std::string closed_id = attrs.getStringSecure(SUMO_ATTR_ID, "");
190 MSLane* closedLane = MSLane::dictionary(closed_id);
191 if (closedLane == nullptr) {
192 throw ProcessError(TLF("rerouter '%': Lane '%' to close is not known.", getID(), closed_id));
193 }
194 bool ok;
195 SVCPermissions permissions = SVC_AUTHORITY;
197 const std::string allow = attrs.getOpt<std::string>(SUMO_ATTR_ALLOW, getID().c_str(), ok, "", false);
198 const std::string disallow = attrs.getOpt<std::string>(SUMO_ATTR_DISALLOW, getID().c_str(), ok, "");
199 permissions = parseVehicleClasses(allow, disallow);
200 }
201 myParsedRerouteInterval.closedLanes[closedLane] = permissions;
202 }
203
204 if (element == SUMO_TAG_ROUTE_PROB_REROUTE) {
205 // by explicit rerouting using routes
206 // check if route exists
207 std::string routeStr = attrs.getStringSecure(SUMO_ATTR_ID, "");
208 if (routeStr == "") {
209 throw ProcessError(TLF("rerouter '%': routeProbReroute has no alternative route id.", getID()));
210 }
211 ConstMSRoutePtr route = MSRoute::dictionary(routeStr);
212 if (route == nullptr) {
213 throw ProcessError(TLF("rerouter '%': Alternative route '%' does not exist.", getID(), routeStr));
214 }
215
216 // get the probability to reroute
217 bool ok = true;
218 double prob = attrs.getOpt<double>(SUMO_ATTR_PROB, getID().c_str(), ok, 1.);
219 if (!ok) {
220 throw ProcessError();
221 }
222 if (prob < 0) {
223 throw ProcessError(TLF("rerouter '%': Attribute 'probability' for alternative route '%' is negative (must not).", getID(), routeStr));
224 }
225 // add
227 }
228
229 if (element == SUMO_TAG_PARKING_AREA_REROUTE) {
230 std::string parkingarea = attrs.getStringSecure(SUMO_ATTR_ID, "");
231 if (parkingarea == "") {
232 throw ProcessError(TLF("rerouter '%': parkingAreaReroute requires a parkingArea id.", getID()));
233 }
235 if (pa == nullptr) {
236 throw ProcessError(TLF("rerouter '%': parkingArea '%' is not known.", getID(), parkingarea));
237 }
238 // get the probability to reroute
239 bool ok = true;
240 const double prob = attrs.getOpt<double>(SUMO_ATTR_PROB, getID().c_str(), ok, 1.);
241 if (!ok) {
242 throw ProcessError();
243 }
244 if (prob < 0) {
245 throw ProcessError(TLF("rerouter '%': Attribute 'probability' for parkingArea '%' is negative (must not).", getID(), parkingarea));
246 }
247 const bool visible = attrs.getOpt<bool>(SUMO_ATTR_VISIBLE, getID().c_str(), ok, false);
248 // add
249 myParsedRerouteInterval.parkProbs.add(std::make_pair(pa, visible), prob);
250 myHaveParkProbs = true;
251 }
252
253 if (element == SUMO_TAG_VIA_PROB_REROUTE) {
254 // by giving probabilities of vias
255 std::string viaID = attrs.getStringSecure(SUMO_ATTR_ID, "");
256 if (viaID == "") {
257 throw ProcessError(TLF("rerouter '%': No via edge id given.", getID()));
258 }
259 MSEdge* const via = MSEdge::dictionary(viaID);
260 if (via == nullptr) {
261 throw ProcessError(TLF("rerouter '%': Via Edge '%' is not known.", getID(), viaID));
262 }
263 // get the probability to reroute
264 bool ok = true;
265 double prob = attrs.getOpt<double>(SUMO_ATTR_PROB, getID().c_str(), ok, 1.);
266 if (!ok) {
267 throw ProcessError();
268 }
269 if (prob < 0) {
270 throw ProcessError(TLF("rerouter '%': Attribute 'probability' for via '%' is negative (must not).", getID(), viaID));
271 }
272 // add
275 }
276 if (element == SUMO_TAG_OVERTAKING_REROUTE) {
277 // for letting a slow train use a siding to be overtaken by a fast train
278 bool ok = true;
279 for (const std::string& edgeID : attrs.get<std::vector<std::string> >(SUMO_ATTR_MAIN, getID().c_str(), ok)) {
280 MSEdge* edge = MSEdge::dictionary(edgeID);
281 if (edge == nullptr) {
282 throw InvalidArgument("The main edge '" + edgeID + "' to use within rerouter '" + getID() + "' is not known.");
283 }
284 myParsedRerouteInterval.main.push_back(edge);
285 myParsedRerouteInterval.cMain.push_back(edge);
286 }
287 for (const std::string& edgeID : attrs.get<std::vector<std::string> >(SUMO_ATTR_SIDING, getID().c_str(), ok)) {
288 MSEdge* edge = MSEdge::dictionary(edgeID);
289 if (edge == nullptr) {
290 throw InvalidArgument("The siding edge '" + edgeID + "' to use within rerouter '" + getID() + "' is not known.");
291 }
292 myParsedRerouteInterval.siding.push_back(edge);
293 myParsedRerouteInterval.cSiding.push_back(edge);
294 }
296 if (myParsedRerouteInterval.sidingExit == nullptr) {
297 throw InvalidArgument("The siding within rerouter '" + getID() + "' does not have a rail signal.");
298 }
299 for (auto it = myParsedRerouteInterval.cSiding.begin(); it != myParsedRerouteInterval.cSiding.end(); it++) {
300 myParsedRerouteInterval.sidingLength += (*it)->getLength();
301 if ((*it)->getToJunction()->getID() == myParsedRerouteInterval.sidingExit->getID()) {
302 break;
303 }
304 }
305 myParsedRerouteInterval.minSaving = attrs.getOpt<double>(SUMO_ATTR_MINSAVING, getID().c_str(), ok, 300);
306 }
307 if (element == SUMO_TAG_STATION_REROUTE) {
308 // for letting a train switch it's stopping place in case of conflict
309 const std::string stopID = attrs.getStringSecure(SUMO_ATTR_ID, "");
310 if (stopID == "") {
311 throw ProcessError(TLF("rerouter '%': stationReroute requires a stopping place id.", getID()));
312 }
314 if (stop == nullptr) {
315 throw ProcessError(TLF("rerouter '%': stopping place '%' is not known.", getID(), stopID));
316 }
317 myParsedRerouteInterval.stopAlternatives.push_back(std::make_pair(stop, true));
318 }
319}
320
321
322void
324 if (element == SUMO_TAG_INTERVAL) {
325 // precompute permissionsAllowAll
326 bool allowAll = true;
327 for (const auto& entry : myParsedRerouteInterval.closed) {
328 allowAll = allowAll && entry.second == SVCAll;
329 if (!allowAll) {
330 break;
331 }
332 }
334
335 for (auto paVi : myParsedRerouteInterval.parkProbs.getVals()) {
336 dynamic_cast<MSParkingArea*>(paVi.first)->setNumAlternatives((int)myParsedRerouteInterval.parkProbs.getVals().size() - 1);
337 }
338 if (myParsedRerouteInterval.closedLanes.size() > 0) {
339 // collect edges that are affect by a closed lane
340 std::set<MSEdge*> affected;
341 for (std::pair<MSLane*, SVCPermissions> settings : myParsedRerouteInterval.closedLanes) {
342 affected.insert(&settings.first->getEdge());
343 }
345 }
346 const SUMOTime closingBegin = myParsedRerouteInterval.begin;
347 const SUMOTime simBegin = string2time(OptionsCont::getOptions().getString("begin"));
348 if (closingBegin < simBegin && myParsedRerouteInterval.end > simBegin) {
349 // interval started before simulation begin but is still active at
350 // the start of the simulation
352 }
354 myIntervals.back().id = (long long int)&myIntervals.back();
358 }
359 }
360}
361
362
363// ------------ loading end
364
365
368 bool updateVehicles = false;
369 for (const RerouteInterval& i : myIntervals) {
370 if (i.begin == currentTime && !(i.closed.empty() && i.closedLanes.empty()) /*&& i.permissions != SVCAll*/) {
371 for (const auto& settings : i.closed) {
372 for (MSLane* lane : settings.first->getLanes()) {
373 //std::cout << SIMTIME << " closing: intervalID=" << i.id << " lane=" << lane->getID() << " prevPerm=" << getVehicleClassNames(lane->getPermissions()) << " new=" << getVehicleClassNames(i.permissions) << "\n";
374 lane->setPermissions(settings.second, i.id);
375 }
376 settings.first->rebuildAllowedLanes();
377 updateVehicles = true;
378 }
379 for (std::pair<MSLane*, SVCPermissions> settings : i.closedLanes) {
380 settings.first->setPermissions(settings.second, i.id);
381 settings.first->getEdge().rebuildAllowedLanes();
382 updateVehicles = true;
383 }
386 }
387 if (i.end == currentTime && !(i.closed.empty() && i.closedLanes.empty()) /*&& i.permissions != SVCAll*/) {
388 for (std::pair<MSEdge*, SVCPermissions> settings : i.closed) {
389 for (MSLane* lane : settings.first->getLanes()) {
390 lane->resetPermissions(i.id);
391 //std::cout << SIMTIME << " opening: intervalID=" << i.id << " lane=" << lane->getID() << " restore prevPerm=" << getVehicleClassNames(lane->getPermissions()) << "\n";
392 }
393 settings.first->rebuildAllowedLanes();
394 updateVehicles = true;
395 }
396 for (std::pair<MSLane*, SVCPermissions> settings : i.closedLanes) {
397 settings.first->resetPermissions(i.id);
398 settings.first->getEdge().rebuildAllowedLanes();
399 updateVehicles = true;
400 }
401 }
402 }
403 if (updateVehicles) {
404 // only vehicles on the affected lanes had their bestlanes updated so far
405 for (MSEdge* e : myEdges) {
406 // also updates vehicles
407 e->rebuildAllowedTargets();
408 }
409 }
410 return 0;
411}
412
413
416 for (const RerouteInterval& ri : myIntervals) {
417 if (ri.begin <= time && ri.end > time) {
418 if (
419 // destProbReroute
420 ri.edgeProbs.getOverallProb() > 0 ||
421 // routeProbReroute
422 ri.routeProbs.getOverallProb() > 0 ||
423 // parkingZoneReroute
424 ri.parkProbs.getOverallProb() > 0 ||
425 // stationReroute
426 ri.stopAlternatives.size() > 0) {
427 return &ri;
428 }
429 if (!ri.closed.empty() || !ri.closedLanesAffected.empty() || !ri.main.empty()) {
430 const std::set<SUMOTrafficObject::NumericalID>& edgeIndices = obj.getUpcomingEdgeIDs();
431 if (affected(edgeIndices, ri.getClosed())
432 || affected(edgeIndices, ri.closedLanesAffected)
433 || affected(edgeIndices, ri.main)) {
434 return &ri;
435 }
436 }
437 }
438 }
439 return nullptr;
440}
441
442
445 for (const RerouteInterval& ri : myIntervals) {
446 if (ri.begin <= time && ri.end > time) {
447 if (ri.edgeProbs.getOverallProb() != 0 || ri.routeProbs.getOverallProb() != 0 || ri.parkProbs.getOverallProb() != 0
448 || !ri.closed.empty() || !ri.closedLanesAffected.empty() || !ri.main.empty()) {
449 return &ri;
450 }
451 }
452 }
453 return nullptr;
454}
455
456
457bool
459 if (myAmOptional || myRadius != std::numeric_limits<double>::max()) {
460 return true;
461 }
462 return triggerRouting(tObject, reason);
463}
464
465
466bool
468 double /*newPos*/, double /*newSpeed*/) {
470}
471
472
473bool
475 MSMoveReminder::Notification reason, const MSLane* /* enteredLane */) {
476 return reason == NOTIFICATION_LANE_CHANGE;
477}
478
479
480bool
482 if (!applies(tObject)) {
483 return false;
484 }
485 if (myRadius != std::numeric_limits<double>::max() && tObject.getPosition().distanceTo(myPosition) > myRadius) {
486 return true;
487 }
488 // check whether the vehicle shall be rerouted
490 const MSTriggeredRerouter::RerouteInterval* const rerouteDef = getCurrentReroute(now, tObject);
491 if (rerouteDef == nullptr) {
492 return true; // an active interval could appear later
493 }
494 const double prob = myAmInUserMode ? myUserProbability : myProbability;
495 if (prob < 1 && RandHelper::rand(tObject.getRNG()) > prob) {
496 return false; // XXX another interval could appear later but we would have to track whether the current interval was already tried
497 }
498 if (myTimeThreshold > 0 && MAX2(tObject.getWaitingTime(), tObject.getWaitingTime(true)) < myTimeThreshold) {
499 return true; // waiting time may be reached later
500 }
501 if (reason == NOTIFICATION_LANE_CHANGE) {
502 return false;
503 }
504 // if we have a closingLaneReroute, only vehicles with a rerouting device can profit from rerouting (otherwise, edge weights will not reflect local jamming)
505 const bool hasReroutingDevice = tObject.getDevice(typeid(MSDevice_Routing)) != nullptr;
506 if (rerouteDef->closedLanes.size() > 0 && !hasReroutingDevice) {
507 return true; // an active interval could appear later
508 }
509 const MSEdge* lastEdge = tObject.getRerouteDestination();
510#ifdef DEBUG_REROUTER
511 if (DEBUGCOND(tObject)) {
512 std::cout << SIMTIME << " veh=" << tObject.getID() << " check rerouter " << getID() << " lane=" << Named::getIDSecure(tObject.getLane()) << " edge=" << tObject.getEdge()->getID() << " finalEdge=" << lastEdge->getID() /*<< " arrivalPos=" << tObject.getArrivalPos()*/ << "\n";
513 }
514#endif
515
516 if (rerouteDef->parkProbs.getOverallProb() > 0) {
517#ifdef HAVE_FOX
518 ScopedLocker<> lock(myNotificationMutex, MSGlobals::gNumSimThreads > 1);
519#endif
520 if (!tObject.isVehicle()) {
521 return false;
522 }
523 SUMOVehicle& veh = static_cast<SUMOVehicle&>(tObject);
524 bool newDestination = false;
525 ConstMSEdgeVector newRoute;
526 MSParkingArea* newParkingArea = rerouteParkingArea(rerouteDef, veh, newDestination, newRoute);
527 if (newParkingArea != nullptr) {
528 // adapt plans of any riders
529 for (MSTransportable* p : veh.getPersons()) {
530 p->rerouteParkingArea(veh.getNextParkingArea(), newParkingArea);
531 }
532
533 if (newDestination) {
534 // update arrival parameters
535 SUMOVehicleParameter* newParameter = new SUMOVehicleParameter();
536 *newParameter = veh.getParameter();
538 newParameter->arrivalPos = newParkingArea->getEndLanePosition();
539 veh.replaceParameter(newParameter);
540 }
541
542 SUMOAbstractRouter<MSEdge, SUMOVehicle>& router = hasReroutingDevice
543 ? MSRoutingEngine::getRouterTT(veh.getRNGIndex(), veh.getVClass(), rerouteDef->getClosed())
544 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex(), rerouteDef->getClosed());
545 const double routeCost = router.recomputeCosts(newRoute, &veh, MSNet::getInstance()->getCurrentTimeStep());
546 ConstMSEdgeVector prevEdges(veh.getCurrentRouteEdge(), veh.getRoute().end());
547 const double previousCost = router.recomputeCosts(prevEdges, &veh, MSNet::getInstance()->getCurrentTimeStep());
548 const double savings = previousCost - routeCost;
549 hasReroutingDevice
551 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex()); // reset closed edges
552 //if (getID() == "ego") std::cout << SIMTIME << " pCost=" << previousCost << " cost=" << routeCost
553 // << " prevEdges=" << toString(prevEdges)
554 // << " newEdges=" << toString(edges)
555 // << "\n";
556
557 std::string errorMsg;
558 if (veh.replaceParkingArea(newParkingArea, errorMsg)) {
559 veh.replaceRouteEdges(newRoute, routeCost, savings, getID() + ":" + toString(SUMO_TAG_PARKING_AREA_REROUTE), false, false, false);
560 } else {
561 WRITE_WARNING("Vehicle '" + veh.getID() + "' at rerouter '" + getID()
562 + "' could not reroute to new parkingArea '" + newParkingArea->getID()
563 + "' reason=" + errorMsg + ", time=" + time2string(MSNet::getInstance()->getCurrentTimeStep()) + ".");
564 }
565 }
566 return false;
567 }
568 if (rerouteDef->main.size() > 0) {
569 if (!tObject.isVehicle()) {
570 return false;
571 }
572 SUMOVehicle& veh = static_cast<SUMOVehicle&>(tObject);
573 if (veh.getLength() > rerouteDef->sidingLength) {
574 return false;
575 }
576 const ConstMSEdgeVector& oldEdges = veh.getRoute().getEdges();
577 auto mainStart = std::find(veh.getCurrentRouteEdge(), oldEdges.end(), rerouteDef->main.front());
578 if (mainStart == oldEdges.end()
579 // exit main within
580 || ConstMSEdgeVector(mainStart, mainStart + rerouteDef->main.size()) != rerouteDef->cMain
581 // stop in main
582 || (veh.hasStops() && veh.getNextStop().edge < (mainStart + rerouteDef->main.size()))) {
583 //std::cout << SIMTIME << " veh=" << veh.getID() << " wrong route or stop\n";
584 return false;
585 }
586 std::pair<const SUMOVehicle*, MSRailSignal*> overtaker_signal = overtakingTrain(veh, mainStart, rerouteDef);
587 if (overtaker_signal.first != nullptr) {
588 SUMOAbstractRouter<MSEdge, SUMOVehicle>& router = hasReroutingDevice
589 ? MSRoutingEngine::getRouterTT(veh.getRNGIndex(), veh.getVClass(), rerouteDef->getClosed())
590 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex(), rerouteDef->getClosed());
591 ConstMSEdgeVector newEdges(veh.getCurrentRouteEdge(), mainStart);
592 newEdges.insert(newEdges.end(), rerouteDef->siding.begin(), rerouteDef->siding.end());
593 newEdges.insert(newEdges.end(), mainStart + rerouteDef->main.size(), oldEdges.end());
594 const double routeCost = router.recomputeCosts(newEdges, &veh, MSNet::getInstance()->getCurrentTimeStep());
595 const double savings = (router.recomputeCosts(rerouteDef->cMain, &veh, MSNet::getInstance()->getCurrentTimeStep())
596 - router.recomputeCosts(rerouteDef->cSiding, &veh, MSNet::getInstance()->getCurrentTimeStep()));
597 const std::string info = getID() + ":" + toString(SUMO_TAG_OVERTAKING_REROUTE) + ":" + overtaker_signal.first->getID();
598 veh.replaceRouteEdges(newEdges, routeCost, savings, info, false, false, false);
600 MSRailSignalConstraint::PREDECESSOR, overtaker_signal.second, overtaker_signal.first->getID(), 100, true));
601 }
602 return false;
603 }
604 if (rerouteDef->stopAlternatives.size() > 0) {
605 // somewhat similar to parkProbs but taking into account public transport schedule
606 if (!tObject.isVehicle()) {
607 return false;
608 }
609 checkStopSwitch(static_cast<MSBaseVehicle&>(tObject), rerouteDef);
610 }
611 // get rerouting params
612 ConstMSRoutePtr newRoute = rerouteDef->routeProbs.getOverallProb() > 0 ? rerouteDef->routeProbs.get() : nullptr;
613 // we will use the route if given rather than calling our own dijsktra...
614 if (newRoute != nullptr) {
615#ifdef DEBUG_REROUTER
616 if (DEBUGCOND(tObject)) {
617 std::cout << " replacedRoute from routeDist " << newRoute->getID() << "\n";
618 }
619#endif
620 tObject.replaceRoute(newRoute, getID());
621 return false; // XXX another interval could appear later but we would have to track whether the currenty interval was already used
622 }
623 const MSEdge* newEdge = lastEdge;
624 // ok, try using a new destination
625 double newArrivalPos = -1;
626 const MSEdgeVector closedEdges = rerouteDef->getClosed();
627 const bool destUnreachable = std::find(closedEdges.begin(), closedEdges.end(), lastEdge) != closedEdges.end();
628 bool keepDestination = false;
629 // if we have a closingReroute, only assign new destinations to vehicles which cannot reach their original destination
630 // if we have a closingLaneReroute, no new destinations should be assigned
631 if (closedEdges.empty() || destUnreachable || rerouteDef->isVia) {
632 newEdge = rerouteDef->edgeProbs.getOverallProb() > 0 ? rerouteDef->edgeProbs.get() : lastEdge;
633 assert(newEdge != nullptr);
634 if (newEdge == &mySpecialDest_terminateRoute) {
635 keepDestination = true;
636 newEdge = tObject.getEdge();
637 newArrivalPos = tObject.getPositionOnLane(); // instant arrival
638 } else if (newEdge == &mySpecialDest_keepDestination || newEdge == lastEdge) {
639 if (destUnreachable && rerouteDef->permissionsAllowAll) {
640 // if permissions aren't set vehicles will simply drive through
641 // the closing unless terminated. If the permissions are specified, assume that the user wants
642 // vehicles to stand and wait until the closing ends
643 WRITE_WARNINGF(TL("Cannot keep destination edge '%' for vehicle '%' due to closed edges. Terminating route."), lastEdge->getID(), tObject.getID());
644 newEdge = tObject.getEdge();
645 } else {
646 newEdge = lastEdge;
647 }
648 }
649 }
650 ConstMSEdgeVector edges;
651 std::vector<MSTransportableRouter::TripItem> items;
652 // we have a new destination, let's replace the route (if it is affected)
653 MSEdgeVector closed = rerouteDef->getClosed();
654 if (rerouteDef->closed.empty() || destUnreachable || rerouteDef->isVia || affected(tObject.getUpcomingEdgeIDs(), closed)) {
655 if (tObject.isVehicle()) {
656 SUMOVehicle& veh = static_cast<SUMOVehicle&>(tObject);
657 const bool canChangeDest = rerouteDef->edgeProbs.getOverallProb() > 0;
658 MSVehicleRouter& router = hasReroutingDevice
660 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex(), closed);
661 bool ok = veh.reroute(now, getID(), router, false, false, canChangeDest, newEdge);
662 if (!ok && !keepDestination && canChangeDest) {
663 // destination unreachable due to closed intermediate edges. pick among alternative targets
664 RandomDistributor<MSEdge*> edgeProbs2 = rerouteDef->edgeProbs;
665 edgeProbs2.remove(const_cast<MSEdge*>(newEdge));
666 while (!ok && edgeProbs2.getVals().size() > 0) {
667 newEdge = edgeProbs2.get();
668 edgeProbs2.remove(const_cast<MSEdge*>(newEdge));
669 if (newEdge == &mySpecialDest_terminateRoute) {
670 newEdge = veh.getEdge();
671 newArrivalPos = veh.getPositionOnLane(); // instant arrival
672 }
673 if (newEdge == &mySpecialDest_keepDestination && !rerouteDef->permissionsAllowAll) {
674 newEdge = lastEdge;
675 break;
676 }
677 ok = veh.reroute(now, getID(), router, false, false, true, newEdge);
678 }
679
680 }
681 if (!rerouteDef->isVia) {
682#ifdef DEBUG_REROUTER
683 if (DEBUGCOND(tObject)) std::cout << " rerouting: newDest=" << newEdge->getID()
684 << " newEdges=" << toString(edges)
685 << " newArrivalPos=" << newArrivalPos << " numClosed=" << rerouteDef->closed.size()
686 << " destUnreachable=" << destUnreachable << " containsClosed=" << veh.getRoute().containsAnyOf(rerouteDef->getClosed()) << "\n";
687#endif
688 if (ok && newArrivalPos != -1) {
689 // must be called here because replaceRouteEdges may also set the arrivalPos
690 veh.setArrivalPos(newArrivalPos);
691 }
692
693 }
694 } else {
695 // person rerouting here
696 MSTransportableRouter& router = hasReroutingDevice
698 : MSNet::getInstance()->getIntermodalRouter(tObject.getRNGIndex(), 0, closed);
699 const bool success = router.compute(tObject.getEdge(), newEdge, tObject.getPositionOnLane(), "",
700 rerouteDef->isVia ? newEdge->getLength() / 2. : tObject.getParameter().arrivalPos, "",
701 tObject.getMaxSpeed(), nullptr, 0, now, items);
702 if (!rerouteDef->isVia) {
703 if (success) {
704 for (const MSTransportableRouter::TripItem& it : items) {
705 if (!it.edges.empty() && !edges.empty() && edges.back() == it.edges.front()) {
706 edges.pop_back();
707 }
708 edges.insert(edges.end(), std::make_move_iterator(it.edges.begin()), std::make_move_iterator(it.edges.end()));
709 if (!edges.empty()) {
710 static_cast<MSPerson&>(tObject).replaceWalk(edges, tObject.getPositionOnLane(), 0, 1);
711 }
712 }
713 } else {
714 // maybe the pedestrian model still finds a way (JuPedSim)
715 static_cast<MSPerson&>(tObject).replaceWalk({tObject.getEdge(), newEdge}, tObject.getPositionOnLane(), 0, 1);
716 }
717 }
718 }
719 }
720 // it was only a via so calculate the remaining part
721 if (rerouteDef->isVia) {
722 if (tObject.isVehicle()) {
723 SUMOVehicle& veh = static_cast<SUMOVehicle&>(tObject);
724 if (!edges.empty()) {
725 edges.pop_back();
726 }
727 MSVehicleRouter& router = hasReroutingDevice
729 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex(), closed);
730 router.compute(newEdge, lastEdge, &veh, now, edges);
731 const double routeCost = router.recomputeCosts(edges, &veh, now);
732 hasReroutingDevice
734 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex()); // reset closed edges
735 const bool useNewRoute = veh.replaceRouteEdges(edges, routeCost, 0, getID());
736#ifdef DEBUG_REROUTER
737 if (DEBUGCOND(tObject)) std::cout << " rerouting: newDest=" << newEdge->getID()
738 << " newEdges=" << toString(edges)
739 << " useNewRoute=" << useNewRoute << " newArrivalPos=" << newArrivalPos << " numClosed=" << rerouteDef->closed.size()
740 << " destUnreachable=" << destUnreachable << " containsClosed=" << veh.getRoute().containsAnyOf(rerouteDef->getClosed()) << "\n";
741#endif
742 if (useNewRoute && newArrivalPos != -1) {
743 // must be called here because replaceRouteEdges may also set the arrivalPos
744 veh.setArrivalPos(newArrivalPos);
745 }
746 } else {
747 // person rerouting here
748 bool success = !items.empty();
749 if (success) {
750 MSTransportableRouter& router = hasReroutingDevice
752 : MSNet::getInstance()->getIntermodalRouter(tObject.getRNGIndex(), 0, closed);
753 success = router.compute(newEdge, lastEdge, newEdge->getLength() / 2., "",
754 tObject.getParameter().arrivalPos, "",
755 tObject.getMaxSpeed(), nullptr, 0, now, items);
756 }
757 if (success) {
758 for (const MSTransportableRouter::TripItem& it : items) {
759 if (!it.edges.empty() && !edges.empty() && edges.back() == it.edges.front()) {
760 edges.pop_back();
761 }
762 edges.insert(edges.end(), std::make_move_iterator(it.edges.begin()), std::make_move_iterator(it.edges.end()));
763 }
764 if (!edges.empty()) {
765 static_cast<MSPerson&>(tObject).replaceWalk(edges, tObject.getPositionOnLane(), 0, 1);
766 }
767 } else {
768 // maybe the pedestrian model still finds a way (JuPedSim)
769 static_cast<MSPerson&>(tObject).replaceWalk({tObject.getEdge(), newEdge, lastEdge}, tObject.getPositionOnLane(), 0, 1);
770 }
771 }
772 }
773 return false; // XXX another interval could appear later but we would have to track whether the currenty interval was already used
774}
775
776
777void
781
782
783void
787
788
789bool
793
794
795double
799
800
801double
805
806
807double
809 return (double)(sp->getElement() == SUMO_TAG_PARKING_AREA
810 ? dynamic_cast<MSParkingArea*>(sp)->getOccupancy()
811 : sp->getStoppedVehicles().size());
812}
813
814
815double
817 return (double)(sp->getElement() == SUMO_TAG_PARKING_AREA
818 ? dynamic_cast<MSParkingArea*>(sp)->getLastStepOccupancy()
819 : sp->getStoppedVehicles().size());
820}
821
822
823double
825 if (myBlockedStoppingPlaces.count(sp) == 0) {
826 return (double)(sp->getElement() == SUMO_TAG_PARKING_AREA
827 ? dynamic_cast<MSParkingArea*>(sp)->getCapacity()
828 // assume only one vehicle at a time (for stationReroute)
829 : 1.);
830 } else {
831 return 0.;
832 }
833}
834
835
836void
838 veh.rememberBlockedParkingArea(parkingArea, blocked);
839}
840
841
842void
844 veh.rememberParkingAreaScore(parkingArea, score);
845}
846
847
848void
852
853
856 return veh.sawBlockedParkingArea(parkingArea, local);
857}
858
859
860int
864
865
866void
870
871
874 SUMOVehicle& veh, bool& newDestination, ConstMSEdgeVector& newRoute) {
875 MSStoppingPlace* destStoppingPlace = veh.getNextParkingArea();
876 if (destStoppingPlace == nullptr) {
877 // not driving towards the right type of stop
878 return nullptr;
879 }
880 std::vector<StoppingPlaceVisible> parks = rerouteDef->parkProbs.getVals();
881 StoppingPlaceParamMap_t addInput = {};
882 return dynamic_cast<MSParkingArea*>(rerouteStoppingPlace(destStoppingPlace, parks, rerouteDef->parkProbs.getProbs(), veh, newDestination, newRoute, addInput, rerouteDef->getClosed()));
883}
884
885
886std::pair<const SUMOVehicle*, MSRailSignal*>
887MSTriggeredRerouter::overtakingTrain(const SUMOVehicle& veh, ConstMSEdgeVector::const_iterator mainStart, const MSTriggeredRerouter::RerouteInterval* def) {
888 const MSEdgeVector& main = def->main;
889 const double vMax = veh.getMaxSpeed();
890 const double prio = veh.getFloatParam(toString(SUMO_TAG_OVERTAKING_REROUTE) + ".prio", false, DEFAULT_PRIO_OVERTAKEN, false);
892 for (MSVehicleControl::constVehIt it_veh = c.loadedVehBegin(); it_veh != c.loadedVehEnd(); ++it_veh) {
893 const MSBaseVehicle* veh2 = dynamic_cast<const MSBaseVehicle*>((*it_veh).second);
894 if (veh2->isOnRoad() && veh2->getMaxSpeed() > vMax) {
895 const double arrivalDelay = veh2->getStopArrivalDelay();
896 const double delay = MAX2(veh2->getStopDelay(), arrivalDelay == INVALID_DOUBLE ? 0 : arrivalDelay);
897 if (delay > veh2->getFloatParam(toString(SUMO_TAG_OVERTAKING_REROUTE) + ".maxDelay", false, DEFAULT_MAXDELAY, false)) {
898 continue;
899 }
900 const ConstMSEdgeVector& route2 = veh2->getRoute().getEdges();
901 auto itOnMain2 = route2.end();
902 int mainIndex = 0;
903 for (const MSEdge* m : main) {
904 itOnMain2 = std::find(veh2->getCurrentRouteEdge(), route2.end(), m);
905 if (itOnMain2 != route2.end()) {
906 break;
907 }
908 mainIndex++;
909 }
910 if (itOnMain2 != route2.end() && itOnMain2 > veh2->getCurrentRouteEdge()) {
911 auto itOnMain = mainStart + mainIndex;
912 double timeToMain = 0;
913 // veh2 may be anywhere on the current edge so we have to discount
914 double timeToMain2 = -veh2->getEdge()->getMinimumTravelTime(veh2) * veh2->getPositionOnLane() / veh2->getEdge()->getLength();
915 for (auto it = veh.getCurrentRouteEdge(); it != itOnMain; it++) {
916 timeToMain += (*it)->getMinimumTravelTime(&veh);
917 }
918 for (auto it = veh2->getCurrentRouteEdge(); it != itOnMain2; it++) {
919 timeToMain2 += (*it)->getMinimumTravelTime(veh2);
920 }
921 double exitMain2Time = timeToMain2;
922 double commonTime = 0;
923 double commonTime2 = 0;
924 int nCommon = 0;
925 auto exitMain2 = itOnMain2;
926 while (itOnMain2 != route2.end() && *itOnMain == *itOnMain2) {
927 const MSEdge* common = *itOnMain;
928 commonTime += common->getMinimumTravelTime(&veh);
929 commonTime2 += common->getMinimumTravelTime(veh2);
930 if (nCommon < (int)main.size() - mainIndex) {
931 exitMain2Time = timeToMain2 + commonTime2;
932 }
933 nCommon++;
934 itOnMain++;
935 itOnMain2++;
936 }
937 exitMain2 += MIN2(nCommon, (int)main.size() - mainIndex);
938 const double saving = timeToMain + commonTime - (timeToMain2 + commonTime2);
939 const double loss = exitMain2Time; // lower bound because veh2 also has to exit the block
940 const double prio2 = veh2->getFloatParam(toString(SUMO_TAG_OVERTAKING_REROUTE) + ".prio", false, DEFAULT_PRIO_OVERTAKER, false);
941 const double netSaving = prio2 * saving - prio * loss;
942 //std::cout << " veh=" << veh.getID() << " veh2=" << veh2->getID()
943 // << " nCommon=" << nCommon << " cT=" << commonTime << " cT2=" << commonTime2 << " ttm=" << timeToMain << " ttm2=" << timeToMain2
944 // << " saving=" << saving << " loss=" << loss << " prio=" << prio << " prio2=" << prio2 << " netSaving=" << netSaving << "\n";
945 if (netSaving > def->minSaving) {
946 MSRailSignal* s = findSignal(veh2->getCurrentRouteEdge(), exitMain2);
947 if (s != nullptr) {
948 return std::make_pair(veh2, s);
949 }
950 }
951 }
952 }
953 }
954 return std::make_pair(nullptr, nullptr);
955}
956
957
958void
961#ifdef DEBUG_REROUTER
962 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << "\n";
963#endif
964 if (!ego.hasStops()) {
965 return;
966 }
967 const MSStop& stop = ego.getNextStop();
968 if (stop.reached || stop.joinTriggered || (stop.pars.arrival < 0 && stop.pars.until < 0)) {
969 return;
970 }
971 MSStoppingPlace* cur = nullptr;
972 for (MSStoppingPlace* sp : stop.getPlaces()) {
973 for (auto item : def->stopAlternatives) {
974 if (sp == item.first) {
975 cur = sp;
976 break;
977 }
978 }
979 }
980 if (cur == nullptr) {
981 return;
982 }
983 std::vector<const SUMOVehicle*> stopped = cur->getStoppedVehicles();
984#ifdef DEBUG_REROUTER
985 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << " stopped=" << toString(stopped) << "\n";
986#endif
987 SUMOTime stoppedDuration = -1;
988 if (stopped.empty()) {
990 const MSLane& stopLane = cur->getLane();
992 for (MSVehicleControl::constVehIt it_veh = c.loadedVehBegin(); it_veh != c.loadedVehEnd(); ++it_veh) {
993 const MSBaseVehicle* veh = dynamic_cast<const MSBaseVehicle*>((*it_veh).second);
994 if (veh->isOnRoad() && veh->hasStops()) {
995 const MSStop& vehStop = veh->getNextStop();
996 if (vehStop.pars.lane == stopLane.getID()) {
997 myBlockedStoppingPlaces.insert(cur);
998 if (veh->isStopped()) {
999 // stopped somewhere else on the same lane
1000 stoppedDuration = MAX3((SUMOTime)0, stoppedDuration, veh->getStopDuration());
1001 } else {
1002 std::pair<double, double> timeDist = veh->estimateTimeToNextStop();
1003 SUMOTime timeTo = TIME2STEPS(timeDist.first);
1004 stoppedDuration = MAX3((SUMOTime)0, stoppedDuration, timeTo + vehStop.getMinDuration(SIMSTEP + timeTo));
1005 }
1006 }
1007 }
1008 }
1009 } else {
1010 stoppedDuration = 0;
1011 for (const SUMOVehicle* veh : cur->getStoppedVehicles()) {
1012 stoppedDuration = MAX2(stoppedDuration, veh->getStopDuration());
1013 }
1014 }
1015 if (stoppedDuration < 0) {
1016 return;
1017 }
1019 const SUMOTime stopFree = SIMSTEP + stoppedDuration;
1020 const SUMOTime scheduledArrival = stop.pars.arrival >= 0 ? stop.pars.arrival : stop.pars.until - stop.pars.duration;
1021#ifdef DEBUG_REROUTER
1022 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << " stopFree=" << stopFree << " scheduledArrival=" << time2string(scheduledArrival) << "\n";
1023#endif
1024 if (stopFree < scheduledArrival) {
1025 // no conflict according to the schedule
1026 return;
1027 }
1028 const SUMOTime estimatedArrival = SIMSTEP + (stop.pars.arrival >= 0
1030 : TIME2STEPS(ego.getStopDelay()) - stop.pars.duration);
1031#ifdef DEBUG_REROUTER
1032 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << " stopFree=" << stopFree << " estimatedArrival=" << time2string(estimatedArrival) << "\n";
1033#endif
1034 if (stopFree < estimatedArrival) {
1035 // no conflict when considering current delay
1036 return;
1037 }
1038 const std::vector<double> probs(def->stopAlternatives.size(), 1.);
1039 StoppingPlaceParamMap_t scores = {};
1040 bool newDestination;
1041 ConstMSEdgeVector newRoute;
1042 // @todo: consider future conflicts caused by rerouting
1043 // @todo: reject alternatives with large detour
1044 const MSStoppingPlace* alternative = rerouteStoppingPlace(nullptr, def->stopAlternatives, probs, ego, newDestination, newRoute, scores);
1045#ifdef DEBUG_REROUTER
1046 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << " alternative=" << Named::getIDSecure(alternative) << "\n";
1047#endif
1048 if (alternative != nullptr) {
1049 // @todo adapt plans of any riders
1050 //for (MSTransportable* p : ego.getPersons()) {
1051 // p->rerouteParkingArea(ego.getNextParkingArea(), newParkingArea);
1052 //}
1053
1054 if (newDestination) {
1055 // update arrival parameters
1056 SUMOVehicleParameter* newParameter = new SUMOVehicleParameter();
1057 *newParameter = ego.getParameter();
1059 newParameter->arrivalPos = alternative->getEndLanePosition();
1060 ego.replaceParameter(newParameter);
1061 }
1062
1063 SUMOVehicleParameter::Stop newStop = stop.pars;
1064 newStop.lane = alternative->getLane().getID();
1065 newStop.startPos = alternative->getBeginLanePosition();
1066 newStop.endPos = alternative->getEndLanePosition();
1067 switch (alternative->getElement()) {
1069 newStop.parkingarea = alternative->getID();
1070 break;
1072 newStop.containerstop = alternative->getID();
1073 break;
1075 newStop.chargingStation = alternative->getID();
1076 break;
1078 newStop.overheadWireSegment = alternative->getID();
1079 break;
1080 case SUMO_TAG_BUS_STOP:
1082 default:
1083 newStop.busstop = alternative->getID();
1084 }
1085 std::string errorMsg;
1086 if (!ego.replaceStop(0, newStop, getID() + ":" + toString(SUMO_TAG_STATION_REROUTE), false, errorMsg)) {
1087 WRITE_WARNING("Vehicle '" + ego.getID() + "' at rerouter '" + getID()
1088 + "' could not perform stationReroute to '" + alternative->getID()
1089 + "' reason=" + errorMsg + ", time=" + time2string(MSNet::getInstance()->getCurrentTimeStep()) + ".");
1090 }
1091 }
1092}
1093
1094
1096MSTriggeredRerouter::findSignal(ConstMSEdgeVector::const_iterator begin, ConstMSEdgeVector::const_iterator end) {
1097 auto it = end;
1098 do {
1099 it--;
1100 const MSEdge* edge = *it;
1102 for (const MSLink* link : edge->getLanes().front()->getLinkCont()) {
1103 if (link->getTLLogic() != nullptr) {
1104 return dynamic_cast<MSRailSignal*>(const_cast<MSTrafficLightLogic*>(link->getTLLogic()));
1105 }
1106 }
1107 }
1108 } while (it != begin);
1109 return nullptr;
1110}
1111
1112bool
1114 if (myVehicleTypes.empty() || myVehicleTypes.count(obj.getVehicleType().getOriginalID()) > 0) {
1115 return true;
1116 } else {
1118 for (auto vTypeDist : vTypeDists) {
1119 if (myVehicleTypes.count(vTypeDist) > 0) {
1120 return true;
1121 }
1122 }
1123 return false;
1124 }
1125}
1126
1127
1128bool
1129MSTriggeredRerouter::affected(const std::set<SUMOTrafficObject::NumericalID>& edgeIndices, const MSEdgeVector& closed) {
1130 for (const MSEdge* const e : closed) {
1131 if (edgeIndices.count(e->getNumericalID()) > 0) {
1132 return true;
1133 }
1134 }
1135 return false;
1136}
1137
1138
1139void
1141 // if a parkingArea is a rerouting target, it should generally have a
1142 // rerouter on its edge or vehicles will be stuck there once it's full.
1143 // The user should receive a Warning in this case
1144 std::set<MSEdge*> parkingRerouterEdges;
1145 std::map<MSParkingArea*, std::string, ComparatorIdLess> targetedParkingArea; // paID -> targetingRerouter
1146 for (const auto& rr : myInstances) {
1147 bool hasParkingReroute = false;
1148 for (const RerouteInterval& interval : rr.second->myIntervals) {
1149 if (interval.parkProbs.getOverallProb() > 0) {
1150 hasParkingReroute = true;
1151 for (const StoppingPlaceVisible& pav : interval.parkProbs.getVals()) {
1152 targetedParkingArea[dynamic_cast<MSParkingArea*>(pav.first)] = rr.first;
1153 }
1154 }
1155 }
1156 if (hasParkingReroute) {
1157 parkingRerouterEdges.insert(rr.second->myEdges.begin(), rr.second->myEdges.end());
1158 }
1159 }
1160 for (const auto& item : targetedParkingArea) {
1161 if (parkingRerouterEdges.count(&item.first->getLane().getEdge()) == 0) {
1162 WRITE_WARNINGF(TL("ParkingArea '%' is targeted by rerouter '%' but doesn't have its own rerouter. This may cause parking search to abort."),
1163 item.first->getID(), item.second);
1164 }
1165 }
1166}
1167
1168
1169/****************************************************************************/
long long int SUMOTime
Definition GUI.h:36
std::vector< const MSEdge * > ConstMSEdgeVector
Definition MSEdge.h:74
std::vector< MSEdge * > MSEdgeVector
Definition MSEdge.h:73
#define DEBUGCOND(PED)
#define DEFAULT_PRIO_OVERTAKEN
#define DEFAULT_PRIO_OVERTAKER
assume that a faster train has more priority and a slower train doesn't matter
#define DEFAULT_MAXDELAY
#define WRITE_WARNINGF(...)
Definition MsgHandler.h:288
#define WRITE_WARNING(msg)
Definition MsgHandler.h:287
#define TL(string)
Definition MsgHandler.h:305
#define TLF(string,...)
Definition MsgHandler.h:307
std::shared_ptr< const MSRoute > ConstMSRoutePtr
Definition Route.h:32
SUMOTime string2time(const std::string &r)
convert string to SUMOTime
Definition SUMOTime.cpp:46
std::string time2string(SUMOTime t, bool humanReadable)
convert SUMOTime to string (independently of global format setting)
Definition SUMOTime.cpp:91
#define SIMSTEP
Definition SUMOTime.h:61
#define SUMOTime_MAX
Definition SUMOTime.h:34
#define SIMTIME
Definition SUMOTime.h:62
#define TIME2STEPS(x)
Definition SUMOTime.h:57
const SVCPermissions SVCAll
all VClasses are allowed
SVCPermissions parseVehicleClasses(const std::string &allowedS)
Parses the given definition of allowed vehicle classes into the given containers Deprecated classes g...
long long int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
@ SVC_AUTHORITY
authorities vehicles
@ GIVEN
The arrival position is given.
@ SUMO_TAG_INTERVAL
an aggreagated-output interval
@ SUMO_TAG_CLOSING_REROUTE
reroute of type closing
@ SUMO_TAG_CHARGING_STATION
A Charging Station.
@ SUMO_TAG_CONTAINER_STOP
A container stop.
@ SUMO_TAG_PARKING_AREA_REROUTE
entry for an alternative parking zone
@ SUMO_TAG_BUS_STOP
A bus stop.
@ SUMO_TAG_PARKING_AREA
A parking area.
@ SUMO_TAG_ROUTE_PROB_REROUTE
probability of route of a reroute
@ SUMO_TAG_VIA_PROB_REROUTE
probability of a via reroute
@ SUMO_TAG_TRAIN_STOP
A train stop (alias for bus stop)
@ SUMO_TAG_OVERHEAD_WIRE_SEGMENT
An overhead wire segment.
@ SUMO_TAG_DEST_PROB_REROUTE
probability of destination of a reroute
@ SUMO_TAG_OVERTAKING_REROUTE
decision point for rerouting to be overtaken
@ SUMO_TAG_CLOSING_LANE_REROUTE
lane of a reroute of type closing
@ SUMO_TAG_STATION_REROUTE
decision point for switching trainStop/busStop within a station
@ SUMO_ATTR_DISALLOW
@ SUMO_ATTR_ALLOW
@ SUMO_ATTR_MAIN
@ SUMO_ATTR_BEGIN
weights: time range begin
@ SUMO_ATTR_MINSAVING
@ SUMO_ATTR_END
weights: time range end
@ SUMO_ATTR_PROB
@ SUMO_ATTR_SIDING
@ SUMO_ATTR_ID
@ SUMO_ATTR_VISIBLE
const double INVALID_DOUBLE
invalid double
Definition StdDefs.h:64
T MIN2(T a, T b)
Definition StdDefs.h:76
T MAX2(T a, T b)
Definition StdDefs.h:82
T MAX3(T a, T b, T c)
Definition StdDefs.h:96
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
Definition ToString.h:46
int main(int argc, char *argv[])
bool compute(const E *from, const E *to, const double departPos, const std::string &originStopID, const double arrivalPos, const std::string &stopID, const double speed, const V *const vehicle, const SVCPermissions modeSet, const SUMOTime msTime, std::vector< TripItem > &into, const double externalFactor=0.)
Builds the route between the given edges using the minimum effort at the given time The definition of...
MESegment * getSegmentForEdge(const MSEdge &e, double pos=0)
Get the segment for a given edge at a given position.
Definition MELoop.cpp:340
void addDetector(MSMoveReminder *data, int queueIndex=-1)
Adds a data collector for a detector to this segment.
The base class for microscopic and mesoscopic vehicles.
double getMaxSpeed() const
Returns the maximum speed (the minimum of desired and technical maximum speed)
bool replaceStop(int nextStopIndex, SUMOVehicleParameter::Stop stop, const std::string &info, bool teleport, std::string &errorMsg)
virtual double getStopDelay() const
Returns the estimated public transport stop (departure) delay in seconds.
const SUMOVehicleParameter & getParameter() const
Returns the vehicle's parameter (including departure definition)
void replaceParameter(const SUMOVehicleParameter *newParameter)
replace the vehicle parameter (deleting the old one)
const MSRouteIterator & getCurrentRouteEdge() const
Returns an iterator pointing to the current edge in this vehicles route.
const MSEdge * getEdge() const
Returns the edge the vehicle is currently at.
virtual std::pair< double, double > estimateTimeToNextStop() const
return time (s) and distance to the next stop
bool hasStops() const
Returns whether the vehicle has to stop somewhere.
const MSStop & getNextStop() const
virtual double getStopArrivalDelay() const
Returns the estimated public transport stop arrival delay in seconds.
SUMOTime getStopDuration() const
get remaining stop duration or 0 if the vehicle isn't stopped
const MSRoute & getRoute() const
Returns the current route.
virtual bool isOnRoad() const
Returns the information whether the vehicle is on a road (is simulated)
bool isStopped() const
Returns whether the vehicle is at a stop.
A device that performs vehicle rerouting based on current edge speeds.
A road/street connecting two junctions.
Definition MSEdge.h:77
const std::vector< MSLane * > & getLanes() const
Returns this edge's lanes.
Definition MSEdge.h:168
const MSJunction * getToJunction() const
Definition MSEdge.h:418
double getLength() const
return the length of the edge
Definition MSEdge.h:685
double getMinimumTravelTime(const SUMOVehicle *const veh) const
returns the minimum travel time for the given vehicle
Definition MSEdge.h:476
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....
Definition MSEdge.cpp:1047
virtual void addEvent(Command *operation, SUMOTime execTimeStep=-1)
Adds an Event.
static bool gUseMesoSim
Definition MSGlobals.h:106
static MELoop * gMesoNet
mesoscopic simulation infrastructure
Definition MSGlobals.h:112
static int gNumSimThreads
how many threads to use for simulation
Definition MSGlobals.h:146
SumoXMLNodeType getType() const
return the type of this Junction
Definition MSJunction.h:133
Representation of a lane in the micro simulation.
Definition MSLane.h:84
static bool dictionary(const std::string &id, MSLane *lane)
Static (sic!) container methods {.
Definition MSLane.cpp:2463
Something on a lane to be noticed about vehicle movement.
Notification
Definition of a vehicle state.
@ NOTIFICATION_LANE_CHANGE
The vehicle changes lanes (micro only)
@ NOTIFICATION_JUNCTION
The vehicle arrived at a junction.
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
Definition MSNet.cpp:186
MSEventControl * getBeginOfTimestepEvents()
Returns the event control for events executed at the begin of a time step.
Definition MSNet.h:476
SUMOTime getCurrentTimeStep() const
Returns the current simulation step.
Definition MSNet.h:325
MSStoppingPlace * getStoppingPlace(const std::string &id, const SumoXMLTag category) const
Returns the named stopping place of the given category.
Definition MSNet.cpp:1404
MSTransportableRouter & getIntermodalRouter(int rngIndex, const int routingMode=0, const MSEdgeVector &prohibited=MSEdgeVector()) const
Definition MSNet.cpp:1578
MSVehicleRouter & getRouterTT(int rngIndex, const MSEdgeVector &prohibited=MSEdgeVector()) const
Definition MSNet.cpp:1531
MSVehicleControl & getVehicleControl()
Returns the vehicle control.
Definition MSNet.h:383
A lane area vehicles can halt at.
A signal for rails.
void addConstraint(const std::string &tripId, MSRailSignalConstraint *constraint)
register constraint for signal switching
const ConstMSEdgeVector & getEdges() const
Definition MSRoute.h:125
MSRouteIterator end() const
Returns the end of the list of edges to pass.
Definition MSRoute.cpp:79
bool containsAnyOf(const MSEdgeVector &edgelist) const
Definition MSRoute.cpp:243
static bool dictionary(const std::string &id, ConstMSRoutePtr route)
Adds a route to the dictionary.
Definition MSRoute.cpp:109
static MSVehicleRouter & getRouterTT(const int rngIndex, SUMOVehicleClass svc, const MSEdgeVector &prohibited=MSEdgeVector())
return the vehicle router instance
static MSTransportableRouter & getIntermodalRouterTT(const int rngIndex, const MSEdgeVector &prohibited=MSEdgeVector())
return the person router instance
std::vector< MSStoppingPlace * > getPlaces() const
return all stoppingPlaces associated with this stop
Definition MSStop.cpp:175
bool joinTriggered
whether coupling another vehicle (train) the vehicle continue
Definition MSStop.h:73
SUMOTime getMinDuration(SUMOTime time) const
return minimum stop duration when starting stop at time
Definition MSStop.cpp:134
bool reached
Information whether the stop has been reached.
Definition MSStop.h:75
MSRouteIterator edge
The edge in the route to stop at.
Definition MSStop.h:48
const SUMOVehicleParameter::Stop pars
The stop parameter.
Definition MSStop.h:65
A lane area vehicles can halt at.
std::vector< const SUMOVehicle * > getStoppedVehicles() const
get list of vehicles waiting at this stop
double getBeginLanePosition() const
Returns the begin position of this stop.
SumoXMLTag getElement() const
return the type of this stopping place
double getEndLanePosition() const
Returns the end position of this stop.
const MSLane & getLane() const
Returns the lane this stop is located at.
std::map< std::string, double > StoppingPlaceParamMap_t
MSStoppingPlace * rerouteStoppingPlace(MSStoppingPlace *destStoppingPlace, const std::vector< StoppingPlaceVisible > &stoppingPlaceCandidates, const std::vector< double > &probs, SUMOVehicle &veh, bool &newDestination, ConstMSEdgeVector &newRoute, StoppingPlaceParamMap_t &scores, const MSEdgeVector &closedEdges={}, const int insertStopIndex=0, const bool keepCurrentStop=true)
main method to trigger the rerouting to the "best" StoppingPlace according to the custom evaluation f...
std::pair< MSStoppingPlace *, bool > StoppingPlaceVisible
The parent class for traffic light logics.
SUMOTime setPermissions(const SUMOTime currentTime)
Sets the edge permission if there are any defined in the closingEdge.
bool notifyEnter(SUMOTrafficObject &veh, MSMoveReminder::Notification reason, const MSLane *enteredLane=0)
Tries to reroute the vehicle.
int getNumberStoppingPlaceReroutes(SUMOVehicle &veh)
ask how many times already the vehicle has been rerouted to another stopping place
bool notifyMove(SUMOTrafficObject &veh, double oldPos, double newPos, double newSpeed)
Triggers rerouting (once) for vehicles that are already on the edge when the rerouter activates.
MSRailSignal * findSignal(ConstMSEdgeVector::const_iterator begin, ConstMSEdgeVector::const_iterator end)
find the last downstream signal on the given route
bool notifyLeave(SUMOTrafficObject &veh, double lastPos, MSMoveReminder::Notification reason, const MSLane *enteredLane=0)
Removes the reminder.
MSTriggeredRerouter(const std::string &id, const MSEdgeVector &edges, double prob, bool off, bool optional, SUMOTime timeThreshold, const std::string &vTypes, const Position &pos, const double radius)
Constructor.
double getUserProbability() const
Returns the rerouting probability given by the user.
MSParkingArea * rerouteParkingArea(const MSTriggeredRerouter::RerouteInterval *rerouteDef, SUMOVehicle &veh, bool &newDestination, ConstMSEdgeVector &newRoute)
search for an alternative ParkingArea
bool myHaveParkProbs
whether this rerouter has loaded parkingReroute definitions
virtual void myStartElement(int element, const SUMOSAXAttributes &attrs)
Called on the opening of a tag;.
bool myAmOptional
Information whether the rerouting will only take place on request.
static bool affected(const std::set< SUMOTrafficObject::NumericalID > &edgeIndices, const MSEdgeVector &closed)
void setUserUsageProbability(double prob)
Sets the probability with which a vehicle is rerouted given by the user.
Position myPosition
Where are we located in the network.
std::pair< const SUMOVehicle *, MSRailSignal * > overtakingTrain(const SUMOVehicle &veh, ConstMSEdgeVector::const_iterator mainStart, const MSTriggeredRerouter::RerouteInterval *)
determine whether veh should switch from main to siding to be overtaken and return the overtaking veh...
void rememberStoppingPlaceScore(SUMOVehicle &veh, MSStoppingPlace *parkingArea, const std::string &score)
store the score of the ParkingArea in the vehicle
void rememberBlockedStoppingPlace(SUMOVehicle &veh, const MSStoppingPlace *parkingArea, bool blocked)
store the blocked ParkingArea in the vehicle
double getStoppingPlaceOccupancy(MSStoppingPlace *sp)
Return the number of occupied places of the stopping place.
static MSEdge mySpecialDest_terminateRoute
virtual void myEndElement(int element)
Called when a closing tag occurs.
void checkStopSwitch(MSBaseVehicle &veh, const MSTriggeredRerouter::RerouteInterval *def)
consider switching the location of the upcoming stop
bool triggerRouting(SUMOTrafficObject &veh, MSMoveReminder::Notification reason)
double myRadius
At which distance are we activated.
void resetStoppingPlaceScores(SUMOVehicle &veh)
reset all stored ParkingArea scores for this vehicle
double myProbability
The probability and the user-given probability.
SUMOTime sawBlockedStoppingPlace(SUMOVehicle &veh, MSStoppingPlace *parkingArea, bool local)
get the time the ParkingArea was considered full from this vehicle
virtual ~MSTriggeredRerouter()
Destructor.
bool inUserMode() const
Returns whether the user is setting the rerouting probability.
void setNumberStoppingPlaceReroutes(SUMOVehicle &veh, int value)
update the number of reroutes for the vehicle
std::set< const MSStoppingPlace * > myBlockedStoppingPlaces
double getStoppingPlaceCapacity(MSStoppingPlace *sp)
Return the number of places the stopping place provides.
std::set< std::string > myVehicleTypes
The vehicle types to look for (empty means all)
const RerouteInterval * getCurrentReroute(SUMOTime time, SUMOTrafficObject &obj) const
Returns the rerouting definition valid for the given time and object, nullptr if none.
static void checkParkingRerouteConsistency()
issues warning for incomplete parkingReroute relationships
double getLastStepStoppingPlaceOccupancy(MSStoppingPlace *sp)
Return the number of occupied places of the stopping place from the previous time step.
static std::map< std::string, MSTriggeredRerouter * > myInstances
bool applies(const SUMOTrafficObject &obj) const
Checks whether the detector measures objects of the given type.
bool myAmInUserMode
Information whether the current rerouting probability is the user-given.
const MSEdgeVector myEdges
edges where vehicles are notified
static MSEdge mySpecialDest_keepDestination
special destination values
RerouteInterval myParsedRerouteInterval
used during loading
double getProbability() const
Returns the rerouting probability.
std::vector< RerouteInterval > myIntervals
List of rerouting definition intervals.
void setUserMode(bool val)
Sets whether the process is currently steered by the user.
The class responsible for building and deletion of vehicles.
std::map< std::string, SUMOVehicle * >::const_iterator constVehIt
Definition of the internal vehicles map iterator.
constVehIt loadedVehBegin() const
Returns the begin of the internal vehicle map.
constVehIt loadedVehEnd() const
Returns the end of the internal vehicle map.
const std::set< std::string > getVTypeDistributionMembership(const std::string &id) const
Return the distribution IDs the vehicle type is a member of.
const std::string & getOriginalID() const
Returns the id of the original vehicle type if this is a vehicle specific type, the id otherwise.
Base class for objects which have an id.
Definition Named.h:54
static std::string getIDSecure(const T *obj, const std::string &fallBack="NULL")
get an identifier for Named-like object which may be Null
Definition Named.h:67
const std::string & getID() const
Returns the id.
Definition Named.h:74
static OptionsCont & getOptions()
Retrieves the options.
A point in 2D or 3D with translation and scaling methods.
Definition Position.h:37
static const Position INVALID
used to indicate that a position is valid
Definition Position.h:319
double distanceTo(const Position &p2) const
returns the euclidean distance in 3 dimensions
Definition Position.h:263
static double rand(SumoRNG *rng=nullptr)
Returns a random real number in [0, 1)
Represents a generic random distribution.
double getOverallProb() const
Return the sum of the probabilites assigned to the members.
T get(SumoRNG *which=nullptr) const
Draw a sample of the distribution.
bool add(T val, double prob, bool checkDuplicates=true)
Adds a value with an assigned probability to the distribution.
const std::vector< T > & getVals() const
Returns the members of the distribution.
bool remove(T val)
Removes a value with an assigned probability from the distribution.
const std::vector< double > & getProbs() const
Returns the probabilities assigned to the members of the distribution.
virtual bool compute(const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false)=0
Builds the route between the given edges using the minimum effort at the given time The definition of...
virtual double recomputeCosts(const std::vector< const E * > &edges, const V *const v, SUMOTime msTime, double *lengthp=nullptr) const
Encapsulated SAX-Attributes.
T getOpt(int attr, const char *objectid, bool &ok, T defaultValue=T(), bool report=true) const
Tries to read given attribute assuming it is an int.
SUMOTime getOptSUMOTimeReporting(int attr, const char *objectid, bool &ok, SUMOTime defaultValue, bool report=true) const
Tries to read given attribute assuming it is a SUMOTime.
virtual std::string getStringSecure(int id, const std::string &def) const =0
Returns the string-value of the named (by its enum-value) attribute.
T get(int attr, const char *objectid, bool &ok, bool report=true) const
Tries to read given attribute assuming it is an int.
virtual bool hasAttribute(int id) const =0
Returns the information whether the named (by its enum-value) attribute is within the current list.
Representation of a vehicle, person, or container.
virtual bool isVehicle() const
Whether it is a vehicle.
virtual const MSVehicleType & getVehicleType() const =0
Returns the object's "vehicle" type.
virtual const MSLane * getLane() const =0
Returns the lane the object is currently at.
virtual int getRNGIndex() const =0
virtual MSDevice * getDevice(const std::type_info &type) const =0
Returns a device of the given type if it exists or nullptr if not.
virtual bool replaceRoute(ConstMSRoutePtr route, const std::string &info, bool onInit=false, int offset=0, bool addStops=true, bool removeStops=true, std::string *msgReturn=nullptr)=0
Replaces the current route by the given one.
virtual SUMOTime getWaitingTime(const bool accumulated=false) const =0
virtual const SUMOVehicleParameter & getParameter() const =0
Returns the vehicle's parameter (including departure definition)
virtual double getMaxSpeed() const =0
Returns the object's maximum speed (minimum of technical and desired maximum speed)
virtual SUMOVehicleClass getVClass() const =0
Returns the object's access class.
virtual SumoRNG * getRNG() const =0
Returns the associated RNG for this object.
virtual Position getPosition(const double offset=0) const =0
Return current position (x/y, cartesian)
double getFloatParam(const std::string &paramName, const bool required=false, const double deflt=INVALID_DOUBLE, bool checkDist=true) const
Retrieve a floating point parameter for the traffic object.
virtual const std::set< NumericalID > getUpcomingEdgeIDs() const =0
returns the numerical IDs of edges to be used (possibly of future stages)
virtual const MSEdge * getEdge() const =0
Returns the edge the object is currently at.
virtual const MSEdge * getRerouteDestination() const =0
Returns the end point for reroutes (usually the last edge of the route)
virtual double getPositionOnLane() const =0
Get the object's position along the lane.
Representation of a vehicle.
Definition SUMOVehicle.h:62
virtual bool reroute(SUMOTime t, const std::string &info, SUMOAbstractRouter< MSEdge, SUMOVehicle > &router, const bool onInit=false, const bool withTaz=false, const bool silent=false, const MSEdge *sink=nullptr)=0
Performs a rerouting using the given router.
virtual SUMOTime sawBlockedParkingArea(const MSStoppingPlace *pa, bool local) const =0
virtual bool replaceRouteEdges(ConstMSEdgeVector &edges, double cost, double savings, const std::string &info, bool onInit=false, bool check=false, bool removeStops=true, std::string *msgReturn=nullptr)=0
Replaces the current route by the given edges.
virtual bool replaceParkingArea(MSParkingArea *parkingArea, std::string &errorMsg)=0
Replaces a stop.
virtual bool hasStops() const =0
Returns whether the vehicle has to stop somewhere.
virtual MSParkingArea * getNextParkingArea()=0
virtual void rememberParkingAreaScore(const MSStoppingPlace *pa, const std::string &score)=0
virtual void rememberBlockedParkingArea(const MSStoppingPlace *pa, bool local)=0
virtual double getLength() const =0
Returns the vehicles's length.
virtual int getNumberParkingReroutes() const =0
virtual const std::vector< MSTransportable * > & getPersons() const =0
retrieve riding persons
virtual void replaceParameter(const SUMOVehicleParameter *newParameter)=0
Replaces the vehicle's parameter.
virtual void resetParkingAreaScores()=0
virtual const MSStop & getNextStop() const =0
virtual void setArrivalPos(double arrivalPos)=0
Sets this vehicle's desired arrivalPos for its current route.
virtual const ConstMSEdgeVector::const_iterator & getCurrentRouteEdge() const =0
Returns an iterator pointing to the current edge in this vehicles route.
virtual void setNumberParkingReroutes(int value)=0
virtual const MSRoute & getRoute() const =0
Returns the current route.
Definition of vehicle stop (position and duration)
std::string lane
The lane to stop at.
std::string parkingarea
(Optional) parking area if one is assigned to the stop
double startPos
The stopping position start.
std::string chargingStation
(Optional) charging station if one is assigned to the stop
std::string overheadWireSegment
(Optional) overhead line segment if one is assigned to the stop
SUMOTime until
The time at which the vehicle may continue its journey.
double endPos
The stopping position end.
std::string busstop
(Optional) bus stop if one is assigned to the stop
std::string containerstop
(Optional) container stop if one is assigned to the stop
SUMOTime arrival
The (expected) time at which the vehicle reaches the stop.
SUMOTime duration
The stopping duration.
Structure representing possible vehicle parameter.
double arrivalPos
(optional) The position the vehicle shall arrive on
ArrivalPosDefinition arrivalPosProcedure
Information how the vehicle shall choose the arrival position.
A scoped lock which only triggers on condition.
std::vector< std::string > getVector()
return vector of strings
A wrapper for a Command function.
SUMOTime begin
The begin time these definitions are valid.
RandomDistributor< MSStoppingPlaceRerouter::StoppingPlaceVisible > parkProbs
The distributions of new parking areas to use as destinations.
MSEdgeVector siding
The list of siding edges.
std::vector< MSStoppingPlaceRerouter::StoppingPlaceVisible > stopAlternatives
RandomDistributor< ConstMSRoutePtr > routeProbs
The distributions of new routes to use.
SUMOTime end
The end time these definitions are valid.
double sidingLength
The usable length of the siding.
MSRailSignal * sidingExit
The rail signal at the end of the siding.
RandomDistributor< MSEdge * > edgeProbs
The distributions of new destinations or vias to use.
std::map< MSLane *, SVCPermissions > closedLanes
The list of closed lanes to their permissions.
std::map< MSEdge *, SVCPermissions > closed
The map of closed edges to their permissions.
bool isVia
The edge probs are vias and not destinations.
MSEdgeVector closedLanesAffected
The list of edges that are affected by closed lanes.
bool permissionsAllowAll
The permissions are all SVCAll.
double minSaving
The threshold in savings for triggering reroute.