A capacity scaling heuristic for the multicommodity capacitated network design problem

Authors:
N. Katayama;M. Chen;M. Kubo
Affiliations:
Department of Distributions and Logistics Systems, Ryutsu Keizai University, 120 Hirahata, Ryugasaki, Ibaraki, 301-8555, Japan;Department of Marine Technology, Tokyo University of Marine Science and Technology, 2-1-6 Etchujima, Koto-ku,Tokyo, 135-8533, Japan;Department of Marine Technology, Tokyo University of Marine Science and Technology, 2-1-6 Etchujima, Koto-ku,Tokyo, 135-8533, Japan
Venue:
Journal of Computational and Applied Mathematics
Year:
2009

Citing 12
Cited 3

The convex hull of two core capacitated network design problems

Mathematical Programming: Series A and B
A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem

Operations Research
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Network Design Using Cut Inequalities

SIAM Journal on Optimization
Cooperative Parallel Tabu Search for Capacitated Network Design

Journal of Heuristics
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
Tabu Search-based algorithm for Capacitated Multicommodity Network Design Problem

CONIELECOMP '04 Proceedings of the 14th International Conference on Electronics, Communications and Computers
Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

Operations Research
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research
A General Heuristic for Production Planning Problems

INFORMS Journal on Computing
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design

Journal of Heuristics
A first multilevel cooperative algorithm for capacitated multicommodity network design

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search

Lagrangean relaxation heuristics for the p-cable-trench problem

Computers and Operations Research
A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

International Journal of Applied Metaheuristic Computing
A cutting plane algorithm for the Capacitated Connected Facility Location Problem

Computational Optimization and Applications

Quantified Score

Hi-index	7.29

Visualization

Abstract

In this paper, we propose a capacity scaling heuristic using a column generation and row generation technique to address the multicommodity capacitated network design problem. The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs. By combining a column and row generation technique and a strong formulation including forcing constraints, this heuristic derives high quality results, and computational effort can be reduced considerably. The capacity scaling heuristic offers one of the best current results among approximate solution algorithms designed to address the multicommodity capacitated network design problem.