The bicriterion multimodal assignment problem: Introduction, analysis, and experimental results

INFORMS Journal on Computing

Volumn 20, Issue 3, 2008, Pages 400-411

  Pedersen, Christian Roed ^a   Nielsen, Lars Relund ^a   Andersen, Kim Allan ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b AARHUS SCHOOL OF BUSINESS   (Denmark)

Author keywords

Bicriterion multimodal assignment problem; Ranking; Two phase method

Indexed keywords

EID: 60649116662     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1070.0253     Document Type: Article

References (19)

1. da Silva, C. G., J. Clímaco, J. Figueira. 2006. A scatter search method for bi-criteria {0,1}-knapsack problems. Eur. J. Oper. Res. 169 373-391.
2. Ehrgott, M. 2000. Multicriteria Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 491. Springer-Verlag, Berlin.
3. Gandibleux, X., H. Morita, N. Katoh. 2003. Use of genetic heritage for solving the assignment problem with two objectives. Lecture Notes in Computer Science, Vol. 2632. Springer, Berlin, 43-57.
4. Gandibleux, X., H. Morita, N. Katoh. 2005. A population-based metaheuristic for solving assignment problems with two objectives. J. Math. Model. Algorithms. Forthcoming.
5. Hansen, P. 1979. Bicriterion path problems. Multiple Criteria Decision Making, Theory and Application, Lecture Notes in Economics and Mathematical Systems, Vol. 177. Springer-Verlag, Berlin, 109-127.
6. Jonker, R., A. Volgenant. 1987. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38 325-340.
7. Murty, K. G. 1968. An algorithm for ranking all the assignments in order of increasing cost. Oper. Res. 16 682-687.
8. Nielsen, L. R., C. R. Pedersen. 2006. APGen-An assignment problem generator. Reference manual, University of Aarhus, Aarhus, Denmark, http://www.research.relund.dk.
9. Nielsen, L. R., K. A. Andersen, D. Pretolani. 2003. Bicriterion shortest hyperpaths in random time-dependent networks. IMA J. Management Math. 14 271-303.
10. Pedersen, C. R. 2006. Multicriteria discrete optimization-And related topics. Ph.D. thesis, Department of Operations Research, University of Aarhus, Aarhus, Denmark.
11. Pedersen, C. R., L. R. Nielsen, K. A. Andersen. 2005a. A note on ranking assignments using reoptimization. Working Paper 2005/2, Department of Operations Research, University of Aarhus, Aarhus, Denmark, http://www.imf.au.dk/publs?id= 585.
12. Pedersen, C. R., L. R. Nielsen, K. A. Andersen. 2005b. On the bicriterion mufti modal assignment problem. Working Paper 2005/3, Department of Operations Research, University of Aarhus, Aarhus, Denmark. http://www.imf.au.dk/publs?id= 586.
13. Pedersen, C. R., L. R. Nielsen, K. A. Andersen. 2007. An algorithm for ranking assignments using reoptimization. doi 10.1016/j.cor.2007.04.008. Comput. Oper. Res. Forthcoming.
14. Przybylski, A., X. Gandibleux, M. Ehrgott. 2006. The biobjective integer minimum cost flow problem-Incorrectness of Sedeño-Noda and González-Martín's algorithm. Comput. Oper. Res. 33 1459-1463.
15. Przybylski, A., X. Gandibleux, M. Ehrgott. 2008. Two phase algorithms for the biobjective assignment problem. Eur. J. Oper. Res. 185(2) 509-533.
16. Serafini, P. 1986. Some considerations about computational complexity for multi objective combinatorial problems. J. Jahn, W. Krabs, eds. Recent Advances and Historical Development of Vector Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 294. Springer, Berlin, 222-232.
17. Tuyttens, D., J. Teghem, P. Fortemps, K. Van Nieuwenhuyze. 2000. Performance of the MOSA method for the bicriteria assignment problem. J. Heuristics 6 295-310.
18. Ulungu, E. L., J. Teghem. 1995. The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations Comput. Decision Sci. 20 149-165.
19. Warburton, A. 1987. Approximation of Pareto optima in multiple- objective, shortest-path problems. Oper. Res. 35 70-79.