Abstract
Most of the published exact methods for solving multi-objective combinatorial optimization problems implicitely use properties of the bi-objective case and cannot easily be generalized to more than two objectives. Papers that deal ex-plicitely with three (or more) objectives are relatively rare and often recent. Very few experimental results are known for these methods and no comparison has been done. We have recently developed a generalization of the two phase method that we have applied to the three-objective assignment problem. In order to evaluate the performance of our method we have implemented three exact methods found in the literature. We provide an analysis of the performance of each method and explain the main difficulties observed in their application to the three-objective assignment problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ehrgott M, Gandibleux X (2007) Bound sets for biobjective combinatorial optimization problems. Comput Oper Res 34(9):2674–2694
Ehrgott M, Tenfelde-Podehl D (2003) Computation of ideal and nadir values and implications for their use in MCDM methods. Eur J Oper Res 151:119–139
Haimes Y, Lasdon L, Wismer D (1971) On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transa Syst Man Cybern 1:296– 297
Sylva J, Crema A (2004) A method for finding the set of non-dominated vectors for multiple objective integer linear programs. Eur J Oper Res 158(1):46–55
Przybylski A, Gandibleux X, Ehrgott M (2007) Two Recursive algorithms for finding all non-dominated extreme points in the outcome set of a multi-objective integer programme. Technical Report LINA. Submitted to INFORMS Jounal On Computing
Przybylski A, Gandibleux X, Ehrgott M (2008) Two phase algorithms for the bi-objective assignment problem. Eur J Oper Res 185(2):509–533
Tenfelde-Podehl D (2003) A recursive algorithm for multiobjective combinatorial problems with Q criteria. Technical Report, University of Graz, Austria
Laumanns M, Thiele L, Zitzler E (2006) An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. Eur J Oper Res 169(3):932–942
Przybylski A, Gandibleux X, Ehrgott M (2007) A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Technical Report LINA
Ulungu EL, Teghem J (1995) The two-phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found Comput Decision Sci 20(2):149–165
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anthony, P., Xavier, G., Ehrgott, M. (2009). Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem. In: Barichard, V., Ehrgott, M., Gandibleux, X., T'Kindt, V. (eds) Multiobjective Programming and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85646-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-85646-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85645-0
Online ISBN: 978-3-540-85646-7
eBook Packages: Business and EconomicsBusiness and Management (R0)