SearchCol: metaheuristic search by column generation

Authors:
Filipe Alvelos;Amaro de Sousa;Dorabella Santos
Affiliations:
Departamento de Produção e Sistemas, Centro de Investigação Algoritmi, Universidade do Minho, Portugal;Instituto de Telecomunicações - Pólo de Aveiro, Departamento de Electrónica, Telecomunicações e Informática, Universidade de Aveiro, Portugal;Instituto de Telecomunicações - Pólo de Aveiro, Portugal
Venue:
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Year:
2010

Citing 10
Cited 1

Parallel Machine Scheduling by Column Generation

Operations Research
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
Selected Topics in Column Generation

Operations Research
Dual-Optimal Inequalities for Stabilized Column Generation

Operations Research
An extended model and a column generation algorithm for the planar multicommodity flow problem

Networks
A generalization of column generation to accelerate convergence

Mathematical Programming: Series A and B
Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing

Traffic Management and Traffic Engineering for the Future Internet
Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem

Optimization Methods & Software - The 22nd European Conference on Operational Research, 8-11 July 2007, Prague, Czech Republic
A unified view on hybrid metaheuristics

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics

A hybrid column generation with GRASP and path relinking for the network load balancing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a general framework for the combination of column generation (CG) with metaheuristics (MHs) aiming to solve combinatorial optimization problems amenable for decomposition approaches, "SearchCol". The combination of the two approaches is based on representing the solution of the problem as the selection of a subset of solutions of smaller (sub)problems which are generated by CG. In each iteration of a SearchCol algorithm, CG provides the optimal solution (primal and dual) to theMH which returns a (incumbent) solution used for defining the (perturbed) CG problem of the next iteration.We describe the SearchCol framework and a general SearchCol algorithm based on local search.