Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Cooperative Parallel Tabu Search for Capacitated Network Design
Journal of Heuristics
Lifted Cover Inequalities for 0-1 Integer Programs: Computation
INFORMS Journal on Computing
A Simplex-Based Tabu Search Method for Capacitated Network Design
INFORMS Journal on Computing
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Exploring relaxation induced neighborhoods to improve MIP solutions
Mathematical Programming: Series A and B
A general heuristic for vehicle routing problems
Computers and Operations Research
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
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
Operations Research Letters
An ILP improvement procedure for the Open Vehicle Routing Problem
Computers and Operations Research
Approximability of capacitated network design
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
The inventory-routing problem with transshipment
Computers and Operations Research
Branch-and-Price guided search
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Journal of Combinatorial Optimization
A branch-and-price guided search approach to maritime inventory routing
Computers and Operations Research
The synchronized arc and node routing problem: Application to road marking
Computers and Operations Research
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
Computational Optimization and Applications
Improved Load Plan Design Through Integer Programming Based Local Search
Transportation Science
Hi-index | 0.00 |
We develop a solution approach for the fixed-charge network flow (FCNF) problem that produces provably high-quality solutions quickly. The solution approach combines mathematical programming algorithms with heuristic search techniques. To obtain high-quality solutions, it relies on neighborhood search with neighborhoods that involve solving carefully chosen integer programs derived from the arc-based formulation of FCNF. To obtain lower bounds, the linear programming relaxation of the path-based formulation of FCNF is used and strengthened with cuts discovered during the neighborhood search. The solution approach incorporates randomization to diversify the search and learning to intensify the search. Computational experiments demonstrate the efficacy of the proposed approach.