IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Multi Depot Probabilistic Vehicle Routing Problems with a Time Window: Theory, Solution and Application

Multi Depot Probabilistic Vehicle Routing Problems with a Time Window: Theory, Solution and Application
View Sample PDF
Author(s): Sutapa Samanta (Maryland State Highway Administration, USA)and Manoj K. Jha (Morgan State University, USA)
Copyright: 2013
Pages: 23
Source title: Geographic Information Systems: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-4666-2038-4.ch053

Purchase

View Multi Depot Probabilistic Vehicle Routing Problems with a Time Window: Theory, Solution and Application on the publisher's website for pricing and purchasing information.

Abstract

Vehicle Routing Problems (VRPs) are prevalent in all large pick up and delivery logistics systems and are critical to city logistics operations. Of notable significance are three key extensions to classical VRPs: (1) multi-depot scenario; (2) probabilistic demand; and (3) time-window constraints, which are considered simultaneously with VRPs in this paper. The issue then becomes a Multi Depot Probabilistic Vehicle Routing Problem with a Time Window (MDPVRPTW). The underlying complexities of MDPVRPTW are analyzed and a heuristic approach is presented to solve the problem. Genetic algorithms (GAs) are found to be capable of providing an efficient solution to the so-called MDPVRPTW. Within the GAs, two modification operators namely, crossover and mutation, are designed specially to solve the MDPVRPTW. Three numerical examples with 14, 25, and 51 nodes are presented to test the efficiency of the algorithm as the problem size grows. The proposed algorithms perform satisfactorily and the limiting case solutions are in agreement with the constraints. Additional work is needed to test the robustness and efficiency of the algorithms as the problem size grows.

Related Content

Salwa Saidi, Anis Ghattassi, Samar Zaggouri, Ahmed Ezzine. © 2021. 19 pages.
Mehmet Sevkli, Abdullah S. Karaman, Yusuf Ziya Unal, Muheeb Babajide Kotun. © 2021. 29 pages.
Soumaya Elhosni, Sami Faiz. © 2021. 13 pages.
Symphorien Monsia, Sami Faiz. © 2021. 20 pages.
Sana Rekik. © 2021. 9 pages.
Oumayma Bounouh, Houcine Essid, Imed Riadh Farah. © 2021. 14 pages.
Mustapha Mimouni, Nabil Ben Khatra, Amjed Hadj Tayeb, Sami Faiz. © 2021. 18 pages.
Body Bottom