|
|||||
|
|
The capacitated plant location problem with customers and suppliers matching |
|
| Authors: | Zhanguo Zhu Feng Chu Linyan Sun |
| Institution: | 1. School of Management, Xi’an Jiaotong University, Xi’an 710049, China;2. Université de technologie de Troyes, Institut Charles Delaunay, FRE CNRS 2848, Laboratoire d’optimisation des systèmes industriels (LOSI), 12 rue Marie Curie, BP 2060, 10010 Troyes Cedex, France;3. Laboratoire d’informatique, biologie intégrative et systèmes complexes (IBISC), FRE CNRS 3190, Université d’Evry Val d’Essonne, 40 Rue du Pelvoux, CE1455 Courcouronnes, 91020 Evry Cedex, France;4. State Key Laboratory for Mechanical Manufacturing Systems Engineering, Xi’an 710049, China |
| Abstract: | 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. We 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. We 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. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |