Computation Results of Finding All Efficient Points in Multiobjective Combinatorial Optimization
AbstractThe number of efficient points in criteria space of multiple objective combinatorial optimization problems is considered in this paper. It is concluded that under certain assumptions, that number grows polynomially although the number of Pareto optimal solutions grows exponentially with the problem size. In order to perform experiments, an original algorithm for obtaining all efficient points was formulated and implemented for three classical multiobjective combinatorial optimization problems. Experimental results with the shortest path problem, the Steiner tree problem on graphs and the traveling salesman problem show that the number of efficient points is much lower than a polynomial upper bound.
 M. Ehrgott, X. Gandibleux, A Survey and Annotated Bibliography of Multiobjective Combinatorial Optimization, OR Spektrum, Vol. 22, pp. 425-46 2000.
 V.A. Emelichev, V.A. Perepelitsa, On Cardinality of the Set of Alternatives in Discrete Manycriterion Problems, Discrete Math. Appl. Vol. 2, pp. 461-471, 1992.
 H.W. Hamacher, G. Ruhe, On Spanning Tree Problems with Multiple Objectives, Ann. Oper. Res., Vol. 52, pp. 209-230, 1994.
 I.V. Sergienko, V.A. Perepelitsa, Finding the Set of Alternatives in Discrete Multicriterion Problems, Cybernetics Vol. 23, pp. 673-683, 1987.
 M. Stanojevic, M. Vujosevic, B. Stanojevic, Number of Efficient Points in Some Multiobjective Combinatorial Optimization Problems, International Journal of Computers, Communications & Control, Vol.III (supl. issue), pp. 497-502, 2008.
 M. Visée, J. Teghem, M. Pirlot, E.L. Ulungu, Two-phases Method and Branch and Bound Procedures to Solve the Bi-objective Knapsack Problem, J. Glob. Optim., Vol. 12, pp. 139-155, 1998.
 M. Vujoševic, M. Stanojevi’c, Multiobjective Traveling Salesman Problem and a Fuzzy Set Approach to Solving It. In: D. Ivanchev, M.D. Todorov (eds), Applications of Mathematics in Engeneering and Economics, Heron Press, Sofia, pp. 111-118, 2002.
 M. Vujoševic, M. Stanojevi’c, A Bicriterion Steiner Tree Problem on Graph", Yugosl. J. Oper. Res., Vol. 13, pp. 25-33, 2003.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.