scholarly journals Effective anytime algorithm for multiobjective combinatorial optimization problems

2021 ◽  
Vol 565 ◽  
pp. 210-228
Author(s):  
Miguel Ángel Domínguez-Ríos ◽  
Francisco Chicano ◽  
Enrique Alba
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Anytime Algorithm ◽  
Multiobjective Combinatorial Optimization ◽  
Combinatorial Optimization Problems

Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems

2016 ◽  
Vol 24 (1-2) ◽  
pp. 82-98 ◽  
Author(s):  
José Rui Figueira ◽  
Carlos M. Fonseca ◽  
Pascal Halffmann ◽  
Kathrin Klamroth ◽  
Luís Paquete ◽  
...  
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Multiobjective Combinatorial Optimization ◽  
Combinatorial Optimization Problems

scholarly journals Computation Results of Finding All Efficient Points in Multiobjective Combinatorial Optimization

2008 ◽  
Vol 3 (4) ◽  
pp. 374 ◽  
Author(s):  
Milan Stanojevic ◽  
Mirko Vujoševic ◽  
Bogdana Stanojevic
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Efficient Points ◽  
Steiner Tree Problem ◽  
Pareto Optimal Solutions ◽  
Problem Size ◽  
Original Algorithm ◽  
Multiobjective Combinatorial Optimization ◽  
Combinatorial Optimization Problems ◽  
The Traveling Salesman Problem

The 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.

Sign in / Sign up

Export Citation Format

Share Document