7th Annual International Conference on Industrial Engineering and Operations Management

Heuristic for the Capacitated p-Median Problem under a CVRP Approach

Santiago-Omar Caballero-Morales & Abdur Rahim
Publisher: IEOM Society International
0 Paper Citations
1 Views
1 Downloads
Track: Supply Chain Management
Abstract

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.

Published in: 7th Annual International Conference on Industrial Engineering and Operations Management, Rabat, Morocco

Publisher: IEOM Society International
Date of Conference: April 11-13, 2017

ISBN: 978-0-9855497-6-3
ISSN/E-ISSN: 2169-8767