Skip to main content

A New Technique to Compare Algorithms for Bi-criteria Combinatorial Optimization Problems

  • Conference paper
Multiple Criteria Decision Making in the New Millennium

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 507))

Abstract

The recent interest in multiobjective combinatorial optimization problems resulted in the development of several exact algorithms and metaheuristics for the a posteriori solution of these problems. However, there are as yet no commonly used, reliable methods to compare approximations generated by these algorithms. In this paper, we introduce a new measure for this purpose: Integrated Convex Preference (ICP). We compare the performance of ICP with that of the existing measures using approximations generated by two different genetic algoithms for an NP-hard, bi-criteria parallel machine scheduling problem. Our results show that our measure outperforms existing measures previously used in the literature, and that ICP can handle approximate solution sets with diverse geometric features effectively.

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

  • Carlyle, W. M., Kim, B., Fowler, J. W., and Gel, E. S. (2000) A measure to compare sets of Pareto optimal solutions for multiobjective optimization problems. Technical Report ASU-IE-ORPS-2000-022, Department of Industrial Engineering, Arizona State University, Tempe, AZ.

    Google Scholar 

  • Cieniawski, S. E., Eheart, J. W., and Ranjithan, S. (1995) Using Genetic Algorithms to Solve a Multiobjective Groundwater Monitoring Problem. Water Resources Research, 31(2):399–409.

    Article  Google Scholar 

  • Czyzak, P. and Jaszkiewicz, B. (1998) Pareto Simulated annealing — A Metahueristic Technique for Multiple-Objective Combinatorial Optimization. Journal of Multi-Criteria Decision Analyses, 7:34–47.

    Article  Google Scholar 

  • De, P., Ghosh, J. B., and Wells, C. E. (1992) Heuristic Estimation of the Efficient Frontier for a Bi-Criteria Scheduling Problem. Decision Sciences, 23:596–609.

    Article  Google Scholar 

  • Daniels, R. L., (1992). Analytical evaluation of multi-criteria heuristics. Management Science, 38(4):501–513.

    Article  Google Scholar 

  • Ehrgott, M. and Gandibleux, X. (2000) An Annotated Bibliography of Multiobjective Combinatorial Optimization Problems. To appear in OR Spektrum.

    Google Scholar 

  • Fowler, J. W., Horng, S.-H., and Cochran, J. K. (1999) A Multi Population Genetic Algorithm to Solve Parallel Machine Scheduling Problem with Sequence Dependent Setups. Technical Report ASU-IE-ORPS-1999-007, Department of Industrial Engineering, Arizona State University, Tempe, AZ.

    Google Scholar 

  • Hansen M. P. and Jaszkiewicz, A. (1998) Evaluating the quality of approximations to the non-dominated set. IMM Technical Report IMM-REP-1998-7, Technical University of Denmark, Denmark.

    Google Scholar 

  • Hyun, C. J., Kim, Y., and Kim, Y. K. (1998) A Genetic Algorithm for Multiple Objective Sequencing Problems in Mixed Model Assembly Lines. Computers & Operations Research, 25(7/8):675–690.

    Article  Google Scholar 

  • Murata, T., Ishibuchi, H., and Tanaka, H. (1996) Multiobjective genetic algorithm and its application to flowshop scheduling. Computers Industrial Engineering, 30(4):957–968.

    Article  Google Scholar 

  • Pinedo, M. (1995). Scheduling: Theory, Algorithms, and Systems. Prentice Hall, New Jersey.

    Google Scholar 

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

    Article  Google Scholar 

  • Schaffer, J. D. (1985) Multiple objective optimization with vector evaluated genetic algorithms. Proceedings of the first International Conference on Genetic Algorithms, 93–100.

    Google Scholar 

  • Schenkerman, S. (1990) Relative Objective Functions in Multiobjective Decision Support Models. Decision Sciences, 21:727–737.

    Article  Google Scholar 

  • Viana, A. and Sousa, J. P. (2000) Using metaheuristics in multiobjective resource constrained project scheduling. European Journal of Operations Research, 120:359–374.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, B., Gel, E.S., Carlyle, W.M., Fowler, J.W. (2001). 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 Millennium. Lecture Notes in Economics and Mathematical Systems, vol 507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56680-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56680-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42377-5

  • Online ISBN: 978-3-642-56680-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics