On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study

Choo, 1980, An interactive algorithm for multicriteria programming, Computers and Operations Research, 7, 81, 10.1016/0305-0548(80)90016-7 Coello Coello, 2002 Collette, 2000, A systematic comparison of performance of various multiple objective metaheuristics using a common set of analytical test functions, Foundations of Computing and Decision Sciences, 25, 249 Czyzak, 1996, A multiobjective metaheuristic approach to the localization of a chain of petrol stations by the capital budgeting model, Control and Cybernetics, 25, 177 Deb, 2001 Deb, 2001, Controlled Elitist non-dominated sorting genetic algorithms for better convergence, 1993, 67 M.P. Hansen, A. Jaszkiewicz, Evaluating the quality of approximations to the nondominated set, Working paper, Institute of Mathematical Modelling Technical University of Denmark, IMM-REP-1998-7, 1998 http://www.lania.mx/~ccoello/EMOO/EMOObib.html Hwang, 1980, Mathematical programming with multiple objectives: A tutorial, Computers & Operations Research, 7, 5, 10.1016/0305-0548(80)90011-8 Jaszkiewicz, 2001, Comparison of local search-based metaheuristics on the multiple objective knapsack problem, Foundations of Computing and Decision Sciences, 26, 99 A. Jaszkiewicz, A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm, Research report, Institute of Computing Science, Poznan University of Technology, 2001, RA003/01 Jaszkiewicz, 2002, Genetic local search for multiple objective combinatorial optimization, European Journal of Operational Research, 137/1, 50, 10.1016/S0377-2217(01)00104-7 Jaszkiewicz, 2002, On the computational effectiveness of multiple objective metaheuristics, 86 Jaszkiewicz, 2002, On the performance of multiple objective genetic local search on the 0/1 knapsack problem. A comparative experiment, IEEE Transactions on Evolutionary Computation, 6, 402, 10.1109/TEVC.2002.802873 Jaszkiewicz, 1992, Cone contraction method with visual interaction for multiple-objective non-linear programmes, Journal of Multi-Criteria Decision Analysis, 1, 29, 10.1002/mcda.4020010105 Jaszkiewicz, 1997, The LBS-Discrete interactive procedure for multiple-criteria analysis of decision problems, 320 Jaszkiewicz, 1999, The `light beam search' approach––an overview of methodology and applications, European Journal of Operational Research, 113, 300, 10.1016/S0377-2217(98)00218-5 J.D. Knowles, D.W. Corne, A comparison of diverse approaches to memetic multi-objective combinatorial optimization, in: Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, Las Vegas, Nevada, 2000, pp. 103–108 Korhonen, 1986, Solving generalized goal programming problems using a visual interactive approach, European Journal of Operational Research, 26, 355, 10.1016/0377-2217(86)90137-2 Lotfi, 1992, An aspiration-level interactive model for multiple criteria decision making, Computers and Operations Research, 19, 677, 10.1016/0305-0548(92)90036-5 Z. Michalewicz, J. Arabas, Genetic algorithms for the 0/1 knapsack problem, in: Z.W. Raś, M. Zemankova (Eds.), Methodologies for Intelligent Systems (ISMIS'94), Berlin, 1994, pp. 134–143 Osman, 1996, Metaheuristics: A bibliography, Annals of Operations Research, 65, 513 Pirlot, 1996, General local search methods, European Journal of Operational Research, 92, 493, 10.1016/0377-2217(96)00007-0 Shin, 1991, Interactive multiple objective optimization: Survey I––continuous case, Computers & Operations Research, 18, 97, 10.1016/0305-0548(91)90046-T Steuer, 1977, An interactive multiple objective linear programming procedure, TIMS Studies in the management Sciences, 6, 225 Steuer, 1986 Steuer, 1983, An interactive weighted Tchebycheff procedure for multiple objective programming, Mathematical Programming, 26, 326, 10.1007/BF02591870 Sun, 1996, InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem, European Journal of Operational Research, 89, 462, 10.1016/0377-2217(94)00228-2 Ulungu, 1998, Efficiency of interactive multi-objective simulated annealing through a case study, Journal of the Operational Research Society, 49, 1044, 10.1057/palgrave.jors.2600569 Viana, 2000, Using metaheuristics in multiobjective resource constrained project scheduling, European Journal of Operational Research, 120, 359, 10.1016/S0377-2217(99)00163-0 Wierzbicki, 1986, On the completeness and constructiveness of parametric characterization to vector optimization problems, OR Spektrum, 8, 73, 10.1007/BF01719738 White, 1990, A bibliography on the applications of mathematical programming multiple-objective methods, Journal of the Operational Research Society, 41, 669, 10.1057/jors.1990.97 Zionts, 1981, A multiple criteria method for choosing among discrete alternatives, European Journal of Operational Research, 7, 143, 10.1016/0377-2217(81)90275-7 Zitzler, 1999, Multiple objective evolutionary algorithms: A comparative case study and the strength Pareto approach, IEEE Transactions on Evolutionary Computation, 3, 257, 10.1109/4235.797969