The capacitated plant location problem with customers and suppliers matching

Zhanguo Zhu (1, 2) , Feng Chu (3) , Linyan Sun (1)

1 Xjtu - Xi'an Jiaotong University
2 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
3 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes

This paper introduces a new problem called the capacitated plant location problem with customer and supplier matching (CLCSM). The product distribution from plants to customers and the material supply from suppliers to plants are considered together. The authors merge a distribution trip and a supply trip into one triangular trip for saving allocation cost. Vehicles from plants visit a customer and a supplier for each trip. The authors provide a heuristic solution procedure based on Lagrangian relaxation. Computational results indicate that the proposed heuristic solution procedure is shown to be efficient yielding optimal or near-optimal solutions for randomly generated instances.

Mots clés: Lagrangian relaxation; Plant location; Integer linear programming; Matching

Domaines: Recherche opérationnelle [math.OC]

Zhanguo Zhu, Feng Chu, Linyan Sun. The capacitated plant location problem with customers and suppliers matching. Transportation Research Part E: Logistics and Transportation Review, 2010, 46 (3), pp.469-480. ⟨10.1016/j.tre.2009.09.002⟩. ⟨hal-00645146⟩