The Capacitated p-Median Problem (CPMP) is an important topic within the Logistics and Supply Chain Management fields. Because the CPMP is of NP-hard complexity, heuristic algorithms are the best suitable methods to provide feasible (or near optimal) solutions for this problem. In this paper an algorithm is proposed to provide solutions for the CPMP. This approach considers the formulation of the VRP (Vehicle Routing Problem) as basis for the CPMP. The results provide an insight about the implications of this assumption.
Supply Chain Management
Heuristic for the Capacitated p-Median Problem under a CVRP Approach
39 views
2 Downloads