void
RORouteDef::repairCurrentRoute(SUMOAbstractRouter<ROEdge, ROVehicle>& router,
SUMOTime begin, const ROVehicle& veh) const {
const std::vector<const ROEdge*>& oldEdges = myAlternatives[0]->getEdgeVector();
if (oldEdges.size() == 0) {
MsgHandler* m = OptionsCont::getOptions().getBool("ignore-errors") ? MsgHandler::getWarningInstance() : MsgHandler::getErrorInstance();
m->inform("Could not repair empty route of vehicle '" + veh.getID() + "'.");
return;
}
std::vector<const ROEdge*> newEdges;
if (oldEdges.size() == 1) {
/// should happen with jtrrouter only
router.compute(oldEdges.front(), oldEdges.front(), &veh, begin, newEdges);
} else {
newEdges.push_back(*(oldEdges.begin()));
for (std::vector<const ROEdge*>::const_iterator i = oldEdges.begin() + 1; i != oldEdges.end(); ++i) {
if ((*(i - 1))->isConnectedTo(*i)) {
newEdges.push_back(*i);
} else {
std::vector<const ROEdge*> edges;
router.compute(*(i - 1), *i, &veh, begin, edges);
if (edges.size() == 0) {
return;
}
std::copy(edges.begin() + 1, edges.end(), back_inserter(newEdges));
}
}
}
if (myAlternatives[0]->getEdgeVector() != newEdges) {
WRITE_MESSAGE("Repaired route of vehicle '" + veh.getID() + "'.");
myNewRoute = true;
RGBColor* col = myAlternatives[0]->getColor() != 0 ? new RGBColor(*myAlternatives[0]->getColor()) : 0;
myPrecomputed = new RORoute(myID, 0, 1, newEdges, col);
} else {
myPrecomputed = myAlternatives[0];
}
}
void
RORouteDef::preComputeCurrentRoute(SUMOAbstractRouter<ROEdge, ROVehicle>& router,
SUMOTime begin, const ROVehicle& veh) const {
myNewRoute = false;
const OptionsCont& oc = OptionsCont::getOptions();
assert(myAlternatives[0]->getEdgeVector().size() > 0);
MsgHandler* mh = (OptionsCont::getOptions().getBool("ignore-errors") ?
MsgHandler::getWarningInstance() : MsgHandler::getErrorInstance());
if (myAlternatives[0]->getFirst()->prohibits(&veh) && (!oc.getBool("repair.from")
// do not try to reassign starting edge for trip input
|| myMayBeDisconnected || myAlternatives[0]->getEdgeVector().size() < 2)) {
mh->inform("Vehicle '" + veh.getID() + "' is not allowed to depart on edge '" +
myAlternatives[0]->getFirst()->getID() + "'.");
return;
} else if (myAlternatives[0]->getLast()->prohibits(&veh) && (!oc.getBool("repair.to")
// do not try to reassign destination edge for trip input
|| myMayBeDisconnected || myAlternatives[0]->getEdgeVector().size() < 2)) {
// this check is not strictly necessary unless myTryRepair is set.
// However, the error message is more helpful than "no connection found"
mh->inform("Vehicle '" + veh.getID() + "' is not allowed to arrive on edge '" +
myAlternatives[0]->getLast()->getID() + "'.");
return;
}
if (myTryRepair || myUsingJTRR) {
ConstROEdgeVector newEdges;
if (repairCurrentRoute(router, begin, veh, myAlternatives[0]->getEdgeVector(), newEdges)) {
if (myAlternatives[0]->getEdgeVector() != newEdges) {
if (!myMayBeDisconnected) {
WRITE_WARNING("Repaired route of vehicle '" + veh.getID() + "'.");
}
myNewRoute = true;
RGBColor* col = myAlternatives[0]->getColor() != 0 ? new RGBColor(*myAlternatives[0]->getColor()) : 0;
myPrecomputed = new RORoute(myID, 0, myAlternatives[0]->getProbability(), newEdges, col, myAlternatives[0]->getStops());
} else {
myPrecomputed = myAlternatives[0];
}
}
return;
}
if (RouteCostCalculator<RORoute, ROEdge, ROVehicle>::getCalculator().skipRouteCalculation()
|| OptionsCont::getOptions().getBool("remove-loops")) {
myPrecomputed = myAlternatives[myLastUsed];
} else {
// build a new route to test whether it is better
ConstROEdgeVector oldEdges;
oldEdges.push_back(myAlternatives[0]->getFirst());
oldEdges.push_back(myAlternatives[0]->getLast());
ConstROEdgeVector edges;
repairCurrentRoute(router, begin, veh, oldEdges, edges);
// check whether the same route was already used
int cheapest = -1;
for (int i = 0; i < (int)myAlternatives.size(); i++) {
if (edges == myAlternatives[i]->getEdgeVector()) {
cheapest = i;
break;
}
}
if (cheapest >= 0) {
myPrecomputed = myAlternatives[cheapest];
} else {
RGBColor* col = myAlternatives[0]->getColor() != 0 ? new RGBColor(*myAlternatives[0]->getColor()) : 0;
myPrecomputed = new RORoute(myID, 0, 1, edges, col, myAlternatives[0]->getStops());
myNewRoute = true;
}
}
}
bool
RORouteDef::repairCurrentRoute(SUMOAbstractRouter<ROEdge, ROVehicle>& router,
SUMOTime begin, const ROVehicle& veh,
ConstROEdgeVector oldEdges, ConstROEdgeVector& newEdges) const {
MsgHandler* mh = (OptionsCont::getOptions().getBool("ignore-errors") ?
MsgHandler::getWarningInstance() : MsgHandler::getErrorInstance());
const int initialSize = (int)oldEdges.size();
if (initialSize == 1) {
if (myUsingJTRR) {
/// only ROJTRRouter is supposed to handle this type of input
router.compute(oldEdges.front(), 0, &veh, begin, newEdges);
} else {
newEdges = oldEdges;
}
} else {
if (oldEdges.front()->prohibits(&veh)) {
// option repair.from is in effect
const std::string& frontID = oldEdges.front()->getID();
for (ConstROEdgeVector::iterator i = oldEdges.begin(); i != oldEdges.end();) {
if ((*i)->prohibits(&veh) || (*i)->isInternal()) {
i = oldEdges.erase(i);
} else {
WRITE_MESSAGE("Changing invalid starting edge '" + frontID
+ "' to '" + (*i)->getID() + "' for vehicle '" + veh.getID() + "'.");
break;
}
}
}
if (oldEdges.size() == 0) {
mh->inform("Could not find new starting edge for vehicle '" + veh.getID() + "'.");
return false;
}
if (oldEdges.back()->prohibits(&veh)) {
// option repair.to is in effect
const std::string& backID = oldEdges.back()->getID();
// oldEdges cannot get empty here, otherwise we would have left the stage when checking "from"
while (oldEdges.back()->prohibits(&veh) || oldEdges.back()->isInternal()) {
oldEdges.pop_back();
}
WRITE_MESSAGE("Changing invalid destination edge '" + backID
+ "' to edge '" + oldEdges.back()->getID() + "' for vehicle '" + veh.getID() + "'.");
}
ConstROEdgeVector mandatory = veh.getMandatoryEdges(oldEdges.front(), oldEdges.back());
assert(mandatory.size() >= 2);
// removed prohibited
for (ConstROEdgeVector::iterator i = oldEdges.begin(); i != oldEdges.end();) {
if ((*i)->prohibits(&veh) || (*i)->isInternal()) {
// no need to check the mandatories here, this was done before
i = oldEdges.erase(i);
} else {
++i;
}
}
// reconnect remaining edges
if (mandatory.size() > oldEdges.size() && initialSize > 2) {
WRITE_MESSAGE("There are stop edges which were not part of the original route for vehicle '" + veh.getID() + "'.");
}
const ConstROEdgeVector& targets = mandatory.size() > oldEdges.size() ? mandatory : oldEdges;
newEdges.push_back(*(targets.begin()));
ConstROEdgeVector::iterator nextMandatory = mandatory.begin() + 1;
int lastMandatory = 0;
for (ConstROEdgeVector::const_iterator i = targets.begin() + 1;
i != targets.end() && nextMandatory != mandatory.end(); ++i) {
if ((*(i - 1))->isConnectedTo(*i, &veh)) {
newEdges.push_back(*i);
} else {
if (initialSize > 2) {
// only inform if the input is (probably) not a trip
WRITE_MESSAGE("Edge '" + (*(i - 1))->getID() + "' not connected to edge '" + (*i)->getID() + "' for vehicle '" + veh.getID() + "'.");
}
const ROEdge* const last = newEdges.back();
newEdges.pop_back();
if (!router.compute(last, *i, &veh, begin, newEdges)) {
// backtrack: try to route from last mandatory edge to next mandatory edge
// XXX add option for backtracking in smaller increments
// (i.e. previous edge to edge after *i)
// we would then need to decide whether we have found a good
// tradeoff between faithfulness to the input data and detour-length
ConstROEdgeVector edges;
if (lastMandatory >= (int)newEdges.size() || last == newEdges[lastMandatory] || !router.compute(newEdges[lastMandatory], *nextMandatory, &veh, begin, edges)) {
mh->inform("Mandatory edge '" + (*i)->getID() + "' not reachable by vehicle '" + veh.getID() + "'.");
return false;
}
while (*i != *nextMandatory) {
++i;
}
newEdges.erase(newEdges.begin() + lastMandatory + 1, newEdges.end());
std::copy(edges.begin() + 1, edges.end(), back_inserter(newEdges));
}
}
if (*i == *nextMandatory) {
nextMandatory++;
lastMandatory = (int)newEdges.size() - 1;
}
}
}
return true;
}
