An improved version of the augmented s-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems

Applied Mathematics and Computation

Volumn 219, Issue 18, 2013, Pages 9652-9669

  Mavrotas, George ^a   Florios, Kostas ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Exact pareto set; Multi objective programming; Constraint method

Indexed keywords

COMBINATORIAL OPTIMIZATION; DECISION MAKING; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; PARETO PRINCIPLE;

COMPUTATIONAL SPEED; CONSTRAINT METHODS; INTEGER PROGRAMMING PROBLEMS; MULTI-OBJECTIVE MATHEMATICAL PROGRAMMING; MULTI-OBJECTIVE META-HEURISTICS; MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION; MULTIOBJECTIVE PROGRAMMING; PARETO SET;

INTEGER PROGRAMMING;

EID: 84893644172     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2013.03.002     Document Type: Article

References (57)

1. RE. Steuer, Steuer, Multiple Criteria Optimization. Theory, Computation and Application, Krieger, Malabar FL, 1986.
2. CL Hwang, A. Masud, Multiple Objective Decision Making. Methods and Applications: A state of the art survey, Lecture Notes in Economics and Mathematical Systems, 164, Springer-Verlag, Berlin, 1979.
3. G. Mavrotas, Effective implementation of the ε-constraint method in multi-objective mathematical programming problems, Appl. Math. Comput. 213 (2009) 455-465.
4. M. Ehrgott, D.M. Ryan, Constructing robust crew schedules with bicriteria optimization, J. Multi-Criteria Decis. Anal. 11 (2002) 139-150. (Pubitemid 36854021)
5. M. Laumanns, L Thiele, E. Zitzler, An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method, Eur. J. Oper. Res. 169 (2006) 932-942. (Pubitemid 41492025)
6. H.W. Hamacher, CR Pedersen, S. Ruzika, Finding representative systems for discrete bicriterion optimization problems, Oper. Res. Lett. 35 (2007) 336-344. (Pubitemid 46589655)
7. CA. Coello Coello, D.A. Van Veldhuizen, G.A. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic Publishers, Boston, MA, 2002.
8. K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley and Sons, Chichester, 2001.
9. K. Florios, G. Mavrotas, D. Diakoulaki, Solving multi-objective, multi-constraint knapsack problems using mathematical programming and evolutionary algorithms, Eur. J. Oper. Res. 203 (2010) 14-21.
10. A. Chinchuluun, P.M. Pardalos, A survey of recent developments in multiobjective optimization, Ann. Oper. Res. 154 (2007) 29-50.
11. G.R. Bitran, Linear multiple objective programs with zero-one variables, Math. Program. 13 (1977) 121-139.
12. G.R. Bitran, Theory and algorithms for linear multiple objective programs with zero-one variables, Math. Program. 17 (1979) 362-390.
13. D. Klein, E. Hannan, An algorithm for the multiple objective integer linear programming problem, Eur. J. Oper. Res. 9 (1982) 378-385. (Pubitemid 12512194)
14. L.G. Chalmet, L. Lemonidis, D.J. Elzinga, An algorithm for the bi-criterion integer programming problem, Eur. J. Oper. Res. 25 (1986) 292-300. (Pubitemid 16522883)
15. G.R. Jahanshahloo, F. Hosseinzadeh, N. Shoja, G. Tohidi, A method for generating all efficient solutions of 0-1 multi-objective linear programming problem, Appl. Math. Comput. 169 (2005) 874-886. (Pubitemid 41394326)
16. F. Sourd, O. Spanjaard, A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem, Inf. J. Comput. 20 (3) (2008) 472-484.
17. T.K. Ralphs, M.J. Saltzman, M.M. Wiecek, An improved algorithm for solving biobjective integer programs, Ann. Oper. Res. 147 (2006) 43-70. (Pubitemid 44496800)
18. M. Ozlen, M. Azizoglu, Multi-objective integer programming: a general approach for generating all non-dominated solutions, Eur. J. Oper. Res. 199 (2009) 25-35.
19. A. Przybylski, X. Gandibleux, M. Ehrgott, A two-phase method for multi-objective integer programming and its application to the assignment problem with three objectives, Discrete Optim. 7 (2010) 149-165.
20. Y.Y. Haimes, LS. Lasdon, D.A. Wismer, On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE Trans. Syst. Man Cybern. 1 (1971) 296-297.
21. D. Rayside, H.C. Estler, D. Jackson, The guided improvement algorithm for exact, general-purpose, many-objective combinatorial optimization, Massachusetts Institute of Technology Technical Report, Computer Science and Artificial Intelligence Laboratory, 2009.
22. M. Ehrgott, S. Ruzika, Improved ε-constraint method for multiobjective programming, J. Optim. Theory Appl. 138 (2008) 375-396.
23. J. Sylva, A. Crema, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, Eur. J. Oper. Res. 158 (2004) 46-55.
24. J. Sylva, A. Crema, A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs, Eur. J. Oper. Res. 180 (2007) 1011-1027. (Pubitemid 46275294)
25. B. Lokman, Approaches for multi-objective combinatorial optimization problems, MSc Thesis, Middle East Technical University, Ankara, 2007.
26. M. Koksalan, B. Lokman, Approximating the nondominated frontiers of multi-objective combinatorial optimization problems, Nav. Res. Logist. 56 (2009)191-198.
27. J. Teghem, P.L Kunsch, A survey of techniques for finding efficient solutions to multi-objective integer linear programming, Asia-Pac. J. Oper. Res. 3 (1986) 95-108.
28. E.L Ulungu, J. Teghem, Multi-objective combinatorial optimization problems: a survey, J. Multi-Criteria Decis. Anal. 3 (1994) 83-104.
29. L.M. Rasmussen, Zero-one programming with multiple criteria, Eur. J. Oper. Res. 26 (1986) 83-95.
30. M. Ehrgott, X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spectr. 22 (2000) 425-460.
31. M.J. Alves, J. Climaco, A review of interactive methods for multiobjective integer and mixed-integer programming, Eur. J. Oper. Res. 180 (2007) 99-115. (Pubitemid 46123843)
32. A. Jaszkiewicz, On the computational efficiency of multiple objective metaheuristics, The knapsack problem case study, Euro. J. Oper. Res. 158 (2004) 418-433.
33. E. Zitzler, L Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach, IEEE Trans. Evol. Comput. 3 (1999) 257-271. (Pubitemid 30544879)
34. K. Klamroth, M.M. Wiecek, Dynamic programming approaches to the multiple criteria knapsack problem, Nav. Res. Logist. 47 (2000) 57-76. (Pubitemid 30542457)
35. T. Erlebach, H. Kellerer, U. Pferschy, Approximating multiobjective knapsack problems, Manage. Sci. 48 (2002) 1603-1612.
36. R. Shah, P. Reed, Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems, Eur. J. Oper. Res. 211 (2011) 466-479.
37. T. Lust, J. Teghem, The multiobjective multidimensional knapsack problem: a survey and a new approach, Int. Trans. Oper. Res. 19 (2012) 495-520.
38. A. Jaszkiewicz, On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment, IEEE Trans. Evol. Comput. 6 (2002) 402-412. (Pubitemid 35032741)
39. M. Laumanns, L Thiele, E. Zitzler, An adaptive scheme to generate the Pareto front based on the epsilon-constraint method, in: J. Branke, K. Deb, K. Miettinen, R. Steuer (Eds.), Practical Approaches to Multi-Objective Optimization, Dagstuhl Seminar Proceedings, Vol. 04461, 2005. URN: urn: nbn: de:0030-drops-2465, URL: http://drops.dagstuhl.de/opus/volltexte/2005/246.
40. G.L Nemhauser, LA. Wolsey, Integer and Combinatorial Optimization, Wiley, 1999.
41. X. Delorme, X. Gandibleux, F. Degoutin, Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem, Eur. J. Oper. Res. 204 (2010)206-217.
42. F. Tricoire, Multi-directional local search, Comput. Oper. Res. 39 (2012) 3089-3101.
43. H. Isermann, R.E. Steuer, Computational experience concerning payoff tables and minimum criterion values over the efficient set, Eur. J. Oper. Res. 33 (1987)91-97. (Pubitemid 18546738)
44. M.I. Dessouky, M. Ghiassi, W.J. Davis, Estimates of the minimum nondominated criterion values in multiple criteria decision making, Eng. Costs Prod. Econ. 10 (1986) 95-104. (Pubitemid 16608559)
45. B. Metev, V. Vassilev, A method for nadir point estimation in MOLP problems, Cyberne. Inf. Technol. 3 (2003) 15-24.
46. M.J. Alves, J.P. Costa, An exact method for computing the nadir values in multiple objective linear programming, Eur. J. Oper. Res. 198 (2009) 637-646.
47. J.M. Jorge, An algorithm for optimizing a linear function over an integer efficient set, Eur. J. Oper. Res. 195 (2009) 98-103.
48. A. Brooke, D. Kendrick, A. Meeraus, R Raman, A User's Guide GAMS, GAMS development corporation, Washington, 1998.
49. E. Zitzler, M. Laumanns, L Thiele, SPEA2: improving the strength pareto evolutionary algorithm for multiobjective optimization, in: K. Giannakoglou, D. Tsahalis, J. Periaux, K. Papailiou, T. Fogarty (Eds.), Evolutionary Methods for Design, Optimization, and Control, Barcelona, CIMNE, Spain, 2002, pp. 19-26.
50. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover, New York, 1998.
51. F. Degoutin, Problèmes bi-objectifs en optimization combinatoire et capacité d'infrastructures ferroviaires, Master Thesis, Universite de Valenciennes et du Hainaut Cambresis, Valenciennes, France, 2002 (in French).
52. X. Delorme, X. Gandibleux, F. Degoutin, Résolution approchée du problème de set packing bi-objectifs, in: Proceedings de l'École d'Automne de Recherche Opérationnelle de Tours (EARO), 2003, pp. 74-80 (in French).
53. G. Mavrotas, D. Diakoulaki, Multi-criteria branch & bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming, Appl. Math. Comput. 171 (2005) 53-71. (Pubitemid 41737288)
54. J.J. Dongarra, Performance of Various Computers Using Standard Linear Equations Software, Linpack Benchmark Report, University of Tennessee Computer Science Technical, Report, CS-89-85, 2008.
55. S. Bleuler, M. Laumanns, L Thiele, E. Zitzler, PISA - a platform and programming language independent interface for search algorithms, in: C. Fonseca, P. Fleming, E. Zitzler, K. Deb, L Thiele (Eds.), Evolutionary Multi-Criterion Optimization, Springer, Heidelberg, 2003, pp. 494-508.
56. S. Bleuler, M. Laumanns, L Thiele, E. Zitzler, The PISA Homepage, 2003. Available online at http://www.tik.ee.ethz.ch/pisa.
57. G. Mavrotas, D. Diakoulaki, A. Kourentzis, Selection among ranked projects under segmentation, policy and logical constraints, Eur. J. Oper. Res. 187 (2008)177-192. (Pubitemid 350061096)