AbstractThis 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.
The capacitated plant location problem with customers and suppliers matching
Transportation Research Part E: Logistics and Transportation Review ; 46 , 3 ; 469-480
2009-09-03
12 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The capacitated plant location problem with customers and suppliers matching
Online Contents | 2010
|Capacitated Centralized Carrier Collaboration Multihub Location Problem
Transportation Research Record | 2014
|Reliable capacitated facility location problem with service levels
Online Contents | 2018
|Battery swap station location-routing problem with capacitated electric vehicles
Tema Archiv | 2015
|