51 #ifdef CHECK_MEMORY_LEAKS
53 #endif // CHECK_MEMORY_LEAKS
64 const bool tryRepair,
const bool mayBeDisconnected) :
66 myPrecomputed(0), myLastUsed(lastUsed), myTryRepair(tryRepair), myMayBeDisconnected(mayBeDisconnected)
113 mh->
inform(
"Vehicle '" + veh.
getID() +
"' is not allowed to depart on edge '" +
119 mh->
inform(
"Vehicle '" + veh.
getID() +
"' is not allowed to arrive on edge '" +
161 if (oldEdges.size() == 1) {
164 router.
compute(oldEdges.front(), 0, &veh, begin, newEdges);
170 mandatory.push_back(oldEdges.front());
172 for (ConstROEdgeVector::const_iterator i = stops.begin(); i != stops.end(); ++i) {
173 if (*i != mandatory.back()) {
174 mandatory.push_back(*i);
177 if (mandatory.size() < 2 || oldEdges.back() != mandatory.back()) {
178 mandatory.push_back(oldEdges.back());
180 assert(mandatory.size() >= 2);
182 for (ConstROEdgeVector::iterator i = oldEdges.begin(); i != oldEdges.end();) {
183 if ((*i)->prohibits(&veh)) {
184 if (std::find(mandatory.begin(), mandatory.end(), *i) != mandatory.end()) {
185 mh->
inform(
"Mandatory edge '" + (*i)->getID() +
"' does not allow vehicle '" + veh.
getID() +
"'.");
188 i = oldEdges.erase(i);
194 newEdges.push_back(*(oldEdges.begin()));
195 ConstROEdgeVector::iterator nextMandatory = mandatory.begin() + 1;
196 size_t lastMandatory = 0;
197 for (ConstROEdgeVector::iterator i = oldEdges.begin() + 1;
198 i != oldEdges.end() && nextMandatory != mandatory.end(); ++i) {
199 if ((*(i - 1))->isConnectedTo(*i, &veh)) {
200 newEdges.push_back(*i);
203 router.
compute(newEdges.back(), *i, &veh, begin, edges);
204 if (edges.size() == 0) {
210 if (newEdges.back() != newEdges[lastMandatory]) {
211 router.
compute(newEdges[lastMandatory], *nextMandatory, &veh, begin, edges);
213 if (edges.size() == 0) {
214 mh->
inform(
"Mandatory edge '" + (*i)->getID() +
"' not reachable by vehicle '" + veh.getID() +
"'.");
217 while (*i != *nextMandatory) {
220 newEdges.erase(newEdges.begin() + lastMandatory + 1, newEdges.end());
223 std::copy(edges.begin() + 1, edges.end(), back_inserter(newEdges));
225 if (*i == *nextMandatory) {
227 lastMandatory = newEdges.size() - 1;
291 if ((*i)->getProbability() == 0) {
309 newSum += (*i)->getProbability();
314 (*i)->setProbability((*i)->getProbability() / newSum);
322 chosen -= (*i)->getProbability();
340 bool asAlternatives,
bool withExitTimes)
const {
341 if (asAlternatives) {
344 myAlternatives[i]->writeXMLDefinition(dev, veh,
true, withExitTimes);
361 edges.push_back(route->
getLast());
383 sum += (*i)->getProbability();
SUMOTime getDepartureTime() const
Returns the time the vehicle starts at, 0 for triggered vehicles.
static MsgHandler * getWarningInstance()
Returns the instance to add warnings to.
const std::string & getID() const
Returns the id of the vehicle.
OutputDevice & writeAttr(const SumoXMLAttr attr, const T &val)
writes a named attribute
bool myNewRoute
Information whether a new route was generated.
static MsgHandler * getErrorInstance()
Returns the instance to add errors to.
RORouteDef * copyOrigDest(const std::string &id) const
Returns a origin-destination copy of the route definition.
Some static methods for string processing.
void addAlternative(SUMOAbstractRouter< ROEdge, ROVehicle > &router, const ROVehicle *const, RORoute *current, SUMOTime begin)
Adds an alternative to the list of routes.
RORoute * buildCurrentRoute(SUMOAbstractRouter< ROEdge, ROVehicle > &router, SUMOTime begin, const ROVehicle &veh) const
Triggers building of the complete route (via preComputeCurrentRoute) or returns precomputed route...
void addAlternativeDef(const RORouteDef *alternative)
Adds an alternative loaded from the file.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
static SUMOReal rand()
Returns a random real number in [0, 1)
const ConstROEdgeVector & getEdgeVector() const
Returns the list of edges this route consists of.
void setProbability(SUMOReal prob)
Sets the probability of the route.
void preComputeCurrentRoute(SUMOAbstractRouter< ROEdge, ROVehicle > &router, SUMOTime begin, const ROVehicle &veh) const
Builds the complete route (or chooses her from the list of alternatives, when existing) ...
void repairCurrentRoute(SUMOAbstractRouter< ROEdge, ROVehicle > &router, SUMOTime begin, const ROVehicle &veh) const
Builds the complete route (or chooses her from the list of alternatives, when existing) ...
std::vector< const ROEdge * > ConstROEdgeVector
#define WRITE_WARNING(msg)
static OptionsCont & getOptions()
Retrieves the options.
RORoute * myPrecomputed
precomputed route for out-of-order computation
const std::string & getID() const
Returns the id.
const bool myMayBeDisconnected
A vehicle as used by router.
const ROEdge * getLast() const
Returns the last edge in the route.
std::set< RORoute * > myRouteRefs
Routes which are deleted someplace else.
OutputDevice & writeXMLDefinition(OutputDevice &dev, const ROVehicle *const veh, bool asAlternatives, bool withExitTimes) const
Saves the built route / route alternatives.
const RGBColor * getColor() const
Returns this route's color.
SUMOReal getProbability() const
Returns the probability the driver will take this route with.
void setCosts(SUMOReal costs)
Sets the costs of the route.
Abstract base class providing static factory method.
const ROEdge * getDestination() const
const ROEdge * getFirst() const
Returns the first edge in the route.
A basic edge for routing applications.
Base class for objects which have an id.
virtual ~RORouteDef()
Destructor.
unsigned int myLastUsed
Index of the route used within the last step.
std::string myID
The name of the object.
const ConstROEdgeVector & getStopEdges() const
RORouteDef * copy(const std::string &id) const
Returns a deep copy of the route definition.
void inform(std::string msg, bool addType=true)
adds a new error to the list
Base class for a vehicle's route definition.
void addLoadedAlternative(RORoute *alternative)
Adds a single alternative loaded from the file An alternative may also be generated during DUA...
Static storage of an output device and its base (abstract) implementation.
virtual SUMOReal recomputeCosts(const std::vector< const E * > &edges, const V *const v, SUMOTime msTime) const =0
bool closeTag()
Closes the most recently opened tag.
virtual void compute(const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into)=0
Builds the route between the given edges using the minimum effort at the given time The definition of...
static RouteCostCalculator< R, E, V > & getCalculator()
RORouteDef(const std::string &id, const unsigned int lastUsed, const bool tryRepair, const bool mayBeDisconnected)
Constructor.
std::vector< RORoute * > myAlternatives
The alternatives.
SUMOReal getOverallProb() const
Returns the sum of the probablities of the contained routes.
const std::vector< SUMOVehicleParameter::Stop > & getStops() const
Returns the list of stops this route contains.
OutputDevice & openTag(const std::string &xmlElement)
Opens an XML tag.
A complete router's route.