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

Handayani, Naniek Utami; Mustikasari, Anita

doi:10.46254/AN07.20170455

Supply Chain Management

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

45 views 2 Conference

Naniek Utami Handayani Department of Industrial Engineering, Diponegoro University

Anita Mustikasari Department of Management Yogyakarta State University

Download PDF

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 Conferences April 11–13, 2017

ISBN 978-0-9855497-6-3

ISSN/E-ISSN 2169-8767

Menu

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