Computer Science ›› 2014, Vol. 41 ›› Issue (3): 218-222.

Previous Articles     Next Articles

Vehicle Routing Algorithm Based on Spatiotemporal Clustering

QI Ming-yao,ZHANG Jin-jin and REN Li   

  • Online:2018-11-14 Published:2018-11-14

Abstract: A route improvement method that considers spatial and temporal features simultaneously was proposed to solve vehicle routing problem with time windows.A spatiotemporal representation of vehicle routes was presented to measure the spatiotemporal distance between two customers.Then,a genetic algorithm was designed to cluster the customers into a few groups according to spatiotemporal distances.The resulting customer groups were then used for route adjustment:if a customer was moved to another route,only the nearby routes were searched and considered.By this means the search space is dramatically reduced.The calculation on 1000-customer examples designed by Gehring and Homberger shows that the proposed algorithm can get better solution in shorter time.

Key words: Vehicle routing problem,Time windows,Spatiotemporal distance,Clustering analysis,Genetic algorithm,Variable neighborhood search

[1] Dantzig G B,Ramser J H.The Truck Dispatching Problem [J].Management Science,1959,6:80-91
[2] Laporte G.What you should know about the vehicle routingproblem [J].Naval Research Logistics,2007,54:811-819
[3] Brysy O,Gendreau M.Vehicle Routing Problem,Part I:Route Construction and Local Search Algorithms [J].Transportation Science,2005,39(1):104-118
[4] Brysy O,Gendreau M.Vehicle Routing Problem with TimeWindows,Part II:Metaheuristics [J].Transportation Science,2005,39(1):119-139
[5] Gendreau M,Tarantilis C D.Solving large-scale vehicle routing problems with time windows:the state-of-the-art[R].Technical report 2010-04.CIRRELT,Montreal,QC,Canada,2010
[6] Mladenovic N,Hansen P.Variable neighborhood search [J].Computers and Operations Research,1997,24:1097-1100
[7] Ganesh K,Narendran T T.CLOVES:A Cluster-and-searchHeuristic to Solve the Vehicle Routing Problem with Delivery and Pick-up [J].European Journal of Operational Research,2007,178(3):699-717
[8] Ostertag L,Doerner K F,Hart R F.A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems[C]∥Proceedings of the 5th International Workshop on Hybrid Meta-heuristics,2008.Málaga,Spain,2008:29-42
[9] Vidal T,Crainic T G,Gendreau M,et al.A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows[J].Computers & Operations Research,2013,40:475-489
[10] Hgerstrand T.What about people in regional science[C]∥Papers and proceedings of the regional science association.1970,24:7-21
[11] Kwan M P,Murray A T,O′Kelly,et al.Recent Advances in Accessibility Research:Representation,Methodology and Applications[J].Journal of Geographical Systems,2003,5:129-138
[12] Lucasius C B,Dane A D,Kateman G.On K-medoid Clustering of Large Data Sets with the Aid of a Genetic Algorithm:Background,Feasibility and Comparison [J].Analytica Chimica Acta,1993,282(3):647-669
[13] Solomon M.Algorithms for the vehicle routing and scheduling problems with time window constraints [J].Operations Research,1987,35(2):254-265
[14] Gehring H,Homberger J.Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows [J].Journal of Heuristics,2002,8(3):251-276

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!