Exact and heuristic algorithms for the interval data robust assignment problem

Computers and Operations Research

Volumn 38, Issue 8, 2011, Pages 1153-1163

  Pereira, Jordi ^a   Averbakh, Igor ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Assignment problem; Benders decomposition; Genetic algorithm; Hybrid heuristic; Interval data; Minmax regret optimization

Indexed keywords

ASSIGNMENT PROBLEMS; BENDERS DECOMPOSITION; HYBRID HEURISTICS; INTERVAL DATA; MINMAX REGRET OPTIMIZATION;

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; OPTIMIZATION;

HEURISTIC METHODS;

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

References (28)

1. H. Aissi, C. Bazgan, and D. Vanderpooten Complexity of the min-max and min-max regret assignment problems Operations Research Letters 33 2005 634 640 (Pubitemid 41231024)
2. H. Aissi, C. Bazgan, and D. Vanderpooten Min-max and min-max regret versions of combinatorial optimization problems: a survey European Journal of Operational Research 197 2 2009 427 438
3. H. Aissi, C. Bazgan, and D. Vanderpooten Complexity of the min-max (regret) versions of min-cut problems Discrete Optimization 5 1 2008 66 73
4. I. Averbakh On the complexity of a class of combinatorial optimization problems with uncertainty Mathematical Programming 90 2001 263 272
5. I. Averbakh, and V. Lebedev Interval data minmax regret network optimization problems Discrete Applied Mathematics 138 2004 289 301
6. J.E. Beasley Linear programming on Cray supercomputers Journal of the Operational Research Society 41 1990 133 139
7. J.E. Beasley OR-Library: distributing test problems by electronic mail Journal of the Operational Research Society 41 1990 1069 1072
8. J.E. Beasley, and P.C. Chu A genetic algorithm for the set covering problem European Journal of Operational Research 94 1996 392 404
9. J.F. Benders Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 1962 238 252
10. R.E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling Mixed-integer programming: a progress report M. Grootschel, The Sharpest Cut 2004 SIAM 309 328
11. R. Burkard, M. Dell'Amico, and S. Martello Assignment Problems 2009 SIAM
12. G. Carpanetto, S. Martello, and P. Toth Algorithms and codes for the assignment problem Annals of Operations Research 13 1988 191 223
13. A.M. Geoffrion Generalized benders decomposition Journal of Optimization Theory and Applications 10 1972 237 260
14. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers
15. F. Glover, and C. Rego Ejection chain and filter-and-fan methods in combinatorial optimization 4OR: A Quarterly Journal of Operations Research 4 2006 263 296
16. D.E. Goldberg Genetic Algorithms in Search, Optimization, and Machine Learning 1989 Addison-Wesley Professional
17. R. Jonker, and A.T. Volgenant A shortest augmenting path algorithm for dense and sparse linear assignment problems Computing 38 1987 325 340
18. A. Kasperski Discrete Optimization with Interval Data: Minmax Regret and Fuzzy Approach (Studies in Fuzziness and Soft Computing) 2008 Springer
19. A. Kasperski, P. Zielinski, Minimizing maximal regret in linear assignment problems with interval data, Instytut Matematyki PWr., Wroclaw, 2004, Raport serii PREPRINTY nr. 007.
20. P. Kouvelis, and G. Yu Robust Discrete Optimization and its Applications 2003 Kluwer
21. M. Laguna, and R. Mari Scatter Search: Methodology and Implementations in C. (Operations Research/Computer Science Interfaces Series) 2003 Springer
22. R. Montemanni A Benders decomposition approach for the robust spanning tree problem with interval data European Journal of Operational Research 174 3 2006 1479 1490
23. R. Montemanni, J. Barta, M. Mastrolilli, and L.M. Gambardella The robust traveling salesman problem with interval data Transportation Science 41 2007 366 381
24. R. Montemanni, and L.M. Gambardella The robust shortest path problem with interval data via Benders decomposition 4OR: A Quarterly Journal of Operations Research 3 2005 315 328
25. J. Pereira, I. Averbakh, The robust set covering problem with interval data, Working Paper, University of Toronto, 2009.
26. C. Rego, and F. Glover Local search and metaheuristics for the traveling salesman problem G. Gutin, A. Punnen, The Traveling Salesman Problem and its Variations, Combinatorial Optimization Series vol. 12 2002 Kluwer Academic Publishers 309 368
27. A. Schrijver On the history of combinatorial optimization (till 1960) K. Aardal, G.L. Nemhauser, R. Weismantel, Handbook of Discrete Optimization 2005 Elsevier Amsterdam 1 68
28. Y. Shi Swarm Intelligence 2001 Morgan Kaufmann