Skip to main content

Multi-objective Combinatorial Optimization

MOCO

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Generation of E(P)

  Direct Methods

  Two-Phase Method

  Heuristic Methods

Interactive Determination of a Good Compromise

  Goal Programming

  Interactive Two-Phase Methods and MOSA Method

See also

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Ben Abdelaziz F, Chaouachi J, Krichen S (1997) A hybrid heuristic for multiobjective knapsack problems. Techn Report Inst Sup Gestion, Tunisie, submitted

    Google Scholar 

  2. Current JR, Min H (1986) Multiobjective design of transportation networks: taxonomy and annotation. Europ J Oper Res 26(2):187–201

    Article  MathSciNet  Google Scholar 

  3. Czyzak P, Jaszkiewicz A (1998) Pareto simulated annealing – A metaheuristic technique for multiple objective combinatorial optimization. J Multi-Criteria Decision Anal 7:34–47

    Article  MATH  Google Scholar 

  4. Gandibleux X, Mezdaoui N, Fréville A (1997) A tabu search procedure to solve multiobjective combinatorial optimisation problems. In: Caballero R, Steuer R (eds) Proc. Volume of MOPGP'96. Springer, Berlin

    Google Scholar 

  5. Hansen MP (1996) Tabu search for multiobjective optimization: MOTS. Techn Report Inst Math Modelling, Techn Univ Denmark

    Google Scholar 

  6. Hoogeveen H (1992) Single machine bicriteria scheduling. PhD Diss, Univ Eindhoven

    Google Scholar 

  7. Köksalan M, Köksalan–Konda CkiS (1997) Multiple criteria scheduling on single machine: A review and a general approach. In: Karwan M, et al. (eds) Essays in Decision Making. Springer, Berlin

    Google Scholar 

  8. Ulungu EL, Teghem J (1991) Multi-objective shortest problem path: A survey. In: Cerny M, Glackaufova D, Loula D (eds) Proc Internat Workshop on MCDM, Liblice, pp 176–188

    Google Scholar 

  9. Ulungu EL, Teghem J (1994) Multi-objective combinatorial optimization problems: A survey. J Multi-Criteria Decision Anal 3:83–104

    Article  MATH  Google Scholar 

  10. Ulungu EL, Teghem J (1997) Solving multi-objective knapsack problem by a branch and bound procedure. In: Climaco J (ed) Multicriteria Analysis. Springer, Berlin, pp 269–278

    Google Scholar 

  11. Ulungu EL, Teghem J, Fortemps Ph, Tuyttens D (1999) MOSA method: A tool for solving MOCO problems I. Multi-Criteria Decision Anal 8:221–236

    Article  MATH  Google Scholar 

  12. Ulungu EL, Teghem J, Ost Ch (1998) Efficiency of interactive multi-objective simulated annealing through a case study. J Oper Res Soc 49:1044–1050

    Article  MATH  Google Scholar 

  13. Viennet R, Fontex M (1996) Multi-objective combinatorial optimization using a genetic algorithm for determining a Pareto set. Internat J Syst Sci 27(2):255–260

    Article  MATH  Google Scholar 

  14. Visée M, Teghem J, Pirlot M, Ulungu EL (1998) Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J Global Optim 12:139–155

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Teghem, J. (2008). Multi-objective Combinatorial Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_418

Download citation

Publish with us

Policies and ethics