Leveraging saving-based algorithms by masterslave genetic algorithms

Engineering Applications of Artificial Intelligence

Volumn 24, Issue 4, 2011, Pages 555-566

  Battarra, Maria ^a   Benedettini, Stefano ^b   Roli, Andrea ^b  

^a KADIR HAS UNIVERSITY   (Turkey)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Clarke and Wright algorithm; Esau Williams algorithm; Genetic algorithms; Heuristic algorithms; Saving based algorithms

Indexed keywords

CLARKE AND WRIGHT ALGORITHM; COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORIAL PROBLEM; CONSTRUCTION PROCEDURES; LEVEL ALGORITHMS; MASTER-SLAVE; SAVING-BASED ALGORITHMS; WILLIAMS;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS;

HEURISTIC ALGORITHMS;

EID: 79953648104     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2011.01.007     Document Type: Article

References (52)

1. R.K. Ahuja, J.B. Orlin, and D. Sharma A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem Operations Research Letters 31 2003 185 194
2. Amberg, A., Domschke, W., Voss, S., 1996. Capacitated minimum spanning trees: algorithms using intelligent search. In: Combinatorial Optimization: Theory and Practice, pp. 939.
3. Augerat, P., Belenguer, J.M., Benavent, E., Corberan, A., Naddef, D., Rinaldi, G., 1995. Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report RR 949-M, University Joseph Fourier, Grenoble, France.
4. R. Baldacci, and A. Mingozzi A unified exact method for solving different classes of vehicle routing problems Mathematical Programming 120 2009 347 380
5. R. Baldacci, M. Battarra, and D. Vigo Routing a Heterogeneous Fleet of Vehicles 2008 Springer US (Chapter 1, pp. 327)
6. M. Battarra, B.L. Golden, and D. Vigo Tuning a parametric ClarkeWright heuristic for vehicle routing through a genetic algorithm Journal of the Operational Research Society 59 2008 1568 1572
7. Battarra, M., Öncan, T., Altιnel, K.., Golden, B., Vigo, D., Phillips, E., in press. An evolutionary approach for tuning parametric Esau and Williams heuristics. Journal of the Operational Research Society.
8. S.V. Begur, D.M. Miller, and J.R. Weaver An integrated spatial DSS for scheduling and routing home-health-care nurses Interfaces 27 1997 35 48
9. S. Cetinkaya, H. Uster, G. Easwaran, and B.B. Keskin An integrated outbound logistics model for Frito-lay: coordinating aggregate-level production and distribution decisions Interfaces 39 2009 460 475
10. Y. Chan, and S.F. Baker The multiple depot, multiple traveling salesmen facility-location problem: vehicle range, service frequency, and heuristic implementations Mathematical and Computer Modelling 41 2005 1035 1053 (Pubitemid 41140292)
11. K.W. Chau A two-stage dynamic model on allocation of construction facilities with genetic algorithm Automation in Construction 13 2004 481 490
12. N. Christofides, and S. Eilon An algorithm for the vehicle routing dispatching problem Operational Research Quarterly 20 1969 309 318
13. N. Christofides, A. Mingozzi, and P. Toth The vehicle routing problem N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Combinatorial Optimization 1979 Wiley Chichester
14. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
15. W.J. Conover Practical Nonparametric Statistics third ed. 1999 John Wiley & Sons
16. A. Corominas, A. Garcia-Villoria, and R. Pastor Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) Journal of the Operational Research Society 61 2010 1309 1314
17. Daskin, M.S., 2002. Private communication.
18. M.C. de Souza, C. Duhamel, and C.C. Ribeiro A grasp heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy Metaheuristics: computer decision-making 2004 Kluwer Academic Publishers Norwell, MA, USA 627 657
19. T. Doyuran, and B. Catay A robust enhancement to the ClarkeWright savings algorithm Journal of the Operational Research Society 62 2011 223 231
20. E.E. El-Araby, N. Yorino, and H. Sasaki A two level hybrid ga/slp for facts allocation problem considering voltage security International Journal of Electrical Power & Energy Systems 25 2003 327 335 (Pubitemid 35459670)
21. E. Erkut, T. Myroon, and K. Strangway Transalta redesigns its service-delivery network Interfaces 30 2000 54 69
22. L.R. Esau, and K.C. Williams On teleprocessing system design IBM Systems Journal 5 1966 142 147
23. J. Faulin, P. Sarobe, and J. Simal The DSS LOGDIS optimizes delivery routes for FRILAC's frozen products Interfaces 35 2005 202 214 (Pubitemid 43093097)
24. Faulin, J., Gilibert, M., Juan, A.A., Vilajosana, X., Ruiz, R., 2008. Sr-1: a simulation-based algorithm for the capacitated vehicle routing problem. In: WSC '08: Proceedings of the 40th Conference on Winter Simulation. Winter Simulation Conference, pp. 27082716.
25. Fleischmann, B., 1990. The vehicle routing problem with multiple use of vehicles. Technical report, Fachbereich Wirschaftswissenschaften, Universitat Hamburg.
26. Y. Gajpal, and P. Abad Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery Journal of the Operational Research Society 61 2010 1498 1509
27. T.J. Gaskell Bases for vehicle fleet scheduling Operational Research Quarterly 18 1967 281 295
28. C.A. Georgopoulou, and K.C. Giannakoglou Two-level two-objective evolutionary algorithms for solving unit commitment problems Applied Energy 86 2009 1229 1239
29. B.L. Golden, T.L. Magnanti, and H.Q. Nguyen Implementing vehicle routing algorithms Networks 2 1977 113 148
30. B.L. Golden, A.A. Assad, L. Levy, and F. Gheysens The fleet size and mix vehicle routing problem Computers & Operations Research 11 1984 49 66 (Pubitemid 14486847)
31. M. Gronalt, R.F. Hartl, and M. Reimann New savings based algorithms for time constrained pickup and delivery of full truckloads European Journal of Operational Research 151 2003 520 535
32. Husband, P., Mill, F., 1991. Simulated coevolution as the mechanism for emergent planning and scheduling. In: Belew, R., Booker, L. (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 264270.
33. Jothi, R., Raghavachari, B., 2004. Revisiting EsauWilliams' algorithm: on the design of local access networks. In: Proceedings 7th INFORMS Telecommunications Conference (Telecom), Boca Raton, Florida, pp. 104107.
34. Juan, A.A., Faulin, J., Jorba, J., Riera, D., Masip, D., Barrios, B., 2010. On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics. Journal of the Operational Research Society, published online, doi: 10.1057/jors.2010.29.
35. G. Kant, M. Jacks, and C. Aantjes Coca-cola enterprises optimizes vehicle routes for efficient product delivery Interfaces 38 2008 40 50
36. A. Khajavirad, J. Michalek, and T. Simpson An efficient decomposed multiobjective genetic algorithm for solving the joint product platform selection and product family design problem with generalized commonality Structural and Multidisciplinary Optimization 39 2009 187 201
37. P. Lacomme, C. Prins, and W. Ramdane-Cherif Evolutionary algorithms for periodic arc routing problems European Journal of Operational Research 165 2005 535 553 (Pubitemid 40206381)
38. H.R.G. Van Landeghem A bi-criteria heuristic for the vehicle routing problem with time windows European Journal of Operational Research 36 1988 217 226 (Pubitemid 18650928)
39. G. Laporte, M. Gendreau, J.-Y. Potvin, and F. Semet Classical and modern heuristics for the vehicle routing problem International Transactions in Operational Research 7 2000 285 300
40. Y.-J. Lee, and M. Atiquzzaman Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem Computer Communications 28 2005 1371 1379 (Pubitemid 40822794)
41. T. Öncan, and I.K. Altnel Parametric enhancements of the EsauWilliams heuristic for the capacitated minimum spanning tree problem Journal of the Operational Research Society 60 2009 259 267
42. T. Öncan, and K. Altnel A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem Journal of the Operational Research Society 56 2005 954 961 (Pubitemid 41028656)
43. C.H. Papadimitriou The complexity of the capacitated tree problem Networks 8 1978 217 230
44. R. Patterson, and H. Pirkul Heuristic procedure neural networks for the CMST problem Computers and Operations Research 27 2000 1171 1200 (Pubitemid 30398144)
45. R. Patterson, H. Pirkul, and E. Rolland A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem Journal of Heuristics 5 1999 159 180
46. M.A. Potter, and K.A. De Jong Cooperative coevolution: an architecture for evolving coadapted subcomponents Evolutionary Computation 8 1 2000 1 29
47. R. Santiago-Mozos, S. Salcedo-Sanz, M. DePrado-Cumplido, and C. Bousoo-Calzón A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a spanish university Computers & Operations Research 32 2005 1761 1776
48. V. Shestak, E.K.P. Chong, H.J. Siegel, A.A. Maciejewski, L. Benmohamed, I.-J. Wang, and R. Daley A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems Journal of Parallel and Distributed Computing 68 2008 410 426 (Pubitemid 351296389)
49. P. Toth, and D. Vigo The Vehicle Routing Problem 2001 SIAM Philadelphia, PA
50. E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi da Aragão, and D. Andrade Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation Mathematical Programming, Series A 112 2008 443 472 (Pubitemid 350202448)
51. J. Yang, M. Zhang, B. He, and C. Yang Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice Computers & Mathematics with Applications 57 2009 1985 1994
52. P. Yellow A computational modification to the savings method of vehicle scheduling Operational Research Quarterly 21 1970 281 283