Multi-objective and multi-constrained non-additive shortest path problems

Computers and Operations Research

Volumn 38, Issue 3, 2011, Pages 605-616

  Reinhardt, Line Blander ^a   Pisinger, David ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Dynamic programming; Multi objective programming; Non additive objective; Shortest path problem

Indexed keywords

ADDITIVITY; MULTI OBJECTIVE; MULTI-OBJECTIVE PROBLEM; MULTIOBJECTIVE PROGRAMMING; MULTIPLE OBJECTIVES; NON-ADDITIVE; OPTIMIZATION PROBLEMS; PROGRAMMING FRAMEWORK; SHORTEST PATH PROBLEM; SUB-PROBLEMS;

GRAPH THEORY; MULTIOBJECTIVE OPTIMIZATION;

DYNAMIC PROGRAMMING;

EID: 77957313561     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.08.003     Document Type: Article

References (26)

1. R. Ahuja, T. Magnanti, and J. Orlin Network flows: theory, algorithms, and applications 1993 Prentice Hall
2. Blander-Reinhardt L. Multi-objective shortest path for cargo transportation. Master's thesis, University of Copenhagen, DIKU, Denmark; April 2005.
3. J. Brumbaugh-Smith, and D. Shier An empirical investigation of some bicriterion shortest path algorithms European Journal of Operational Research 43 1989 216 224
4. R. Carraway, T.L. Morin, and H. Moskowitz Generalized dynamic programming for multicriteria optimization European Journal of Operational Research 44 1990 95 104
5. T. Cormen, C. Leiserson, and R. Rivest Introduction to algorithms 1997 The MIT Press/McGraw-Hill Book Company
6. G. Desaulniers, J. Desrosiers, I. Ioachim, M. Solomon, F. Soumis, and D. Villeneuve Fleet management and logistics 1998 Kluwer Academic Publisher chapter: Unified Framework for Deterministic Time Constrained Vehice Routing and Crew Scheduling Problems
7. I. Dumitrescu, and N. Boland Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem Networks 42 2003 135 153
8. M. Ehrgott, and X. Gandibleux An annotated bibliography of multiobjective combinatorial optimization OR Spectrum 22 2000 425 460
9. Gueguen C, Dejax P, Dror M, Gendreau M. An exact algorithm for the elementary shortest path problem with resource constraints, Technical report, Laboratoire Productique Logistique, Ecole Centrale Paris, 1998. revised in July 1999, also with D. Feillet as co-author.
10. Hansen P. Bicriteria path problems. In: Fandel G, Gal T. Multi criteria decision making theory and applications, Lecture notes in economics and mathematical systems, vol. 177:109127;1979.
11. HUR. 〈 http://trafikinfo.hur.dk/priserogbilletter 〉.
12. K. Hutson, and D. Shier Extended dominance and a stochastic shortest path problem Computers & Operations Research 36 2009 584 596
13. I. Ioachim, S. Gelinas, J. Desrosiers, and F. Soumis A dynamic programming algorithm for the shortest path problem with time windows and linear node costs Networks 31 1998 193 204
14. S. Irnich, and G. Desaulniers Shortest path problems with resource constraints M.M.S.G. Desaulniers, J. Desrosiers, Column generation 2005 Springer USA 33 65
15. S. Irnich, and D. Villeneuve The shortest path problem with resource constraints and k-cycle elimination for k > 3 Informs Journal on Computing 18 2006 391 406
16. M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger Subset-row inequalities applied to the vehicle-routing problem with time windows Operations Research 56 2008 497 511
17. Lengauer T, Theune D. Efficient algorithms for path problems with gernal cost citeria. In: International colloquium on automata, languages and programming (ICALP), 1991. p. 31426.
18. E. Martins On a multicriteria shortest path problem European Journal of Operation Research 16 1984 236 237
19. Mller-Hannemann M, Schnee M. Finding all attractive train connections by multi-criteria pareto search. In: Proceedings of the 4th workshop on algorithmic methods and models for optimization of railways (ATMOS 2004), Bergen, Norway, Lecture notes in computer science, 2004.
20. M. Mller-Hannemann, and K. Weihe On the cardinality of the pareto set in bicriteria shortest path problems Annals of Operation Research 147 2004 185 197
21. W. Powell, and Z. Chen A generalized threshold algorithm for the shortest path problem with time windows P. Pardalos, D. Du, DIMACS series in discrete mathematics and theoretical computer science 1998 American Mathematical Society 303 318
22. S. Skriver, and K. Andersen A label correcting approach for solving bicriterion shortest-path problems Computers & Operations Research 27 2000 507 524
23. H. Taha Operations researchan introduction 8th ed. 2007 Pearson Prentice Hall
24. Tsaggouris G, Zaroliagis C. Non-additive shortest paths. In: AlgorithmsESA 2004. 12th annual european symposium. Lecture notes in computer science, vol. 3221; 2004. p. 82234.
25. Tsaggouris G, Zaroliagis C. Multiobjective optimization: improved fptas for shortest paths and non-linear objectives with applications. In: Algorithms and computation. 17th international symposium, ISAAC 2006, Lecture notes in computer science, vol. 4288; 2006. p. 38998.
26. D. Villeneuve, and G. Desaulniers The shortest path problem with forbidden paths European Journal of Operational Research 165 2005 97 107