A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows

Applied Soft Computing Journal

Volumn 10, Issue 1, 2010, Pages 53-65

  Ghoseiri, Keivan ^a,b   Ghannadpour, Seyed Farid ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Interchange mechanism; Cluster first route second approach; Genetic algorithm; Locomotive assignment with time windows; Push Forward Insertion Heuristic (PFIH)

Indexed keywords

ASSIGNMENT PROBLEMS; CLUSTER-FIRST ROUTE-SECOND APPROACH; HYBRID GENETIC ALGORITHMS; INITIAL SOLUTION; INTERCHANGE MECHANISM; NEIGHBORHOOD SEARCH; NUMERICAL EXAMPLE; POLYNOMIAL-TIME; PUSH FORWARD INSERTION HEURISTIC; PUSH FORWARD INSERTION HEURISTIC (PFIH); TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

CLUSTERING ALGORITHMS; ENGINES; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTERCHANGES; LOCOMOTIVES; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; RAILROAD CARS; ROUTING ALGORITHMS; SET THEORY; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING; WINDOWS;

PROBLEM SOLVING;

EID: 70350105167     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2009.06.004     Document Type: Article

References (42)

1. Achutan N., Caccettal L., and Hill S. An improved branch-and-cut algorithm for the capacitated vehicle routing problem. Transportation Science 37 (2003) 153-169
2. Ahuja R.K., Liu J., Orlin J.B., Sharma D., and Shughart L.A. Solving real-life locomotive scheduling problems. Transportation Science 39 (2005) 503-517
3. Alvarenga G.B., Mateus G.R., and de Tomi G. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computers & Operation Research 34 (2007) 1561-1584
4. Berger J., and Barkaoui M. A hybrid genetic algorithm for the capacitated vehicle routing problem. Proc. GECCO03 (2003), Springer-Verlag 646-656
5. J. Berger, M. Barkaoui, O. Bräysy, A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows, Working paper, Defense Research Establishment Valcartier, Canada, 2001.
6. Bodin L., Golden B., Assad A., and Ball M. Routing and scheduling of vehicles and crew: the state of the art. Computers & Operations Research 10 (1983) 63-211
7. Bräysy O., and Gendreau M. Metaheuristics for the vehicle routing problem with time windows, SINTEF applied mathematics. Research Council of Norway (2001)
8. Brannlund V., Lindberg P.O., Nou A., and Nilsson J.E. Railway timetabling using langrangian relaxation. Transportation Science 32 (1998) 358-369
9. P. Brucker, J. Hurink, T. Rolfes, Routing of Railway Carriages: A Case Study, Technical Report 1498, University of Twente, Holland, 1999.
10. Cerda J., and Dondo R. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research 176 (2007) 1478-1507
11. Cordeau J.F., Desauliniers G., Lingaya N., Soumis F., and Desrosiers J. Simultaneous locomotive and car assignment at VIA Rail Canada. Transportation Research Part B 35 (2001) 767-787
12. Cordeau J.F., Soumins F., and Desrosiers J. Simultaneous assignment of locomotives and cars to passenger trains. Operation Research 49 (2001) 531-548
13. Cordeau J.F., Soumins F., and Desrosiers J. A Bender decomposition approach for the locomotive and car assignment problem. Transportation Science 34 (2000) 133-149
14. Cordeau J.F., Toth P., and Vigo D. A survey of optimization models for train and scheduling. Transportation Science 32 (1998) 988-1005
15. Crevier B., Cordeau J.F., and Laporte G. The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research 176 (2007) 756-773
16. Czech Z.J., and Czarnas P. Parallel simulated annealing for the vehicle routing problem with time windows. Proc. 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing (2002) 376-383
17. Fioole P.J., Kroon L., Maroti G., and Schrijver A. A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operation Research 174 (2006) 1281-1297
18. Florian M., Bushell G., Ferland J., Guerin G., and Nastansky L. The engine scheduling problem in a railway network. INFOR 14 (1976) 121-138
19. Forbes M.A., Holt J.N., and Walts A.M. Exact solution of locomotive scheduling problem. Journal of the Operation Research Society 42 (1991) 825-831
20. Gambardella L.M., Taillard E., and Agazzi G. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D., Dorigo N., and Glover F. (Eds). New Ideas in Optimization (1999), McGraw-Hill 63-76
21. M. Gendreau, G. Laporte, J.Y. Potvin, Metaheuristics for the Vehicle Routing Problem, Technical Report CRT-963, Centre de Recherche sur les Transports, Université de Montréal, 1999.
22. Giosa D., Tansini L., and Viera O. New assignment algorithms for the multi-depot vehicle routing problem. Journal of the Computational Research Society 53 (2002) 977-984
23. Holland J.H. Adaptation in Natural and Artificial System (1975), The University of Michigan Press
24. Irnich S., Funke B., and Grunert T. Sequential search and its application to vehicle routing problems. Computers & Operations Research 33 (2006) 2405-2429
25. Kim B.I., Kim S., and Sahoo S. Waste collection vehicle routing problem with time windows. Computers & Operations Research 33 (2006) 3624-3642
26. G. Laporte, F. Semet, Classical Heuristics for the Vehicle Routing Problem, Les Cahiers du GERAD, G98-54, Group for Research in Decision Analysis, Montreal, Canada, 1999.
27. J. Larsen, Parallelization of the Vehicle Routing Problem with Time Windows, Ph.D. thesis, Department of Mathematical Modeling, Technical University of Denmark, Denmark, 1999.
28. Li F., Golden B., and Wasil E. Very large scale vehicle routing: new test problems algorithms and results. Computers & Operations Research 32 (2005) 1165-1179
29. Lingaya N., Cordeau J.F., Desaulniers G., Desrosiers J., and Soumis F. Operational car assignment at VIA Rail Canada. Transportation Research Part B 36 (2002) 755-778
30. Louis J., Yin X., and Yuan Z.Y. Multiple Vehicle Routing Problem with Time Windows using Genetic Algorithm, Genetic Adaptive System LAB (1999), Department Of Computer Science University of Nevada, Reno
31. Ombuki B., Ross B., and Hanshar F. Multi-objective genetic algorithm for vehicle routing problem with time windows. Applied Intelligence 24 (2006) 17-30
32. Pisinger D., and Ropke S. A general heuristic for vehicle routing problem. Computers & Operations Research 34 (2007) 2403-2435
33. Rouillon S., Desaulniers G., and Soumis F. An extended branch-and-bound method for locomotive assignment. Transportation Research Part B 40 (2006) 404-423
34. Solomon M.M. Algorithms for vehicle routing problem and scheduling problems with time window constraints. Operation Research 35 (1987) 254-365
35. Tan K.C., Cheong C.Y., and Goh C.K. Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. European Journal of Operational Research 177 (2007) 813-139
36. Tan K.C., Chew Y.H., and Lee L.H. A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Computational Optimization and Applications 34 (2006) 115-151
37. Tan K.C., Lee L.H., Zhu K.Q., and Qu K. Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering 15 (2001) 281-295
38. L. Tansini, O. Viera, Adapted Clustering Algorithms for the Assignment Problem in the MDVRPTW, Working paper, Institute of computation, Universidad de la Republica, Montevideo Uruguay, 2004.
39. S.R. Thangiah, Vehicle Routing with Time Windows using Genetic Algorithms, Technical Report SRU-CpSc-TR-93-23, Computer Science Department, Slippery Rock University, Slippery Rock, PA, 1993.
40. S.R. Thangiah, I.H. Osman, T. Sun, Hybrid Genetic Algorithm Simulated Annealing and Tabu Search Methods for Vehicle Routing Problem with Time Windows, Technical Report 27, Computer Science Department, Slippery Rock University, 1994.
41. Ziarati K., Soumis F., Desrosiers J., Gelinas S., and Saintonge A. Locomotive assignment with heterogeneous consists at CN North America. European Journal of Operation Research 97 (1997) 281-292
42. K.Q. Zhu, A New Genetic Algorithm for VRPTW, Working Paper, National University of Singapore, 2000.