A large neighborhood search heuristic for supply chain network design

Abstract : Many exact and approximate solution techniques have been used to solve facility location problems and, more generally, supply chain network design problems. Yet, the Large Neighborhood Search technique (LNS) has almost never been suggested for solving such problems, although it has proven its efficiency and flexibility in solving other complex combinatorial optimization problems. In this paper, we propose an LNS framework for solving a four-layer single period multi-product supply chain network design problem. One important feature of the model is that it includes inter-modality: the itinerary followed by the cargo from origin to destination may take several transportation modes. Moreover, several modes may compete on some arcs. Location decisions for intermediate facilities (e.g. plants and distribution centers) are determined by the LNS while transportation modes and product flow decisions are determined by a greedy heuristic. As a post-optimization step, linear programming is used to optimize product flows once the structure of the logistics network is fixed. Extensive experiments, based on randomly generated instances of different sizes and characteristics, show the effectiveness of the method compared with a state-of-the-art solver.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2017, 80, pp.23-37. <10.1016/j.cor.2016.11.012>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01433630
Contributeur : Olivier Péton <>
Soumis le : jeudi 12 janvier 2017 - 18:21:25
Dernière modification le : mardi 22 août 2017 - 14:59:56

Identifiants

Collections

Citation

Majid Eskandarpour, Olivier Péton, Pierre Dejax. A large neighborhood search heuristic for supply chain network design. Computers and Operations Research, Elsevier, 2017, 80, pp.23-37. <10.1016/j.cor.2016.11.012>. <hal-01433630>

Partager

Métriques

Consultations de la notice

261