Skip to main content
SpringerLink
Log in
Book cover

International Conference on Evolutionary Multi-Criterion Optimization

EMO 2005: Evolutionary Multi-Criterion Optimization pp 33–46Cite as

1984-2004 – 20 Years of Multiobjective Metaheuristics. But What About the Solution of Combinatorial Problems with Multiple Objectives?

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3410))

Abstract

After 20 years of development of multiobjective metaheuristics the procedures for solving multiple objective combinatorial optimization problems are generally the result of a blend of evolutionary, neighborhood search, and problem dependent components. Indeed, even though the first procedures were direct adaptations of single objective metaheuristics inspired by evolutionary algorithms or neighborhood search algorithms, hybrid procedures have been introduced very quickly. This paper discusses hybridations found in the literature and mentions recently introduced metaheuristic principles.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barichard, V., Hao, J.K.: Un algorithme hybride pour le problème de sac à dos multi-objectifs. In: JNPC 2002 Proceedings: Huitièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets, Nice, France, May 27–29, pp. 19–30 (2002)

    Google Scholar 

  2. Barichard, V., Hao, J.K.: A population and interval constraint propagation algorithm. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 88–101. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Barichard, V.: Approches hybrides pour les problèmes multiobjectifs. PhD thesis, Université d’Angers, France (2003)

    Google Scholar 

  4. Beausoleil, R.: Multiple criteria scatter search. In: de Sousa, J.P. (ed.) MIC’2001 Proceedings of the 4th Metaheuristics International Conference, Porto, July 16-20, vol. 2, pp. 539–543 (2001)

    Google Scholar 

  5. Ben Abdelaziz, F., Chaouachi, J., Krichen, S.: A hybrid heuristic for multiobjective knapsack problems. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 205–212. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  6. Coello Coello, C.A., Lechuga, M.S.: MOPSO: A proposal for multiple objective particle swarm optimization. In: Congress on Evolutionary Computation(CEC 2002), May 2002, vol. 2, pp. 1051–1056. IEEE Service Center, Piscataway (2002)

    Google Scholar 

  7. Czyzak, P., Jaszkiewicz, A.: Pareto simulated annealing. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making. Proceedings of the XIIth International Conference, Hagen Germany. Lecture Notes in Economics and Mathematical Systems, vol. 448, pp. 297–307. Springer, Heidelberg (1997)

    Google Scholar 

  8. Delorme, X., Gandibleux, X., Degoutin, F.: Résolution approchée du problème de set packing bi-objectifs. Ecole d’Automne en Recherche Opérationnelle, Ecole Polytechnique, Université de Tours, Tours, France (October 2003)

    Google Scholar 

  9. Doerner, K., Gutjahr, W.J., Hartl, R.F., Strauss, C., Stummer, C.: Pareto ant colony optimization: A metaheuristic approach to multiobjective portfolio selection. A metaheuristic approach to multiobjective portfolio selection 131, 79–99 (2004)

    MATH  MathSciNet  Google Scholar 

  10. Hansen, M.P.: Metaheuristics for multiple objective combinatorial optimization. PhD thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby (Denmark), Report IMM-PHD-1998-45 (1998)

    Google Scholar 

  11. Ehrgott, M., Gandibleux, X.: Bounds and bound sets for biobjective combinatorial optimization problems. In: Koksalan, M., Zionts, S. (eds.) Multiple Criteria Decision Making in the New Millennium. Lecture Notes in Economics and Mathematical Systems, vol. 507, pp. 241–253. Springer, Heidelberg (2001)

    Google Scholar 

  12. Ehrgott, M., Gandibleux, X.: Multiobjective combinatorial optimization. In: Ehrgott, M., Gandibleux, X. (eds.) Multiple Criteria Optimization: State of the Art Annotated Bibliographic Survey. Kluwer’s International Series in Operations Research and Management Science, vol. 52, pp. 369–444. Kluwer Academic Publishers, Boston (2002)

    Google Scholar 

  13. Ehrgott, M., Tenfelde-Podehl, D.: Computation of ideal and nadir values and implications for their use in MCDM methods. European Journal of Operational Research 151(1), 119–131 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Technical report, Department of Engineering Science, The University of Auckland (2004)

    Google Scholar 

  15. Fernández, E., Puerto, J.: Multiobjective solution of the uncapacitated plant location problem. European Journal of Operational Research 145(3), 509–529 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Gandibleux, X., Mezdaoui, N., Fréville, A.: A tabu search procedure to solve multiobjective combinatorial optimization problems. In: Caballero, R., Ruiz, F., Steuer, R. (eds.) Advances in Multiple Objective and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol. 455, pp. 291–300. Springer, Berlin (1997)

    Google Scholar 

  17. Gandibleux, X., Morita, H., Katoh, N.: A genetic algorithm for 0-1 multiobjective knapsack problem. In: International Conference on Nonlinear Analysis and Convex Analysis (NACA1998) Proceedings, Niigata, Japan, July 28-31 (1998)

    Google Scholar 

  18. Gandibleux, X., Vancoppenolle, D., Tuyttens, D.: A first making use of GRASP for solving MOCO problems. Technical report, University of Valenciennes, France, Paper presented at MCDM 14, Charlottesville, VA, June 8-12 (1998)

    Google Scholar 

  19. Gandibleux, X., Fréville, A.: Tabu search based procedure for solving the 0/1 multiobjective knapsack problem: The two objective case. Journal of Heuristics 6(3), 361–383 (2000)

    Article  MATH  Google Scholar 

  20. Gandibleux, X., Morita, H., Katoh, N.: The supported solutions used as a genetic information in a population Heuristic. In: Zitzler, E., Deb, K., Thiele, L., Coello, C., Corne, D. (eds.) EMO 2001. LNCS, vol. 1993, pp. 429–442. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Gandibleux, X., Morita, H., Katoh, N.: A population-based metaheuristic for solving assignment problems with two objectives. Accepted for publication in Journal of Mathematical Modelling and Algorithms

    Google Scholar 

  22. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

  23. Gravel, M., Price, W.L., Gagné, C.: Scheduling continuous casting of aluminium using a multiple objective ant colony optimization metaheuristic. European Journal of Operational Research 143(1), 218–229 (2002)

    Article  MATH  Google Scholar 

  24. Hansen, P.: Bicriterion path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making Theory and Application. Lecture Notes in Economics and Mathematical Systems, vol. 177, pp. 109–127. Springer, Berlin (1979)

    Google Scholar 

  25. Hansen, M.P.: Tabu search for multiobjective combinatorial optimization: TAMOCO. Control and Cybernetics 29(3), 799–818 (2000)

    MATH  MathSciNet  Google Scholar 

  26. Iredi, S., Merkle, D., Middendorf, M.: Bi-criterion optimization with multi colony ant algorithms. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 359–372. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Jaszkiewicz, A.: Multiple objective genetic local search algorithm. In: Köksalan, M., Zionts, S. (eds.) Multiple Criteria Decision Making in the New Millennium. Lecture Notes in Economics and Mathematical Systems, vol. 507, pp. 231–240. Springer, Berlin (2001)

    Google Scholar 

  28. Jaszkiewicz, A.: Multiple objective metaheuristic algorithms for combinatorial optimization. Habilitation thesis. Poznan University of Technology, Poznan, Poland (2001)

    Google Scholar 

  29. Jozefowiez, N.: Modélisation et résolution approchée de problèmes de tournées multi-objectif. PhD thesis, Université de Lille 1, France (2004)

    Google Scholar 

  30. Kim, B., Gel, E.S., Carlyle, W.M., Fowler, J.W.: A new technique to compare algorithms for bi-criteria combinatorial optimization problems. In: Köksalan, M., Zionts, S. (eds.) Multiple Criteria Decision Making in the New Millenium. Lecture Notes in Economics and Mathematical Systems, vol. 507, pp. 113–123. Springer, Berlin (2001)

    Google Scholar 

  31. Lacomme, P., Prins, C., Sevaux, M.: Multiobjective capacitated arc routing problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 550–564. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  32. Malakooti, B., Wang, J., Tandler, E.C.: A sensor-based accelerated approach for multi-attribute machinability and tool life evaluation. International Journal of Production Research 28, 2373–2392 (1990)

    Article  Google Scholar 

  33. Molina, J., Laguna, M., Marti, R., Caballero, R.: SSPMO: A scatter search procedure for non-linear multiobjective optimization. In: Working paper, Leeds School of Business, University of Colorado, USA

    Google Scholar 

  34. Mostaghim, S., Teich, J.: Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO). In: 2003 IEEE Swarm Intelligence Symposium Proceedings, IEEE Service Center, Indianapolis, Indiana, USA, April 2003, pp. 26–33 (2003)

    Google Scholar 

  35. Murata, T., Ishibuchi, H.: MOGA: Multi-objective genetic algorithms. In: Proceedings of the 2nd IEEE International Conference on Evolutionary Computing, IEEE Service Center, Piscataway, pp. 289–294 (1995)

    Google Scholar 

  36. Przybylski, A., Gandibleux, X., Ehrgott, M.: Seek and cut algorithm computing minimal and maximal complete efficient solution sets for the biobjective assignment problem. In: MOPGP 2004 – 6th International Conference on Multi Objective Programming and Goal Programming, Hammamet, Tunisia, April 14-16 (2004)

    Google Scholar 

  37. Sayin, S.: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Mathematical Programming 87, 543–560 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  38. Schaffer, J.D.: Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. PhD thesis, Vanderbilt University, Nashville, TN, USA (1984)

    Google Scholar 

  39. Serafini, P.: Simulated annealing for multiobjective optimization problems. In: Proceedings of the 10th International Conference on Multiple Criteria Decision Making, Taipei-Taiwan, vol. I, pp. 87–96 (1992)

    Google Scholar 

  40. Shelokar, P.S., Adhikari, S., Vakil, R., Jayaraman, V.K., Kulkarni, B.D.: Multiobjective ant algorithm: Combination of strength Pareto fitness assignment and thermodynamic clustering. Foundations of Computing and Decision Sciences 25(4), 213–230 (2000)

    Google Scholar 

  41. Sun, M.: Applying tabu search to multiple objective combinatorial optimization problems. In: Proceedings of the 1997 DSI Annual Meeting, San Diego, California, vol. 2, pp. 945–947. Decision Sciences Institute, Atlanta (1997)

    Google Scholar 

  42. Tenfelde-Podehl, D.: Facilities Layout Problems: Polyhedral Structure, Multiple Objectives and Robustness, PhD thesis, University of Kaiserslautern, Germany (2002)

    Google Scholar 

  43. Ulungu, E.L.: Optimisation combinatoire multicritère: Détermination de l’ensemble des solutions efficaces et méthodes interactives, Université de Mons-Hainaut, Faculté des Sciences, 313 pages (1993)

    Google Scholar 

  44. Viana, A., Pinho de Sousa, J.: Using metaheuristics in multiobjective ressource constrained project scheduling. European Journal of Operational Research 120(2), 359–374 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LINA – FRE CNRS 2729, Université de Nantes, 2 rue de la Houssiniere, BP 92208, F-44322, Nantes Cedex 03, France

    Xavier Gandibleux

  2. Department of Engineering Science, The University of Auckland, Private Bag 92019, Auckland, New Zealand

    Matthias Ehrgott

Authors
  1. Xavier Gandibleux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Ehrgott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Computación, CINVESTAV-IPN (Evolutionary Computation Group), 07300, México, D.F., México

    Carlos A. Coello Coello

  2. Centro de Investigación en Matemáticas (CIMAT), A.P. 402, Guanajuato, 36000, Mexico

    Arturo Hernández Aguirre

  3. Computer Engineering and Networks Laboratory, ETH, Zurich, Switzerland

    Eckart Zitzler

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gandibleux, X., Ehrgott, M. (2005). 1984-2004 – 20 Years of Multiobjective Metaheuristics. But What About the Solution of Combinatorial Problems with Multiple Objectives?. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds) Evolutionary Multi-Criterion Optimization. EMO 2005. Lecture Notes in Computer Science, vol 3410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31880-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31880-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24983-2

  • Online ISBN: 978-3-540-31880-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation