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) {
115 mh->
inform(
"Vehicle '" + veh.
getID() +
"' is not allowed to depart on edge '" +
123 mh->
inform(
"Vehicle '" + veh.
getID() +
"' is not allowed to arrive on edge '" +
179 const int initialSize = (int)oldEdges.size();
180 if (initialSize == 1) {
183 router.
compute(oldEdges.front(), 0, &veh, begin, newEdges);
189 if (oldEdges.front()->prohibits(&veh)) {
191 const std::string& frontID = oldEdges.front()->getID();
192 for (ConstROEdgeVector::iterator i = oldEdges.begin(); i != oldEdges.end();) {
193 if ((*i)->prohibits(&veh)) {
194 i = oldEdges.erase(i);
197 +
"' to '" + (*i)->getID() +
"' for vehicle '" + veh.
getID() +
"'.");
202 if (oldEdges.size() == 0) {
203 mh->
inform(
"Could not find new starting edge for vehicle '" + veh.
getID() +
"'.");
206 mandatory.push_back(oldEdges.front());
208 for (ConstROEdgeVector::const_iterator i = stops.begin(); i != stops.end(); ++i) {
209 if (*i != mandatory.back()) {
210 mandatory.push_back(*i);
213 if (oldEdges.back()->prohibits(&veh)) {
215 const std::string& backID = oldEdges.back()->getID();
217 while (oldEdges.back()->prohibits(&veh)) {
221 +
"' to edge '" + oldEdges.back()->getID() +
"' for vehicle '" + veh.
getID() +
"'.");
223 if (mandatory.size() < 2 || oldEdges.back() != mandatory.back()) {
224 mandatory.push_back(oldEdges.back());
226 assert(mandatory.size() >= 2);
228 for (ConstROEdgeVector::iterator i = oldEdges.begin(); i != oldEdges.end();) {
229 if ((*i)->prohibits(&veh)) {
231 i = oldEdges.erase(i);
237 if (mandatory.size() > oldEdges.size() && initialSize > 2) {
238 WRITE_MESSAGE(
"There are stop edges which were not part of the original route for vehicle '" + veh.
getID() +
"'.");
240 const ConstROEdgeVector& targets = mandatory.size() > oldEdges.size() ? mandatory : oldEdges;
241 newEdges.push_back(*(targets.begin()));
242 ConstROEdgeVector::iterator nextMandatory = mandatory.begin() + 1;
243 int lastMandatory = 0;
244 for (ConstROEdgeVector::const_iterator i = targets.begin() + 1;
245 i != targets.end() && nextMandatory != mandatory.end(); ++i) {
246 if ((*(i - 1))->isConnectedTo(*i, &veh)) {
247 newEdges.push_back(*i);
249 if (initialSize > 2) {
251 WRITE_MESSAGE(
"Edge '" + (*(i - 1))->
getID() +
"' not connected to edge '" + (*i)->getID() +
"' for vehicle '" + veh.
getID() +
"'.");
253 const ROEdge*
const last = newEdges.back();
255 if (!router.
compute(last, *i, &veh, begin, newEdges)) {
262 if (lastMandatory >= (
int)newEdges.size() || last == newEdges[lastMandatory] || !router.
compute(newEdges[lastMandatory], *nextMandatory, &veh, begin, edges)) {
263 mh->
inform(
"Mandatory edge '" + (*i)->getID() +
"' not reachable by vehicle '" + veh.
getID() +
"'.");
266 while (*i != *nextMandatory) {
269 newEdges.erase(newEdges.begin() + lastMandatory + 1, newEdges.end());
270 std::copy(edges.begin() + 1, edges.end(), back_inserter(newEdges));
273 if (*i == *nextMandatory) {
275 lastMandatory = (int)newEdges.size() - 1;
329 if ((*i)->getProbability() == 0) {
347 newSum += (*i)->getProbability();
352 (*i)->setProbability((*i)->getProbability() / newSum);
360 chosen -= (*i)->getProbability();
378 bool asAlternatives,
bool withExitTimes)
const {
379 if (asAlternatives) {
382 myAlternatives[i]->writeXMLDefinition(dev, veh,
true, withExitTimes);
399 edges.push_back(route->
getLast());
423 sum += (*i)->getProbability();
RORouteDef * copy(const std::string &id, const SUMOTime stopOffset) const
Returns a deep copy of the route definition.
int myLastUsed
Index of the route used within the last step.
static MsgHandler * getWarningInstance()
Returns the instance to add warnings to.
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.
virtual SUMOReal recomputeCosts(const std::vector< const E *> &edges, const V *const v, SUMOTime msTime) const =0
OutputDevice & writeXMLDefinition(OutputDevice &dev, const ROVehicle *const veh, bool asAlternatives, bool withExitTimes) const
Saves the built route / route alternatives.
SUMOReal getOverallProb() const
Returns the sum of the probablities of the contained routes.
const ROEdge * getDestination() const
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.
void addAlternativeDef(const RORouteDef *alternative)
Adds an alternative loaded from the file.
bool repairCurrentRoute(SUMOAbstractRouter< ROEdge, ROVehicle > &router, SUMOTime begin, const ROVehicle &veh, ConstROEdgeVector oldEdges, ConstROEdgeVector &newEdges) const
Builds the complete route (or chooses her from the list of alternatives, when existing) ...
static SUMOReal rand()
Returns a random real number in [0, 1)
virtual bool 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...
void setProbability(SUMOReal prob)
Sets the probability of the route.
void addStopOffset(const SUMOTime offset)
Adapts the until time of all stops by the given offset.
const ROEdge * getFirst() const
Returns the first edge in the route.
RORouteDef * copyOrigDest(const std::string &id) const
Returns a origin-destination copy of the route definition.
std::vector< const ROEdge * > ConstROEdgeVector
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
const std::string & getID() const
Returns the id.
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) ...
#define WRITE_WARNING(msg)
static OptionsCont & getOptions()
Retrieves the options.
RORoute * buildCurrentRoute(SUMOAbstractRouter< ROEdge, ROVehicle > &router, SUMOTime begin, const ROVehicle &veh) const
Triggers building of the complete route (via preComputeCurrentRoute) or returns precomputed route...
RORoute * myPrecomputed
precomputed route for out-of-order computation
const bool myMayBeDisconnected
A vehicle as used by router.
std::set< RORoute * > myRouteRefs
Routes which are deleted someplace else.
const std::vector< SUMOVehicleParameter::Stop > & getStops() const
Returns the list of stops this route contains.
void setCosts(SUMOReal costs)
Sets the costs of the route.
const ConstROEdgeVector & getStopEdges() const
const ROEdge * getLast() const
Returns the last edge in the route.
RORouteDef(const std::string &id, const int lastUsed, const bool tryRepair, const bool mayBeDisconnected)
Constructor.
Abstract base class providing static factory method.
const std::string & getID() const
Returns the id of the vehicle.
SUMOTime getDepartureTime() const
Returns the time the vehicle starts at, 0 for triggered vehicles.
const RGBColor * getColor() const
Returns this route's color.
A basic edge for routing applications.
Base class for objects which have an id.
virtual ~RORouteDef()
Destructor.
std::string myID
The name of the object.
SUMOReal getProbability() const
Returns the probability the driver will take this route with.
const ConstROEdgeVector & getEdgeVector() const
Returns the list of edges this route consists of.
void inform(std::string msg, bool addType=true)
adds a new error to the list
A storage for options typed value containers)
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.
bool closeTag()
Closes the most recently opened tag.
static RouteCostCalculator< R, E, V > & getCalculator()
#define WRITE_MESSAGE(msg)
std::vector< RORoute * > myAlternatives
The alternatives.
OutputDevice & openTag(const std::string &xmlElement)
Opens an XML tag.
A complete router's route.