A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks

Author： Modesti P.   Sciomachen A.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.111, Iss.3, 1998-12, pp. : 495-508

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks

By Davies C.   Lingras P.  

European Journal of Operational Research, Vol. 144, Iss. 1, 2003-01 ,pp. : 27-38

Elsevier

Access to resources Recommend Favorite

Scheduling multimodal transportation systems

By Castelli L.   Pesenti R.   Ukovich W.  

European Journal of Operational Research, Vol. 155, Iss. 3, 2004-06 ,pp. : 603-615

Elsevier

Access to resources Recommend Favorite

On finding dissimilar paths

By Akgun V.   Erkut E.   Batta R.  

European Journal of Operational Research, Vol. 121, Iss. 2, 2000-03 ,pp. : 232-246

Elsevier

Access to resources Recommend Favorite

Shortest paths in a network with time-dependent flow speeds

By Sung K.   Bell M.G.H.   Seong M.   Park S.  

European Journal of Operational Research, Vol. 121, Iss. 1, 2000-02 ,pp. : 32-39

Elsevier

Access to resources Recommend Favorite

The partial sum criterion for Steiner trees in graphs and shortest paths

By Duin C.W.   Volgenant A.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 172-182

Elsevier

Access to resources Recommend Favorite