A discussion of scalarization techniques for multiple objective integer programming
- 881 Downloads
In this paper we consider solution methods for multiobjective integer programming (MOIP) problems based on scalarization. We define the MOIP, discuss some common scalarizations, and provide a general formulation that encompasses most scalarizations that have been applied in the MOIP context as special cases. We show that these methods suffer some drawbacks by either only being able to find supported efficient solutions or introducing constraints that can make the computational effort to solve the scalarization prohibitive. We show that Lagrangian duality applied to the general scalarization does not remedy the situation. We also introduce a new scalarization technique, the method of elastic constraints, which is shown to be able to find all efficient solutions and overcome the computational burden of the scalarizations that use constraints on objective values. Finally, we present some results from an application in airline crew scheduling as evidence.
KeywordsMultiobjective optimization Integer programming Scalarization Lagrangian duality Elastic constraints Crew scheduling
Unable to display preview. Download preview PDF.
- Carlyle, W.M. and R.K. Wood. (2003). “Lagrangian Relaxation and Enumeration for Solving Constrained Shortest Path Problems.” In L. Foulds (Ed.), Proceedings of the 38th Annual Conference of the Operational Research Society of New Zealand, pp. 3–12. Operational Research Society of New Zealand, Auckland.Google Scholar
- Chankong, V. and Y.Y. Haimes. (1983). Multiobjective Decision Making Theory and Methodology. New York: Elsevier Science.Google Scholar
- Ehrgott, M. and X. Gandibleux. (2000). “A Survey and Annotated Bibliography of Multiobjective Combinatorial Optimization.” OR Spektrum, 22, 425–460.Google Scholar
- Ehrgott, M. and X. Gandibleux (Eds.). (2002). Multiple Criteria Optimization—State of the Art Annotated Bibliographic Surveys, volume 52 of Kluwer's International Series in Operations Research and Management Science. Boston, MA: Kluwer Academic Publishers.Google Scholar
- Ehrgott, M. and D.M. Ryan. (2003). “The Method of Elastic Constraints for Multiobjective Combinatorial Optimization and its Application in Airline Crew Scheduling.” In T. Tanino, T. Tanaka, and M. Inuiguchi, (Eds.), Multi-Objective Programming and Goal-Programming, pp. 117–122. Berlin: Springer Verlag.Google Scholar
- Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability—A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.Google Scholar
- Guddat, J., F. Guerra Vasquez, K. Tammer, and K. Wendler. (1985). Multiobjective and Stochastic Optimization Based on Parametric Optimization. Berlin: Akademie-Verlag.Google Scholar
- Klamroth, K., J. Tind, and S. Zust. (2004). “Integer Programming Duality in Multiple Objective Programming.” Journal of Global Optimization, To appear.Google Scholar
- Kouvelis, P. and G. Yu. (1997). Robust Discrete Optimization and Its Applications, volume 14 of Nonconvex Optimization and its Applications. Dordrecht: Kluwer Academic Publishers.Google Scholar
- Wierzbicki, A.P. (1986). “A Methodological Approach to Comparing Parametric Characterizations of Efficient Solutions.” In G. Fandel, M. Grauer, A. Kurzhanski, and A.P. Wierzbicki (Eds.), Large-Scale Modelling and Interactive Decision Analysis, volume 273 of Lecture Notes in Economics and Mathematical Systems, pp. 27–45. Berlin: Springer Verlag.Google Scholar
- Wierzbicki, A.P., M. Makowski, and J. Wessels (Eds.). (2000). Model-Based Decision Support Methodology with Environmental Applications. Dordrecht: Kluwer Academic Publishers.Google Scholar