Journal
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume 232, Issue 1, Pages 90-101Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.cam.2008.10.055
Keywords
Network design; Multicommodity network; Capacitated problem; Optimization
Categories
Funding
- Japanese Ministry of Education, Culture, Sports, Science and Technology [16510119, 2006]
- Grants-in-Aid for Scientific Research [16510119] Funding Source: KAKEN
Ask authors/readers for more resources
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. (C) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available