American Journal of Operations Research

Volume 7, Issue 1 (January 2017)

ISSN Print: 2160-8830   ISSN Online: 2160-8849

Google-based Impact Factor: 1.72  Citations  

Development of an Efficient Genetic Algorithm for the Time Dependent Vehicle Routing Problem with Time Windows

HTML  XML Download Download as PDF (Size: 1055KB)  PP. 1-25  
DOI: 10.4236/ajor.2017.71001    1,984 Downloads   4,646 Views  Citations

ABSTRACT

This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, based on the traffic conditions. During the periods of peak traffic hours, the vehicles travel at low speeds and during non-peak hours, the vehicles travel at higher speeds. A survey by TCI and IIM-C (2014) found that stoppage delay as percentage of journey time varied between five percent and 25 percent, and was very much dependent on the characteristics of routes. Costs of delay were also estimated and found not to affect margins by significant amounts. This study aims to overcome such problems arising out of traffic congestions that lead to unnecessary delays and hence, loss in customers and thereby valuable revenues to a company. This study suggests alternative routes to minimize travel times and travel distance, assuming a congestion in traffic situation. In this study, an efficient GA-based algorithm has been developed for the TDVRP, to minimize the total distance travelled, minimize the total number of vehicles utilized and also suggest alternative routes for congestion avoidance. This study will help to overcome and minimize the negative effects due to heavy traffic congestions and delays in customer service. The proposed algorithm has been shown to be superior to another existing algorithm in terms of the total distance travelled and also the number of vehicles utilized. Also the performance of the proposed algorithm is as good as the mathematical model for small size problems.

Share and Cite:

Kumar, S. and Panneerselvam, R. (2017) Development of an Efficient Genetic Algorithm for the Time Dependent Vehicle Routing Problem with Time Windows. American Journal of Operations Research, 7, 1-25. doi: 10.4236/ajor.2017.71001.

Cited by

[1] Minimisation of the Energy Expenditure of Electric Vehicles in Municipal Service Companies, Taking into Account the Uncertainty of Charging Point Operation
Energies, 2024
[2] 有禁飞区的时间依赖型车辆与无人机协同配送路径优化.
Control Theory & Applications …, 2024
[3] An innovative medical waste management system in a smart city using XAI and vehicle routing optimization
F1000Research, 2023
[4] A genetic algorithm-based artificial intelligence solution for optimizing E-commerce logistics vehicle routing
Artificial Intelligence (AI), 2021
[5] Ship Routing Using Genetic Algorithms
Operations Research Forum, 2021
[6] Congestion and Pollution, Vehicle Routing Problem of a Logistics Provider in Thailand
2019
[7] Harmony search algorithm for time-dependent vehicle routing problem with time windows
2019
[8] Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations
2019
[9] Increasing the Performance of Genetic Algorithm by Using Different Selection: Vehicle Routing Problem Cases
2018
[10] Study of Crossover operators of Genetic Algorithm& Development of New Crossover Operator to Solve Heterogeneous Vehicle Routing Problem with Time Windows
International Journal of Production Technology and Management, 2018
[11] Study of Crossover operators of Genetic Algorithm& Development of New Crossover Operator to Solve Heterogeneous Vehicle Routing Problem with Time …
2018
[12] Ship Routing Optimization Among Brics...
2018
[13] Comparison of GA-Shift Neighbourhood Mutation and GA-Pairs Exchange Mutation with Multi Cut Point Crossover in Solving RICH-VRP
2018

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.