42 #ifdef CHECK_MEMORY_LEAKS
44 #endif // CHECK_MEMORY_LEAKS
84 : myBeta(beta), myA(a) {}
102 for (std::vector<RORoute*>::iterator i = alternatives.begin(); i != alternatives.end() - 1; i++) {
104 for (std::vector<RORoute*>::iterator j = i + 1; j != alternatives.end(); j++) {
133 return (pdr * (pdr + pds) *
gawronG(
myA, x)) /
140 if (((1.0 - (x * x)) == 0)) {
143 return (
SUMOReal) exp((a * x) / (1.0 - (x * x)));
151 : myBeta(beta), myGamma(gamma), myTheta(theta) {}
169 for (std::vector<RORoute*>::const_iterator i = alternatives.begin(); i != alternatives.end(); i++) {
172 const std::vector<const ROEdge*> &edgesR = pR->
getEdgeVector();
173 for (std::vector<const ROEdge*>::const_iterator edge = edgesR.begin(); edge != edgesR.end(); ++edge) {
178 for (std::vector<RORoute*>::const_iterator j = alternatives.begin(); j != alternatives.end(); j++) {
182 const std::vector<const ROEdge*> &edgesS = pS->
getEdgeVector();
183 for (std::vector<const ROEdge*>::const_iterator edge = edgesS.begin(); edge != edgesS.end(); ++edge) {
185 if (std::find(edgesR.begin(), edgesR.end(), *edge) != edgesR.end()) {
189 overlapSum += pow(overlapLength / sqrt(lengthR * lengthS),
myGamma);
194 for (std::vector<RORoute*>::iterator i = alternatives.begin(); i != alternatives.end(); i++) {
197 for (std::vector<RORoute*>::iterator j = alternatives.begin(); j != alternatives.end(); j++) {
209 for (std::vector<RORoute*>::const_iterator i = alternatives.begin(); i != alternatives.end(); i++) {
210 const SUMOReal cost = (*i)->getCosts()/3600.;
225 for (std::vector<RORoute*>::const_iterator i = alternatives.begin(); i != alternatives.end(); i++) {
226 const SUMOReal cost = (*i)->getCosts()/3600.;
233 for (std::vector<RORoute*>::const_iterator i = alternatives.begin(); i != alternatives.end(); i++) {
234 diff += pow((*i)->getCosts()/3600. - meanCost, 2);
236 const SUMOReal cvCost = sqrt(diff /
SUMOReal(alternatives.size())) / meanCost;
239 return PI / (sqrt(6.) * cvCost * (min + 1.1))/3600.;