On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem

Networks ◽  
2008 ◽  
Vol 53 (1) ◽  
pp. 6-18 ◽  
Author(s):  
Mark W. Lewis
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Fixed Charge ◽  
Network Design Problem ◽  
Decision Variables ◽  
Multicommodity Network Design

MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem

2020 ◽  
Vol 37 (03) ◽  
pp. 2050009
Author(s):  
Naoto Katayama
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Large Scale ◽  
Fixed Charge ◽  
Network Design Problem ◽  
Neighborhood Search ◽  
Search Heuristics ◽  
Scaling Procedure ◽  
Initial Feasible Solution ◽  
Multicommodity Network Design

The fixed-charge capacitated multicommodity network design problem is a fundamental optimization problem arising in many network configurations. The solution of the problem provides an appropriate network design as well as routes of multicommodity flows aimed at minimizing the total cost, which is the sum of the flow costs and fixed-charge costs over a network with limited arc capacities. In the present paper, we introduce a combined approach with a capacity scaling procedure for finding an initial feasible solution and an MIP neighborhood search for improving the solutions. Besides, we modify the procedure for application to large-scale problems. Computational experiments demonstrate the effectiveness of the proposed approach, and high-quality solutions are obtained for two problem sets from the literature.

A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem

2015 ◽  
Vol 27 (1) ◽  
pp. 48-58 ◽  
Author(s):  
Masoud Yaghini ◽  
Mohammad Karimi ◽  
Mohadeseh Rahbar ◽  
Mohammad Hassan Sharifitabar
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Cutting Plane ◽  
Fixed Charge ◽  
Network Design Problem ◽  
Neighborhood Structure ◽  
Multicommodity Network Design

scholarly journals A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow

2016 ◽  
Vol 76 ◽  
pp. 134-146 ◽  
Author(s):  
Pedro Henrique González ◽  
Luidi Simonetti ◽  
Philippe Michelon ◽  
Carlos Martinhon ◽  
Edcarllos Santos
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Fixed Charge ◽  
Network Design Problem ◽  
Local Branching ◽  
Optimal Flow ◽  
Variable Fixing

A local branching heuristic for the capacitated fixed-charge network design problem

2010 ◽  
Vol 37 (3) ◽  
pp. 575-581 ◽  
Author(s):  
Inmaculada Rodríguez-Martín ◽  
Juan José Salazar-González
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Fixed Charge ◽  
Network Design Problem ◽  
Local Branching
Sign in / Sign up

Export Citation Format

Share Document