Skip to main content

A Tabu Search Procedure to Solve MultiObjective Combinatorial Optimization Problems

  • Conference paper
Advances in Multiple Objective and Goal Programming

Abstract

Several studies have considered metaheuristics, especially simulated annealing, for solving combinatorial optimization problems involving several objectives. Yet, few works have been devoted to tabu search approaches. In this paper, we present a heuristic based upon tabu search principles to generate a good approximation of the set of the Pareto-optimal (efficient) solutions.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Czyzak P. and Jaszkiewicz A. (1996) “Pareto Simulated Annealing - a metaheuristic technique for multiple objective combinatorial optimization”, Working paper, Poznan University of Technology, Poland.

    Google Scholar 

  2. Dahl G., Jörnsten K. and Lokketangen A. (1995) “A Tabu Search Approach to the Channel Minimization Problem”, ICOTA’95, 9 pages.

    Google Scholar 

  3. Gandibleux X., Libert G., Cartignies E., et Millot P. (1994) “SMART: Étude de la faisabilité d’un solveur de problèmes de mobilisation de réserve tertiaire d’électricité.”, Revue des Systèmes de Décision, vol. 3, n°1, pp. 45–67.

    Google Scholar 

  4. Système d’aide à la décision pour la conduite de processus perturbés: une approche hybride fondée sur l’intelligence artificielle, la programmation linéaire et l’aide multicritère à la décision. Application à la mobilisation de réserve tertiaire d’Électricité De France“, Thèse de Doctorat, Janvier 1995, Université de Valenciennes.

    Google Scholar 

  5. Gandibleux X., Fréville A., Hanafi S. (1995b) “Modelization of the MRT Problem on the Short-Term Horizon: An Integer Programming Approach”, International Conference on Industrial Engineering and Production Management Proceedings., vol.], pp.423–433, April 4–7, 1995, Marrakech, Morocco.

    Google Scholar 

  6. Glover F. (1986) “Future paths for integer programming and links to artificial intelligence”, Computers & Operationss Research., 5, pp. 533–549.

    Article  Google Scholar 

  7. Glover F. (1995) “Tabu search fundamentals and uses”, Technical report, April 1995, 85 pages, University of Colorado, Boulder, Colorado, USA.

    Google Scholar 

  8. Hansen P. (1986) “The steepest ascent mildest descent heuristic for combinatorial programming”, Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.

    Google Scholar 

  9. Hertz A., Jaumard B., Ribeiro C.C., Formosinho Filho W.P. (1994) “A MultiCriteria Tabu Search approach to cell formation problems in group technology with multiple objectives”, Recherche Opérationnelle/Operations Research, vol.28, n°3, 1994, pp. 303–328.

    Google Scholar 

  10. Pirlot M. (1992) “General local search heuristics in combinatorial optimization: a tutorial”, JORBEL, vol. 32 (1,2), pp. 7–67.

    Google Scholar 

  11. Reeves C. (1995) Modern Heuristic Techniques for Combinatorial Problems, McGrawHill, London, 320 pages.

    Google Scholar 

  12. Roy B. et Bouyssou D. (1993) Aide multicritère à la décision: méthodes et cas, collection gestion, Économica, Paris.

    Google Scholar 

  13. ] Serafini P. (1992) “Simulated Annealing for Multiple Objective Optimization Problems”, 10th MCDM International Conference Proceedings, Tapei 19–24 July 1992, vol. 1, 1992, pp.87–96.

    Google Scholar 

  14. Steuer R. (1986) Multiple Criteria Optimization: theory, computation and application, Wiley, New York.

    Google Scholar 

  15. Ulungu E. and Teghem J. (1994) “Multi-objective Combinatorial Optimization Problems: A Survey”, Journal of Multi-Criteria Decision Analysis, vol. 3, pp. 83–104.

    Article  Google Scholar 

  16. Ulungu E. L.B., Teghem J. and Fortemps P. (1995) “Heuristics for Multi-objective Combinatorial Optimization Problems by simulated annealing”, MCDM: Theory and applications (Gu J., Wei, G.C.Q & Wang Sh. Eds ), SCI-TECH Information Services, pp. 228–238.

    Google Scholar 

  17. Vanderpooten D. (1990) “L’approche interactive dans l’aide multicritère à la décision”, Thèse de doctorat, Université de Paris IX - Dauphine, France.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gandibleux, X., Mezdaoui, N., Fréville, A. (1997). 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. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46854-4_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46854-4_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63599-4

  • Online ISBN: 978-3-642-46854-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics