A Learning-Based Matheuristic for Stochastic Multicommodity Network Design

Author(s):  
Fatemeh Sarayloo ◽  
Teodor Gabriel Crainic ◽  
Walter Rei

This paper proposes a solution approach for the multicommodity capacitated fixed-charge network design problem with uncertain demand modeled as a two-stage stochastic program. The proposed learning-based matheuristic combines heuristic search techniques with mathematical programming. It provides a systematic approach to identifying structures of good-quality solutions by gradually considering scenarios and their influences on design decisions. Extensive computational experiments illustrate the efficiency of the proposed matheuristic in obtaining high-quality solutions with limited computational efforts.

2020 ◽  
Vol 37 (03) ◽  
pp. 2050009
Author(s):  
Naoto Katayama

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