A genetic algorithms to solve the bicriteria shortest path problem

Electronic Notes in Discrete Mathematics

Volumn 36, Issue C, 2010, Pages 851-858

  Mohamed, Cheikh ^a   Bassem, Jarboui ^b   Taicir, Loukil ^c  

^a Higher Institute of Industrial Management of Sfax   (Tunisia)

^b UNIVERSITY OF SFAX   (Tunisia)

^c NONE

Author keywords

Bicriteria shortest path; Brumbaugh Smith algorithms; Exact algorithms; Multiobjective genetic algorithms

Indexed keywords

EID: 77955015230     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2010.05.108     Document Type: Article

References (6)

1. Hansen P. Bicriterion path problems. Multiple criteria decision making: theory and applications 1980, 109-127. Springer, Heidelberg.
2. Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1959, 1:269-271.
3. Skriver A.J.V., Andersen K.A. A label correcting approach for solving bicriterion shortest path problems. Computers & Operations Research 2000, (27):507-524.
4. Brumbaugh-Smith J., Shier D. An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research 1989, 43(2):216-224.
5. Climaco J.C.N., Martins E.Q.V. A bicriterion shortest path algorithm. European Journal of Operational Research 1982, (11):399-404.
6. Zitzler E., Thiele L., Laumanns M., Fonseca C.M., da Fonseca V.G. Performance Assessment of Multiobjective Optimizers. An Analysis and Review. IEEE Transactions on Evolutionary Computation 2003, 7(2):117-132.