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

Applied Mathematics and Computation - Tập 219 - Trang 9652-9669 - 2013
George Mavrotas1, Kostas Florios1
1Laboratory of Industrial and Energy Economics, School of Chemical Engineering, National Technical University of Athens, Zographou Campus, Athens 15780, Greece

Tài liệu tham khảo

Steuer, 1986

Hwang, 1979, 164

Mavrotas, 2009, Effective implementation of the ε-constraint method in multi-objective mathematical programming problems, Appl. Math. Comput., 213, 455, 10.1016/j.amc.2009.03.037

Ehrgott, 2002, Constructing robust crew schedules with bicriteria optimization, J. Multi-Criteria Decis. Anal., 11, 139, 10.1002/mcda.321

Laumanns, 2006, An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method, Eur. J. Oper. Res., 169, 932, 10.1016/j.ejor.2004.08.029

Hamacher, 2007, Finding representative systems for discrete bicriterion optimization problems, Oper. Res. Lett., 35, 336, 10.1016/j.orl.2006.03.019

Coello Coello, 2002

Deb, 2001

Florios, 2010, Solving multi-objective, multi-constraint knapsack problems using mathematical programming and evolutionary algorithms, Eur. J. Oper. Res., 203, 14, 10.1016/j.ejor.2009.06.024

Chinchuluun, 2007, A survey of recent developments in multiobjective optimization, Ann. Oper. Res., 154, 29, 10.1007/s10479-007-0186-0

Bitran, 1977, Linear multiple objective programs with zero-one variables, Math. Program., 13, 121, 10.1007/BF01584332

Bitran, 1979, Theory and algorithms for linear multiple objective programs with zero-one variables, Math. Program., 17, 362, 10.1007/BF01588256

Klein, 1982, An algorithm for the multiple objective integer linear programming problem, Eur. J. Oper. Res., 9, 378, 10.1016/0377-2217(82)90182-5

Chalmet, 1986, An algorithm for the bi-criterion integer programming problem, Eur. J. Oper. Res., 25, 292, 10.1016/0377-2217(86)90093-7

Jahanshahloo, 2005, A method for generating all efficient solutions of 0–1 multi-objective linear programming problem, Appl. Math. Comput., 169, 874, 10.1016/j.amc.2004.09.091

Sourd, 2008, A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem, Inf. J. Comput., 20, 472, 10.1287/ijoc.1070.0260

Ralphs, 2006, An improved algorithm for solving biobjective integer programs, Ann. Oper. Res., 147, 43, 10.1007/s10479-006-0058-z

Ozlen, 2009, Multi-objective integer programming: a general approach for generating all non-dominated solutions, Eur. J. Oper. Res., 199, 25, 10.1016/j.ejor.2008.10.023

Przybylski, 2010, A two-phase method for multi-objective integer programming and its application to the assignment problem with three objectives, Discrete Optim., 7, 149, 10.1016/j.disopt.2010.03.005

Haimes, 1971, On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE Trans. Syst. Man Cybern., 1, 296, 10.1109/TSMC.1971.4308298

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.

Ehrgott, 2008, Improved ε-constraint method for multiobjective programming, J. Optim. Theory Appl., 138, 375, 10.1007/s10957-008-9394-2

Sylva, 2004, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, Eur. J. Oper. Res., 158, 46, 10.1016/S0377-2217(03)00255-8

Sylva, 2007, A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs, Eur. J. Oper. Res., 180, 1011, 10.1016/j.ejor.2006.02.049

B. Lokman, Approaches for multi-objective combinatorial optimization problems, MSc Thesis, Middle East Technical University, Ankara, 2007.

Koksalan, 2009, Approximating the nondominated frontiers of multi-objective combinatorial optimization problems, Nav. Res. Logist., 56, 191, 10.1002/nav.20336

Teghem, 1986, A survey of techniques for finding efficient solutions to multi-objective integer linear programming, Asia-Pac. J. Oper. Res., 3, 95

Ulungu, 1994, Multi-objective combinatorial optimization problems: a survey, J. Multi-Criteria Decis. Anal., 3, 83, 10.1002/mcda.4020030204

