Paper Info
Title
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
Abstract
Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms. For these problems, column generation is used to compute good dual bounds that can be incorporated in branch-and-price algorithms. Recent research has concentrated on describing lower and upper bounds of bi-objective and general multi-objective problems with sets of points (bound sets). An important issue to address when computing a bound set by column generation is how to efficiently search for columns corresponding to each point of the bound set. In this work, we propose a generalized column generation scheme to compute bound sets for bi-objective combinatorial optimization problems. We present specific implementations of the generalized scheme for the case where one objective is a min–max function by using a variant of the \(\varepsilon \)-constraint method to efficiently model these problems. The proposed strategies are applied to a bi-objective extension of the multi-vehicle covering tour problem, and their relative performances based on different criteria are compared. The results show that good bound sets can be obtained in reasonable times if columns are efficiently managed. The variant of the \(\varepsilon \)-constraint presented is also better than a standard \(\varepsilon \)-constraint method in terms of the quality of the bound sets.
Year
DOI
Venue
2018
10.1007/s13675-017-0090-6
EURO Journal on Computational Optimization
Keywords
DocType
Volume
Column generation,Multi-objective optimization,Bound sets,Vehicle routing problems,90-08,90C10,90C29,90C27
Journal
6
Issue
ISSN
Citations 
2
2192-4414
0
PageRank 
References 
Authors
0.34
10
3
Name
Order
Citations
PageRank
Christian Artigues158146.02
Nicolas Jozefowiez234821.58
Boadu Mensah Sarpong331.07