Variable neighborhood search for the bi-objective post-sales network design problem: A fitness landscape analysis approach

2014 ◽  
Vol 52 ◽  
pp. 300-314 ◽  
Author(s):  
Majid Eskandarpour ◽  
Ehsan Nikbakhsh ◽  
Seyed Hessameddin Zegordi
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Variable Neighborhood Search ◽  
Fitness Landscape ◽  
Landscape Analysis ◽  
Network Design Problem ◽  
Analysis Approach ◽  
Neighborhood Search ◽  
Fitness Landscape Analysis

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.

Sign in / Sign up

Export Citation Format

Share Document