Paper Info
Title
Application of Genetic Algorithms to Solve the Multidepot Vehicle Routing Problem
Abstract
This paper deals with the optimization of vehicle routing problem in which multiple depots, multiple customers, and multiple products are considered. Since the total traveling time is not always restrictive as a time window constraint, the objective regarded in this paper comprises not only the cost due to the total traveling distance, but also the cost due to the total traveling time. We propose ...
Year
DOI
Venue
2010
10.1109/TASE.2009.2019265
IEEE Transactions on Automation Science and Engineering
Keywords
Field
DocType
Genetic algorithms,Vehicles,Routing,Fuzzy logic,Costs,Search methods,Time factors,Stochastic processes,Genetic mutations,Simulated annealing
Simulated annealing,Branch and bound,Vehicle routing problem,Mathematical optimization,Search algorithm,Computer science,Fuzzy logic,Algorithm,Integer programming,Genetic algorithm,Tabu search
Journal
Volume
Issue
ISSN
7
2
1545-5955
Citations 
PageRank 
References 
19
0.97
20
Authors
4
Name
Order
Citations
PageRank
Henry C. W. Lau130133.27
T. M. Chan2190.97
W. T. Tsui3634.83
W. K. Pang4212.07