52 const double adaptionFactor,
const int maxAlternatives,
const bool defaultCapacities,
76 void incremental(
const int numIter,
const bool verbose);
82 void sue(
const int maxOuterIteration,
const int maxInnerIteration,
const int kPaths,
const double penalty,
const double tolerance,
const std::string routeChoiceMethod);
130 void getKPaths(
const int kPaths,
const double penalty);
151 : myAssign(assign), myCell(c),
myBegin(begin), myLinkFlow(linkFlow), mySetBulkMode(setBulkMode) {}
157 const double myLinkFlow;
158 const bool mySetBulkMode;
161 RoutingTask&
operator=(
const RoutingTask&) =
delete;
std::vector< const ROEdge * > ConstROEdgeVector
Abstract superclass of a task to be run with an index to keep track of pending tasks.
A thread repeatingly calculating incoming tasks.
An O/D (origin/destination) matrix.
Static storage of an output device and its base (abstract) implementation.
A basic edge for routing applications.
const ConstROEdgeVector computePath(ODCell *cell, const SUMOTime time=0, const double probability=0., SUMOAbstractRouter< ROEdge, ROVehicle > *router=nullptr, bool setBulkMode=false)
const double myAdaptionFactor
void sue(const int maxOuterIteration, const int maxInnerIteration, const int kPaths, const double penalty, const double tolerance, const std::string routeChoiceMethod)
ROMAAssignments & operator=(const ROMAAssignments &src)=delete
Invalidated assignment operator.
void getKPaths(const int kPaths, const double penalty)
get the k shortest paths
static double getPenalizedEffort(const ROEdge *const e, const ROVehicle *const v, double t)
Returns the effort to pass an edge including penalties.
void incremental(const int numIter, const bool verbose)
double capacityConstraintFunction(const ROEdge *edge, const double flow) const
double getCapacity(const ROEdge *edge) const
const bool myAdditiveTraffic
const int myMaxAlternatives
void writeInterval(const SUMOTime begin, const SUMOTime end)
ROMAAssignments(const SUMOTime begin, const SUMOTime end, const bool additiveTraffic, const double adaptionFactor, const int maxAlternatives, const bool defaultCapacities, RONet &net, ODMatrix &matrix, SUMOAbstractRouter< ROEdge, ROVehicle > &router, OutputDevice *netloadOutput)
Constructor.
ROVehicle * myDefaultVehicle
OutputDevice *const myNetloadOutput
static double getPenalizedTT(const ROEdge *const e, const ROVehicle *const v, double t)
Returns the traveltime on an edge including penalties.
static double getTravelTime(const ROEdge *const e, const ROVehicle *const v, double t)
Returns the traveltime on an edge without penalties.
static std::map< const ROEdge *const, double > myPenalties
SUMOAbstractRouter< ROEdge, ROVehicle > & myRouter
ROVehicle * getDefaultVehicle() const
const bool myUseDefaultCapacities
bool addRoute(const ConstROEdgeVector &edges, std::vector< RORoute * > &paths, std::string routeId, double prob)
add a route and check for duplicates
~ROMAAssignments()
Destructor.
A basic edge for routing applications.
The router's network representation.
A vehicle as used by router.
A single O/D-matrix cell.