42 #ifdef CHECK_MEMORY_LEAKS
44 #endif // CHECK_MEMORY_LEAKS
89 : myBeta(beta), myA(a) {}
107 for (std::vector<RORoute*>::iterator i = alternatives.begin(); i != alternatives.end() - 1; i++) {
109 for (std::vector<RORoute*>::iterator j = i + 1; j != alternatives.end(); j++) {
138 return (pdr * (pdr + pds) *
gawronG(
myA, x)) /
145 if (((1.0 - (x * x)) == 0)) {
148 return (
SUMOReal) exp((a * x) / (1.0 - (x * x)));
156 : myBeta(beta), myGamma(gamma), myTheta(theta) {}
174 for (std::vector<RORoute*>::const_iterator i = alternatives.begin(); i != alternatives.end(); i++) {
177 const std::vector<const ROEdge*>& edgesR = pR->
getEdgeVector();
178 for (std::vector<const ROEdge*>::const_iterator edge = edgesR.begin(); edge != edgesR.end(); ++edge) {
183 for (std::vector<RORoute*>::const_iterator j = alternatives.begin(); j != alternatives.end(); j++) {
187 const std::vector<const ROEdge*>& edgesS = pS->
getEdgeVector();
188 for (std::vector<const ROEdge*>::const_iterator edge = edgesS.begin(); edge != edgesS.end(); ++edge) {
190 if (std::find(edgesR.begin(), edgesR.end(), *edge) != edgesR.end()) {
194 overlapSum += pow(overlapLength / sqrt(lengthR * lengthS),
myGamma);
199 for (std::vector<RORoute*>::iterator i = alternatives.begin(); i != alternatives.end(); i++) {
202 for (std::vector<RORoute*>::iterator j = alternatives.begin(); j != alternatives.end(); j++) {
214 for (std::vector<RORoute*>::const_iterator i = alternatives.begin(); i != alternatives.end(); i++) {
215 const SUMOReal cost = (*i)->getCosts() / 3600.;
230 for (std::vector<RORoute*>::const_iterator i = alternatives.begin(); i != alternatives.end(); i++) {
231 const SUMOReal cost = (*i)->getCosts() / 3600.;
238 for (std::vector<RORoute*>::const_iterator i = alternatives.begin(); i != alternatives.end(); i++) {
239 diff += pow((*i)->getCosts() / 3600. - meanCost, 2);
241 const SUMOReal cvCost = sqrt(diff /
SUMOReal(alternatives.size())) / meanCost;
244 return PI / (sqrt(6.) * cvCost * (min + 1.1)) / 3600.;