Rasmussen, 1986, Zero-one programming with multiple criteria, Eur. J. Oper. Res., 26, 83, 10.1016/0377-2217(86)90161-X

Ehrgott, 2000, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spectr., 22, 425, 10.1007/s002910000046

Alves, 2007, A review of interactive methods for multiobjective integer and mixed-integer programming, Eur. J. Oper. Res., 180, 99, 10.1016/j.ejor.2006.02.033

Jaszkiewicz, 2004, On the computational efficiency of multiple objective metaheuristics, The knapsack problem case study, Euro. J. Oper. Res., 158, 418, 10.1016/j.ejor.2003.06.015

Zitzler, 1999, Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach, IEEE Trans. Evol. Comput., 3, 257, 10.1109/4235.797969

Klamroth, 2000, Dynamic programming approaches to the multiple criteria knapsack problem, Nav. Res. Logist., 47, 57, 10.1002/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4

Erlebach, 2002, Approximating multiobjective knapsack problems, Manage. Sci., 48, 1603, 10.1287/mnsc.48.12.1603.445

Shah, 2011, Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems, Eur. J. Oper. Res., 211, 466, 10.1016/j.ejor.2011.01.030

Lust, 2012, The multiobjective multidimensional knapsack problem: a survey and a new approach, Int. Trans. Oper. Res., 19, 495, 10.1111/j.1475-3995.2011.00840.x

Jaszkiewicz, 2002, On the performance of multiple-objective genetic local search on the 0/1 knapsack problem – a comparative experiment, IEEE Trans. Evol. Comput., 6, 402, 10.1109/TEVC.2002.802873

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.

Nemhauser, 1999

Delorme, 2010, Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem, Eur. J. Oper. Res., 204, 206, 10.1016/j.ejor.2009.10.014

Tricoire, 2012, Multi-directional local search, Comput. Oper. Res., 39, 3089, 10.1016/j.cor.2012.03.010

Isermann, 1987, Computational experience concerning payoff tables and minimum criterion values over the efficient set, Eur. J. Oper. Res., 33, 91, 10.1016/0377-2217(88)90257-3

Dessouky, 1986, Estimates of the mínimum nondominated criterion values in multiple criteria decisión making, Eng. Costs Prod. Econ., 10, 95, 10.1016/0167-188X(86)90030-3

Metev, 2003, A method for nadir point estimation in MOLP problems, Cyberne. Inf. Technol., 3, 15

Alves, 2009, An exact method for computing the nadir values in multiple objective linear programming, Eur. J. Oper. Res., 198, 637, 10.1016/j.ejor.2008.10.003

Jorge, 2009, An algorithm for optimizing a linear function over an integer efficient set, Eur. J. Oper. Res., 195, 98, 10.1016/j.ejor.2008.02.005

Brooke, 1998

Zitzler, 2002, SPEA2: improving the strength pareto evolutionary algorithm for multiobjective optimization, 19

Papadimitriou, 1998

F. Degoutin, Problemes bi-objectifs en optimization combinatoire et capacite d’infrastructures ferroviaires, Master Thesis, Universite de Valenciennes et du Hainaut Cambresis, Valenciennes, France, 2002 (in French).

Delorme, 2003, Résolution approchée du problème de set packing bi-objectifs, 74

Mavrotas, 2005, Multi-criteria branch & bound: a vector maximization algorithm for mixed 0–1 multiple objective linear programming, Appl. Math. Comput., 171, 53, 10.1016/j.amc.2005.01.038

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.

Bleuler, 2003, PISA – a platform and programming language independent interface for search algorithms, 494

S. Bleuler, M. Laumanns, L. Thiele, E. Zitzler, The PISA Homepage, 2003. Available online at http://www.tik.ee.ethz.ch/pisa.

Mavrotas, 2008, Selection among ranked projects under segmentation, policy and logical constraints, Eur. J. Oper. Res., 187, 177, 10.1016/j.ejor.2007.03.010

Thông tin
Thông tin xuất bản

Applied Mathematics and Computation

Tập 219

9652-9669

Thông tin tác giả