Locating Collection and Delivery Points Using the p -Median Location Problem

Snežana Tadić, Mladen Krstić, Željko Stević () and Miloš Veljović
Additional contact information
Snežana Tadić: Faculty of Transport and Traffic Engineering, University of Belgrade, 11000 Beograd, Serbia
Mladen Krstić: Faculty of Transport and Traffic Engineering, University of Belgrade, 11000 Beograd, Serbia
Željko Stević: Faculty of Transport and Traffic Engineering Doboj, University of East Sarajevo, 71123 Lukavica, Bosnia and Herzegovina
Miloš Veljović: Faculty of Transport and Traffic Engineering, University of Belgrade, 11000 Beograd, Serbia

Logistics, 2023, vol. 7, issue 1, 1-17

Abstract: Background : Possible solutions to overcome the many challenges of home delivery are collection and delivery points (CDPs). In addition to commercial facilities, the role of CDPs can also be played by users’ households, providing a crowd storage service. Key decisions regarding CDPs relate to their location, as well as the allocation of users to selected locations, so that the distance of users from CDPs is minimal. Methods : In this paper, the described problem is defined as a p -median problem and solved for the area of the city of Belgrade, using the heuristic “greedy” and the simulated annealing algorithm. Results : Fifty locations of CDPs were selected and the users allocated to them were distributed in over 950 zones. The individual distances between users and the nearest CDPs and the sum of these distances, multiplied by the number of requests, were obtained. An example of modification of the number of CDPs is presented as a way of obtaining solutions that correspond to different preferences of operators and/or users in terms of their distances from the CDPs. Conclusions : User households can be used as CDPs to achieve various benefits. Locating CDPs, i.e., selecting households, can be solved as a p -median problem, using a combination of heuristic and metaheuristic algorithms. In addition, by modifying the number of medians, the total and average distances between users and CDPs can be better managed. The main contributions of the paper are the establishment of users’ households as potential locations of CDPs, the establishment of a framework for analysis of impact of the number of CDPs on the sum and average distances from the customers, as well as the creation of a basis for upgrading and modifying the model for implementation in the business practice.

Keywords: home delivery; collection and delivery points (CDPs); households; locating; p -median; “greedy” heuristics; simulated annealing; crowd logistics (search for similar items in EconPapers)
JEL-codes: L8 L80 L81 L86 L87 L9 L90 L91 L92 L93 L98 L99 M1 M10 M11 M16 M19 R4 R40 R41 R49 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2305-6290/7/1/10/pdf (application/pdf)
https://www.mdpi.com/2305-6290/7/1/10/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jlogis:v:7:y:2023:i:1:p:10-:d:1058811

Access Statistics for this article

Logistics is currently edited by Ms. Mavis Li

More articles in Logistics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().