Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function

4OR

Volumn 4, Issue 1, 2006, Pages 47-59

  Gandibleux, Xavier ^a,b   Beugnies, Frédéric ^b   Randriamasy, Sabine ^c  

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITÉ DE VALENCIENNES   (France)

^c NOKIA RESEARCH CENTER   (United States)

Author keywords

Labelling algorithm; Multi objective combinatorial optimization; Shortest path problem

Indexed keywords

EID: 33644936205     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-005-0074-x     Document Type: Article

References (16)

1. Brumhaugh-Smith J, Shier D (1989) An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research 43(2): 216-224
2. Chímaco JCM, Martins EQV (1982) A bicriterion shortest path algorithm. European Journal of Operational Research 11: 399-404
3. Ehrgott M (2000) Multicriteria optimization. Lecture Notes in Economics and Mathematical Systems. 491, Springer, Berlin Heidelberg New York
4. Ehrgott M, Gandibleux X (2002) Multiobjective combinatorial optimization. In: Ehrgott M, Gandibleux X (eds) Multiple criteria optimization: state of the art annotated bibliographic survey. Int. Series in Operations Research and Management Science Kluwer Academic Pub., 52:8 pp. 369-444
5. Hansen P (1979) Bicriterion path problems. In: Fandel G, Gal T (eds) Multiple criteria decision making theory and application. Lecture Notes in Economics and Mathematical Systems, 177. Springer, Berlin Heidelberg New York, pp. 109-127
6. Henig MI (1985) The shortest path problem with two objective functions. European Journal of Operational Research 25: 281-291
7. Kostreva MM, Wiecek MM (1993) Time dependency in multiple objective dynamic programming, Journal of Mathematical Analysis and Applications 173(1): 289-307
8. Martins EQV (1984a) On a multicriteria shortest path problem. European Journal of Operational Research 16: 236-245
9. Martins EQV (1984b) On a special class of bicriterion path problems. European Journal of Operational Research 17: 85-94
10. Moore LJ, Taylor BW, Lee SM (1978) Analysis of a transshipment problem with multiple conflicting objectives. Computers and Operations Research 5: 39-16
11. Mote J, Murthy I, Olson DL (1991) A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research 53: 81-92
12. Randriamasy S, Gandibleux X, Figueira J, Thomin Ph (2002) Brevet 03291744.5-2416 Dispositif et procédé de détermination de chemins de routage dans un réseau de communications, en présence d'attributs de sélection (A device and a method for determining routing paths in a communication network, in the presence of selection attributes.) déposé le 15 Juil. 2002, France
13. Randriamasy S, Gandibleux X (2003) Routage multiobjectif dans les réseaux IP (Multiobjective routing in IP networks). ROADEF'03, pp 26-28 février 2003. Avignon, France
14. Seraflni P (1986) Some considerations about computational complexity for multi objective combinatorial problems. In: Jahn J. Krabs, W (eds) Recent advances and historical development of vector optimization. Lecture Notes in Economics and Mathematical Systems, 294. Springer. Berlin Heidelberg New York, pp 222-232
15. Skriver AJV, Andersen KA (2000) A label correcting approach for solving bicriterion shortest path problems. Computers and Operations Research 27(6): 507-524
16. Sniedovich M (1988) A multi-objective routing problem revisited. Engineering Optimization 13:99-108