Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks

Publisher： Elsevier

ISSN： 0377-2217

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

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

Dynamic shortest path in stochastic dynamic networks: Ship routing problem

By Azaron A. Kianfar F.

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

Elsevier

Access to resources Recommend Favorite

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

By Modesti P. Sciomachen A.

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

Elsevier

Access to resources Recommend Favorite

Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function

By Murthy I. Sarkar S.

European Journal of Operational Research, Vol. 103, Iss. 1, 1997-11 ,pp. : 209-229

Elsevier

Access to resources Recommend Favorite

Digital data networks design using genetic algorithms

By Chu

European Journal of Operational Research, Vol. 127, Iss. 1, 2000-11 ,pp. : 140-158

Elsevier

Access to resources Recommend Favorite

The use of dynamic programming in genetic algorithms for permutation problems

By Yagiura M. Ibaraki T.

European Journal of Operational Research, Vol. 92, Iss. 2, 1996-07 ,pp. : 387-401

Elsevier

Access to resources Recommend Favorite