Stochastic local search algorithms for multiobjective combinatorial optimization: A review

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 29-1-29-16

  Paquete, Luís ^a   Stützle, Thomas ^b  

^a UNIVERSITY OF ALGARVE   (Portugal)

^b FREE UNIVERSITY OF BRUSSELS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85044036046     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (70)

1. Coello, C. C., Aguirre, A. H., and Zitzler, E., Eds., Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science, Vol. 3410, Springer, Berlin, 2005.
2. Fonseca, C. M., Fleming, P., Zitzler, E., Deb, K., and Thiele, L., Eds., Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science, Vol. 2632, Springer, Berlin, 2003.
3. Gandibleux, X., Sevaux, M., Sörensen, K., and T’kindt, V., Eds., Metaheuristics for Multiobjective Optimisation, Lecture Notes in Economics and Mathematical Systems, Vol. 535, Springer, Berlin, 2004.
4. Zitzler, E., Deb, K., Thiele, L., Coello, C. C., and Corne, D., Eds., Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science, Vol. 1993, Springer, Berlin, 2001.
5. Coello, C. C., Special issue on “evolutionarymultiobjective optimization,” IEEE Trans. Evol. Comput., 7(2), 2003.
6. Gandibleux, X., Jaszkiewicz, A., Fréville, A., and Slowinski, R., Special issue on “multiple objective metaheuristics,” J. Heuristics, 6(3), 2000.
7. Jaszkiewicz, A., Special issue on “evolutionary and local search heuristics in multiple objective optimization,” Found. Comput. Decision Sci. J., 26(1), 2001.
8. Coello, C. C., Acomprehensive survey of evolutionary-basedmultiobjective optimization techniques, Knowl. Inf. Syst., 1, 269, 1999.
9. Coello, C. C., An updated survey of GA-based multiobjective optimization techniques, ACM Comput. Surv., 32, 109, 2000.
10. Ehrgott, M. and Gandibleux, X., Approximative solution methods for combinatorial multicriteria optimization, TOP, 12(1), 1, 2004.
11. Fonseca, C. M. and Fleming, P., An overview of evolutionary algorithms inmultiobjective algorithms, Evol. Comput., 3, 1, 1995.
12. Knowles, J. and Corne, D., Memetic algorithms for multiobjective optimization: issues, methods and prospects, in Recent Advances in Memetic Algorithms, Vol. 166, Krasnogor, N., Smith, J., and Hart, W., Eds., Studies in Fuzziness and Soft Computing, Springer, Heidelberg, 2004, p. 313.
13. Jones, D., Mirrazavi, S., and Tamiz, M., Multi-objective meta-heuristics: an overview of the current state-of-the-art, Eur. J. Oper. Res., 137(1), 1–9, 2002.
14. Steuer, R. E., Multiple Criteria Optimization: Theory, Computation and Application, Wiley, New York, 1986.
15. Paquete, L., Schiavinotto, T., and Stützle, T., On Local Optima in Multiobjective Combinatorial Optimization Problems, TR AIDA-04-11, FG Intellektik, TU Darmstadt, 2004.
16. Paquete, L., Chiarandini, M., and Stützle, T., A Study of Local Optima in theMultiobjective Traveling Salesman Problem, TR AIDA-02-07, Fachgebiet Intellektik, Fachbereich Informatik, Technische Universität Darmstadt, 2002.
17. Paquete, L., Chiarandini, M., and Stützle, T., Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study, in Metaheuristics forMultiobjective Optimisation, Lecture Notes in Economics and Mathematical Systems, Vol. 535, Gandibleux, X., Sevaux, M., Sörensen, K., and T’kindt, V., Eds., Springer, Berlin, 2004, p. 177.
18. Paquete, L. and Stützle, T., A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices, Eur. J. Oper. Res., 169(3), 943, 2006.
19. Angel, E., Bampis, E., and Gourvés, L., A dynasearch neighborhood for the bicriteria traveling salesman problem, in Metaheuristics for Multiobjective Optimisation, Lecture Notes in Economics and Mathematic Systems, Vol. 535, Gandibleux, X., Sevaux, M., Sörensen, K., and T’kindt, V., Eds., Springer, Berlin, 2004, p. 153.
20. Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., and Deb, K., Running time analysis ofmulti-objective evolutionary algorithms on a simple discrete optimization problem, Proc. of PPSN-VII, Lecture Notes in Computer Science, Vol. 2439, Springer, Berlin, 2002, p. 44.
21. Knowles, J. and Corne, D., The Pareto archived evolution strategy: a new base line algorithm for multiobjective optimisation, Proc. Congress on Evolutionary Computation, IEEE Press, Piscataway, NJ, 1999, p. 98.
22. Knowles, J. and Corne, D., M-PAES: a memetic algorithm for multiobjective optimization, Proc. Congress on Evolutionary Computation, Vol. 1, IEEE Press, Piscataway, NJ, 2000, p. 325.
23. Baykasoglu, A., Owen, S., and Gindy, N., A taboo search based approach to find the Pareto optimal set in multiobjective optimization, J. Eng. Opt., 31, 731, 1999.
24. Baykasoglu, A., Özbakir, L., and Sönmez, A., Using multiple objective tabu search and grammars to model and solvemulti-objective flexible job shop scheduling problems, J. Intell.Manuf., 15, 777, 2004.
25. Armetano, V. A. and Arroyo, J. E., An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem, J. Heuristics, 10(5), 463, 2004.
26. Fonseca, C. M. and Fleming, P., Genetic algorithms for multiobjective optimization: formulation, discussion and generalization, Proc. Int. Conf. on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, 1993, p. 416.
27. Srinivas, N. and Deb, K., Multiobjective optimization using nondominated sorting in genetic algorithms, Evol. Comput., 3(2), 221, 1994.
28. Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
29. Deb, K., Agrawal, S., Prataand, A., and Meyarivan, T., A fast and elitist multi-objective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput., 6(2), 182, 2002.
30. Zitzler, E., Laumanns, M., and Thiele, L., SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization, TR TIK-Report 103, Computer Engineering and Networks Laboratory, Swiss Federal Institute of Technology, Zürich, May 2001.
31. Zitzler, E. and Thiele, L., Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE Trans. Evol. Comput., 4(3), 257, 1999.
32. Talbi, E. G., A hybrid evolutionary approach for multicriteria optimization problems: application to the flow shop, in Evolutionary Multi-Criterion Optimization, Vol. 2632, Fonseca, C. M., Fleming, P., Zitzler, E., Deb, K., and Thiele, L., Eds., Lecture Notes in Computer Science, Springer, Berlin, 2003, p. 416.
33. Brizuela, C. A., Sannomiya, N., and Zhao, Y., Multi-objective flow-shop: preliminary results, in Evolutionary Multi-Criterion Optimization, Vol. 1993, Zitzler, E., Deb, K., Thiele, L., Coello, C. C., and Corne, D., Eds., Lecture Notes in Computer Science, Springer, Berlin, 2001, p. 443.
34. Basseur, M., Seynhaeve, F., and Talbi, E. G., Design of multi-objective evolutionary algorithms: application to the flow-shop, Proc. Congress on Evolutionary Computation, Vol. 2, IEEE Press, Piscataway, NJ, 2002, p. 151.
35. Jozefowiez, N., Semet, F., and Talbi, E.-G., Parallel and hybrid models for multi-objective optimization: application to the vehicle routing problem, Proc. Int. Conf. on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 2439, Springer, Berlin, 2002, p. 271.
36. Morita, H., Gandibleux, X., and Katoh, N., Experimental feedback on biobjective permutation scheduling problems solved with a population heuristic, Found. Comput. Decision Sci., 26(1), 23, 2001.
37. Borges, P. C. and Hansen, M. P., A study of global convexity for a multiple objective travelling salesman problem, in Essays and Surveys in Metaheuristics, Ribeiro, C. C. and Hansen, P., Eds., Kluwer Academic Publishers, Boston, MA, USA, 2000, p. 129.
38. Knowles, J. and Corne, D., Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem, Soft Computing Systems Design, Management and Applications, IOS Press, Amsterdam, 2002, p. 271.
39. Borges, P., CHESS—changing horizon efficient set search: a simple principle for multiobjective optimization, J. Heuristics, 6(3), 405, 2000.
40. Paquete L. and Stützle, T., A two-phase local search for the biobjective traveling salesman problem, in Evolutionary Multi-Criterion Optimization, Vol. 2632, Fonseca, C. M., Fleming, P., Zitzler, E., Deb, K., and Thiele, L., Eds., Lecture Notes in Computer Science, Springer, Berlin, 2003, p. 479.
41. Paquete, L., Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: Methods and Analysis, Ph.D. thesis, FB Informatik, TU Darmstadt, Germany, 2005.
42. Serafini, P., Simulated annealing for multiobjective optimization problems, in Multiple Criteria Decision Making. Expand and Enrich the Domains of Thinking and Application, Tzeng, G. H., Wang, H. F., Wen, V. P., and Yu, P. L., Eds., Lecture Notes in Economics and Mathematic Systems, Springer, New York, 1994, p. 283.
43. Ulungu, E. L., Optimisation combinatoire multicritére: Détermination de l’ensemble des solutions efficaces et méthodes interactives, Ph.D. thesis, Université de Mons-Hainaut, Mons, Belgium, 1993.
44. Hansen, M. P., Tabu search for multiobjective optimisation: MOTS, Proc. Int. Conf. on Multiple Criteria Decision Making, 1997.
45. Ishibuchi, H. and Murata, T., A multi-objective genetic local search algorithm and its application to flow-shop scheduling, IEEE Trans. Syst., Man., Cybern.—Part C, 28(3), 392, 1998.
46. Ishibuchi, H., Yoshida, T., and Murata, T., Balance between genetic search and local search in memetic algorithms formultiobjective permutation flowshop scheduling, IEEE Trans. Evol.Comput., 7(2), 204, 2003.
47. Jaszkiewicz, A., Genetic Local Search for Multiple Objective Combinatorial Optimization, TR RA-014/98, Institute of Computer Science, PoznańUniversity of Technology, Poznań, Poland, 1998.
48. Hamacher, H. V. and Ruhe, G., On spanning tree problems with multiple objectives, Ann. Oper. Res., 52, 209, 1994.
49. Andersen, K., Jörnsten, K., and Lind, M., On bicriterion minimal spanning trees: an approximation, Comput. Oper. Res., 23(12), 1171, 1996.
50. Gandibleux, X., Morita, H., and Katoh, N., Use of a genetic heritage for solving the assignment problem, in Evolutionary Multi-Criterion Optimization, Vol. 2632, Fonseca, C. M., Fleming, P., Zitzler, E., Deb, K., and Thiele, L., Eds., Lecture Notes in Computer Science, Springer, Berlin, 2003, p. 43.
51. Gandibleux, X., Mezdaoui, N., and Fréville, A., A tabu search procedure to solve multiobjective combinatorial optimization problems, in Advances in Multiple Objective and Goal Programming, Vol. 455, Caballero, R., Ruiz, F., and Steuer, R., Eds., Lecture Notes in Economics and Mathematic Systems, Springer, Berlin, 1997, p. 291.
52. Abdelaziz, F. B. and Krichen, S., A Tabu Search Heuristic forMultiobjective Knapsack Problems, TR RRR 28-97, Rutgers Center for Operation Research, Piscataway, New Jersey, 1997.
53. Abdelaziz, F. B., Chaouachi, J., and Krichen, S., A hybrid heuristic for multiobjective knapsack problems, in Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Voss, S., Martello, S., Osman, I., and Roucairol, C., Eds., Kluwer Academic Publishers, Boston, MA, 1999, p. 205.
54. Czyzak, P. and Jaszkiewicz, A., Pareto simulated annealing—a metaheuristic technique for multiple objective combinatorial optimization, J. Multi-Criteria Decision Anal., 7, 34, 1998.
55. López-Ibáñez, M., Paquete, L., and Stützle, T., Hybrid population-based algorithms for the biobjective quadratic assignment problem, J. Math. Model. Algorithms, 5(1), 111–137, 2006.
56. Dorigo, M. and Stützle, T., Ant Colony Optimization, MIT Press, Cambridge, MA, 2004.
57. Iredi, S., Merkle, D., and Middendorf, M., Bi-criterion optimization with multi colony ant algorithms, in Evolutionary Multi-Criterion Optimization, Vol. 1993, Zitzler, E., Deb, K., Thiele, L., Coello, C. C., and Corne, D., Eds., Lecture Notes in Computer Science, Springer, Berlin, 2001.
58. López-Ibáñez, M., Paquete, L., and Stützle, T., On the design of ACO for the biobjective quadratic assignment problem, Proc. of ANTS, Lecture Notes in Computer Science, Vol. 3172, Springer, Berlin, 2004, p. 214.
59. Doerner, K., Gutjahr, W. J., Strauss, C., and Stummer, C., Pareto ant colony optimization: a metaheuristic approach to portfolio selection, Ann. Oper. Res., 131, 79, 2004.
60. Knowles, J., Corne, D., and Fleischer, M., Bounded archiving using the lebesgue measure, Proc. Congress on Evolutionary Computation, IEEE Press, Piscataway, NJ, 2003, p. 2498.
61. Zitzler, E. and Künzli, S., Indicator-based selection in multiobjective search, Proc. Int. Conf. on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 3242, Springer, Berlin, 2004, p. 832.
62. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., and Grunert da Fonseca, V., Performance assessment of multiobjective optimizers: an analysis and review, IEEE Trans. Evol. Comput., 7(2), 117, 2003.
63. Grunert da Fonseca, V., Fonseca, C. M., and Hall, A., Inferential performance assessment of stochastic optimizers and the attainment function, in Evolutionary Multi-Criterion Optimization, Vol. 1993, Zitzler, E., Deb, K., Thiele, L., Coello, C. C., and Corne, D., Eds., Lecture Notes in Computer Science, Springer, Berlin, 2001, p. 213.
64. Grunert da Fonseca, V. and Fonseca, C. M., A link between the multivariate cumulative distribution function and the hitting function for random closed sets, Stat. Prob. Lett., 57(2), 179, 2002.
65. Shaw, K. J., Fonseca, C. M., Nortcliffe, A. L., Thompson, M., Love, J., and Fleming, P. J., Assessing the performance ofmultiobjective genetic algorithms for optimization of a batch procesós scheduling problem, Proc. 1999 Congress on Evolutionary Computation, Vol. 1, IEEE Press, Piscataway, NJ, 1999, p. 34.
66. Paquete, L., López-Ibáñez, M., and Stützle, T., Towards an empirical analysis of SLS algorithms for multiobjective combinatorial optimization problems by experimental design, Proc. Intl. Conf. Metaheuristics, Vienna, Austria, 2005, pp. 739–746.
67. Fonseca, C. M., Grunert da Fonseca, V., and Paquete, L., Exploring the performance of stochastic multiobjective optimisers with the second-order attainment function, in Evolutionary Multi- Criterion Optimization, Vol. 3410, Coello, C. C., Aguirre, A. H., and Zitzler, E., Eds., Lecture Notes in Computer Science, Springer, Berlin, 2005, p. 250.
68. Mote, J., Murthy, I., and Olson, D. L., A parametric approach to solving bicriterion shortest path problem, Eur. J. Oper. Res., 53, 81, 1991.
69. Müller-Hannemann, M. and Weihe, K., Pareto shortest paths is often feasible in practice, Int. Workshop on Algorithm Engineering, Lecture Notes in Computer Science, Vol. 2141, Springer, Berlin, 2001, p. 185.
70. Hansen, P., Bicriterion path problems, in Multiple Criteria Decision Making Theory and Application, Vol. 177, Fandel, G. and Gal, T., Eds., Lecture Notes in Economics and Mathematic Systems, Springer, Berlin, 1979, p. 109.