Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

Authors:
Mike Hewitt;George Nemhauser;Martin W. P. Savelsbergh
Affiliations:
Department of Industrial and Systems Engineering, Rochester Institute of Technology, Rochester, New York 14623;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332;School of Mathematical and Physical Sciences, University of Newcastle, Callaghan NSW 2308, Australia
Venue:
INFORMS Journal on Computing
Year:
2013

Citing 13
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
Using MPI (2nd ed.): portable parallel programming with the message-passing interface

Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Cooperative Parallel Tabu Search for Capacitated Network Design

Journal of Heuristics
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

Operations Research
Exploring relaxation induced neighborhoods to improve MIP solutions

Mathematical Programming: Series A and B
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
An optimization algorithm for the inventory routing problem with continuous moves

Computers and Operations Research
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Transportation Science
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery

Transportation Science
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
A maritime inventory routing problem: Practical approach

Computers and Operations Research

Branch-and-Price guided search

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A branch-and-price guided search approach to maritime inventory routing

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop an exact algorithm for integer programs that uses restrictions of the problem to produce high-quality solutions quickly. Column generation is used both for generating these problem restrictions and for producing bounds on the value of the optimal solution. The performance of the algorithm is greatly enhanced by using structure, such as arises in network flow type applications, to help define the restrictions that are solved. In addition, local search around the current best solution is incorporated to enhance overall performance. The approach is parallelized and computational experiments on a classical problem in network design demonstrate its efficacy.