This paper presents a variant of the vehicle routing problem (VRP) that combines several constraints. This variant addresses the pickup and delivery problem (PDP), the use of multiple vehicles (m), the multi- depots (MD) and the time constraint (TW): m-MDPDPTW. In the m-MDPDPTW, one should build a route made up of several pairs (customer / supplier), which starts and ends at the same depot and respects the precedence and capacity constraints. For solving this problem, two approaches based on particle swarms are proposed with a view to minimizing the total distance travelled by all vehicles. The results yielded by these two algorithms, the continuous PSO and the discrete PSO, are then compared by making use of the benchmarks generated by Li and Lim.
*This research work is an extension of a former paper entitled “A Comparative Study of the PSO and GA for the m-MDPDPTW” published in the International Journal of Computers Communications & Control, ISSN 1841-9836, 13(1), 8-23, February 2018. The novelty and originality of this article lies in the fact that the current research uses discrete PSO. The research results of the study have been compared using continuous and discrete PSO.
Pick-up and delivery problem, Multi-depots, Multiple vehicles, Optimization, Particle Swarm.
Imen Harbaoui DRIDI, Essia Ben ALAÏA, Pierre BORNE, Hanen BOUCHRIHA, "Optimization of m-MDPDPTW Using the Continuous and Discrete PSO*", Studies in Informatics and Control, ISSN 1220-1766, vol. 28(3), pp. 289-298, 2019. https://doi.org/10.24846/v28i3y201905
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).