Column generation for a UAV assignment problem with precedence constraints

2011 ◽  
Vol 21 (12) ◽  
pp. 1421-1433 ◽  
Author(s):  
David W. Casbeer ◽  
Raymond W. Holsapple
Keyword(s):  
Column Generation ◽  
Assignment Problem ◽  
Precedence Constraints

Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem

4OR ◽  
2016 ◽  
Vol 14 (2) ◽  
pp. 201-220 ◽  
Author(s):  
Christophe Duhamel ◽  
Philippe Mahey ◽  
Alexandre X. Martins ◽  
Rodney R. Saldanha ◽  
Mauricio C. de Souza
Keyword(s):  
Column Generation ◽  
Assignment Problem ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment

A column generation heuristic for a dynamic generalized assignment problem

2009 ◽  
Vol 36 (9) ◽  
pp. 2670-2681 ◽  
Author(s):  
Luigi Moccia ◽  
Jean-François Cordeau ◽  
Maria Flavia Monaco ◽  
Marcello Sammarra
Keyword(s):  
Column Generation ◽  
Assignment Problem ◽  
Generalized Assignment Problem ◽  
Generalized Assignment

Complementarity Formulation and Solution Algorithm for Auto-Transit Assignment Problem

2019 ◽  
Vol 2673 (4) ◽  
pp. 384-397
Author(s):  
Amirali Zarrinmehr ◽  
Hedayat Z. Aashtiani ◽  
Yu (Marco) Nie ◽  
Hossein Azizian
Keyword(s):  
Column Generation ◽  
Assignment Problem ◽  
Equilibrium Solution ◽  
Solution Algorithm ◽  
Numerical Results ◽  
Cost Functions ◽  
Combined Model ◽  
Transit Assignment ◽  
Large Size ◽  
Assignment Model

In this paper, a combined model of auto-transit assignment is introduced based on two complementarity formulations in the literature. The model accounts for interactions between the auto and transit modes through non-separable asymmetric demand and cost functions. A path-based solution algorithm is presented based on the three ideas of decomposition, column generation, and linearization, which have proved to be effective in tackling large-size networks. Numerical results over the Chicago sketch network suggest that the algorithm converges quickly within the first iterations, but is less effective as the solution gets closer to the neighborhood of the equilibrium solution. The sluggish convergence behavior is attributed to the difficulty of searching the space of strategy-based transit assignment model.

Sign in / Sign up

Export Citation Format

Share Document