Next Article in Journal
A Poisson Process-Based Random Access Channel for 5G and Beyond Networks
Previous Article in Journal
Improved Predictive Ability of KPLS Regression with Memetic Algorithms
Article

An Efficient Algorithm for Crowd Logistics Optimization

1
Computer Science and Statistics Department, Universidad Rey Juan Carlos, Tulipán s/n, Móstoles, 28933 Madrid, Spain
2
Department of Economics, Quantitative Methods and Economic History, Universidad Pablo de Olavide, Ctra. de Utrera km 1, 41013 Sevilla, Spain
3
Department of Economics, Quantitative Methods and Economic History, Universidad Rey Juan Carlos, Tulipán s/n, Móstoles, 28933 Madrid, Spain
*
Author to whom correspondence should be addressed.
Academic Editor: Fabio Caraffini
Mathematics 2021, 9(5), 509; https://doi.org/10.3390/math9050509
Received: 27 January 2021 / Revised: 18 February 2021 / Accepted: 23 February 2021 / Published: 2 March 2021
(This article belongs to the Section Mathematics and Computer Science)
Crowd logistics is a recent trend that proposes the participation of ordinary people in the distribution process of products and goods. This idea is becoming increasingly important to both delivery and retail companies, because it allows them to reduce their delivery costs and, hence, to increase the sustainability of the company. One way to obtain these reductions is to hire external drivers who use their own vehicles to make deliveries to destinations which are close to their daily trips from work to home, for instance. This situation is modelled as the Vehicle Routing Problem with Occasional Drivers (VRPOD), which seeks to minimize the total cost incurred to perform the deliveries using vehicles belonging to the company and occasionally hiring regular citizens to make just one delivery. However, the integration of this features into the distribution system of a company requires a fast and efficient algorithm. In this paper, we propose three different implementations based on the Iterated Local Search algorithm that are able to outperform the state-of-art of this problem with regard to the quality performance. Besides, our proposal is a light-weight algorithm which can produce results in small computation times, allowing its integration into corporate information systems. View Full-Text
Keywords: vehicle routing problem; crowd logistics; crowdshipping; occasional drivers; iterated local search vehicle routing problem; crowd logistics; crowdshipping; occasional drivers; iterated local search
Show Figures

Figure 1

MDPI and ACS Style

Martín-Santamaría , R.; López-Sánchez , A.D.; Delgado-Jalón , M.L.; Colmenar , J.M. An Efficient Algorithm for Crowd Logistics Optimization. Mathematics 2021, 9, 509. https://doi.org/10.3390/math9050509

AMA Style

Martín-Santamaría  R, López-Sánchez  AD, Delgado-Jalón  ML, Colmenar  JM. An Efficient Algorithm for Crowd Logistics Optimization. Mathematics. 2021; 9(5):509. https://doi.org/10.3390/math9050509

Chicago/Turabian Style

Martín-Santamaría , Raúl, Ana D. López-Sánchez , María L. Delgado-Jalón , and J. M. Colmenar  2021. "An Efficient Algorithm for Crowd Logistics Optimization" Mathematics 9, no. 5: 509. https://doi.org/10.3390/math9050509

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop