Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems

References

• Ahmadi-Javid, A., Seddighi, A. H. 2012. A Location-Routing-Inventory Model for Designing Multisource Distribution Networks.. Engineering Optimization 44 (6): 637–656. doi: 10.1080/0305215X.2011.600756
   Web of Science ®Google Scholar
• Baldacci, R., Hadjiconstantinou, E., Mingozzi, A. 2004. An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formula.. Operations Research 52, 723–738. doi: 10.1287/opre.1040.0111
   Web of Science ®Google Scholar
• Bentley, J. L. 1992. Fast Algorithms for Geometric Traveling Salesman Problems.. ORSA Journal on Computing 4, 387–411. doi: 10.1287/ijoc.4.4.387
   Google Scholar
• Berger, J., Barkaoui, M. 2004. A New Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem.. Journal of the Operational Research Society 54, 1254–1262. doi: 10.1057/palgrave.jors.2601635
   Web of Science ®Google Scholar
• Chakroborty, P., Mandal, A. 2005. An Asexual Genetic Algorithm for the General Single Vehicle Routing Problem.. Engineering Optimization 37 (1): 1–27. doi: 10.1080/03052150410001721468
   Web of Science ®Google Scholar
• Chen, P., Huang, H. K., Dong, X. Y. 2010. Iterated Variable Neighborhood Descent Algorithm for the Capacitated Vehicle Routing Problem.. Expert Systems with Applications 37, 1620–1627. doi: 10.1016/j.eswa.2009.06.047
   Web of Science ®Google Scholar
• Cho, H.-S., Paik, C.-H., Yoon, H.-M., Kim, H.-G. 2005. A Robust Design of Simulated Annealing Approach for Mixed-Model Sequencing.. Computers and Industrial Engineering 48, 753–764. doi: 10.1016/j.cie.2004.12.005
   Web of Science ®Google Scholar
• Christofides, N., Eilon, S. 1969. An Algorithm for the Vehicle Dispatching Problem.. Operational Research Quarterly 20, 309–318. doi: 10.1057/jors.1969.75
   Google Scholar
• Cordeau, J.-F., Laporte, G., Mercier, A. 2001. A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows.. Journal of the Operational Research Society 52, 928–936. doi: 10.1057/palgrave.jors.2601163
   Web of Science ®Google Scholar
• Coy, S. P., Golden, B. L., Runger, G. C., Wasil, E. A. 1998. See the Forest Before the Trees: Fine-Tuned Learning and its Application to the Traveling Salesman Problem.. IEEE Transactions on Systems, Man, and Cybernetics 284, 454–464. doi: 10.1109/3468.686706
   Web of Science ®Google Scholar
• Dantzig, G. B., Ramser, J. H. 1959. The Truck Dispatching Problem.. Management Science 6, 80–91. doi: 10.1287/mnsc.6.1.80
   Web of Science ®Google Scholar
• Derigs, U., Kaiser, R. 2007. Applying the Attribute Based Hill Climber Heuristic to the Vehicle Routing Problem.. European Journal of Operational Research 177, 719–732. doi: 10.1016/j.ejor.2005.11.038
   Web of Science ®Google Scholar
• Ergun, O., Orlin, J. B., Steele-Feldman, A. 2006. Creating Very Large Scale Neighborhoods Out of Smaller Ones by Compounding Moves.. Journal of Heuristics 12, 115–140. doi: 10.1007/s10732-006-5561-5
   Web of Science ®Google Scholar
• Fathali, J., Kakhki, H. T. 2006. Solving the P-median Problem with Pos/Neg Weights by Variable Neighborhood Search and Some Results for Special Cases.. European Journal of Operational Research 170, 440–462. doi: 10.1016/j.ejor.2004.05.027
   Web of Science ®Google Scholar
• Fleszar, K., Osman, I. H., Hindi, K. S. 2009. A Variable Neighbourhood Search Algorithm for the Open Vehicle Routing Problem.. European Journal of Operational Research 195, 803–809. doi: 10.1016/j.ejor.2007.06.064
   Web of Science ®Google Scholar
• Golden, B. L., Wasil, E. A., Kelly, J. P., Chao, I.-M. 1998. The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results.. In Fleet Management and Logistics, edited by T. Crainic, G. Laporte 33–56. Boston: Kluwer.
   Google Scholar
• Hansen, P., Mladenovic, N. 1997. Variable Neighborhood Search for the P-median.. Location Science 5, 207–226. doi: 10.1016/S0966-8349(98)00030-8
   Google Scholar
• Hansen, P., Mladenovic, N. 2001. Variable Neighborhood Search: Principles and Applications.. European Journal of Operational Research 130, 449–467. doi: 10.1016/S0377-2217(00)00100-4
   Web of Science ®Google Scholar
• Hansen, P., Mladenovic, N. 2006. First vs. Best Improvement: An Empirical Study.. Discrete Applied Mathematics 154, 802–817. doi: 10.1016/j.dam.2005.05.020
   Web of Science ®Google Scholar
• Hansen, P., Mladenovic, N., Moreno-Perez, J. A. 2008a. Variable Neighborhood Search.. European Journal of Operational Research 191, 593–595. doi: 10.1016/j.ejor.2007.02.002
   Web of Science ®Google Scholar
• Hansen, P., Mladenovic, N., Moreno-Perez, J. A. 2008b. Variable Neighbourhood Search: Methods and Applications, 4OR-A.. Quarterly Journal of Operations Research 6, 319–360.
   Web of Science ®Google Scholar
• Hansen, P., Mladenovic, N., Moreno-Perez, J. A. 2010. Variable Neighbourhood Search: Methods and Applications.. Annals of Operations Research 175, 367–407. doi: 10.1007/s10479-009-0657-6
   Web of Science ®Google Scholar
• Hiquebran, D. T., Alfa, A. S., Shapiro, J. A., Gittoes, D. H. 1994. A Revised Simulated Annealing and Cluster-first route-second Algorithm Applied to the Vehicle Routing Problem.. Engineering Optimization 22, 77–107. doi: 10.1080/03052159308941327
   Web of Science ®Google Scholar
• Imran, A., Salhi, S., Wassan, N. A. 2009. A Variable Neighborhood-Based Heuristic for the Heterogeneous Fleet Vehicle Routing Problem.. European Journal of Operational Research 197, 509–518. doi: 10.1016/j.ejor.2008.07.022
   Web of Science ®Google Scholar
• Itoyama, H., Kozugata, H., Kawasima, H. 1995. The VRP Modeling and Simulated Annealing Algorithm.” [In Japanese.]. Joint Report of the Institute of Mathematical Statistics 77, 277–283.
   Google Scholar
• Kaku, I., Xiao, Y., Xia, G. 2003. The Deterministic Annealing Algorithms for Vehicle Routing Problems.. International Journal of Smart Engineering System Design 54, 327–339. doi: 10.1080/10255810390224080
   Google Scholar
• Kuo, Y., Wang, C. C. 2012. A Variable Neighborhood Search for the Multi-Depot Vehicle Routing Problem with Loading Cost.. Expert Systems with Applications 39, 6949–6954. doi: 10.1016/j.eswa.2012.01.024
   Web of Science ®Google Scholar
• Kytöjoki, J., Nuortio, T., Bräysy, O., Gendreau, M. 2007. An Efficient Variable Neighborhood Search Heuristic for Very Large Scale Vehicle Routing Problems.. Computers and Operations Research 34, 2743–2757. doi: 10.1016/j.cor.2005.10.010
   Web of Science ®Google Scholar
• Laporte, G. 1992. The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms.. European Journal of Operational Research 59, 345–358. doi: 10.1016/0377-2217(92)90192-C
   Web of Science ®Google Scholar
• Li, F., Golden, B., Wasil, E. 2005. Very Large-Scale Vehicle Routing: New Test Problems, Algorithms, and Results.. Computers and Operations Research 32, 1165–1179. doi: 10.1016/j.cor.2003.10.002
   Web of Science ®Google Scholar
• Lin, S. W., Lee, Z. J., Ying, K. C., Lee, C. Y. 2009. Applying Hybrid Meta-Heuristics for Capacitated Vehicle Routing Problem.. Expert Systems with Applications 36, 1505–1512. doi: 10.1016/j.eswa.2007.11.060
   Web of Science ®Google Scholar
• Mester, D., Bräysy, O. 2005. Active Guided Evolution Strategies for Large Scale Vehicle Routing Problem with Time Windows.. Computers and Operations Research 32, 1593–1614. doi: 10.1016/j.cor.2003.11.017
   Web of Science ®Google Scholar
• Mester, D., Bräysy, O. 2007. Active-Guided Evolution Strategies for Large-Scale Capacitated Vehicle Routing Problems.. Computers and Operations Research 34, 2964–2975. doi: 10.1016/j.cor.2005.11.006
   Web of Science ®Google Scholar
• Mladenovic, N., Hansen, P. 1997. Variable Neighborhood Search.. Computers and Operations Research 24, 1097–1100. doi: 10.1016/S0305-0548(97)00031-2
   Web of Science ®Google Scholar
• Mladenovic, N., Urosevic, D., Hanafi, S., Ilic, A. 2012. A General Variable Neighborhood Search for the One-Commodity Pickup-and-Delivery Travelling Salesman Problem.. European Journal of Operational Research 220, 270–285. doi: 10.1016/j.ejor.2012.01.036
   Web of Science ®Google Scholar
• Nagata, Y. 2007. Edge Assembly Crossover for the Capacitated Vehicle Routing Problem.. Lecture Notes in Computer Science, 142–153. Berlin: Springer. vol. 4446.
   Google Scholar
• Pisinger, D., Ropke, S. 2007. A General Heuristic for Vehicle Routing Problems.. Computers and Operations Research 34, 2403–2435. doi: 10.1016/j.cor.2005.09.012
   Web of Science ®Google Scholar
• Potvin, J. V. 2009. Evolutionary Algorithms for Vehicle Routing.. INFORMS Journal on Computing 21, 518–548. doi: 10.1287/ijoc.1080.0312
   Web of Science ®Google Scholar
• Prins, C. 2004. A Simple Effective Evolutionary Algorithm for the Vehicle Routing Problem. Computers and Operations Research 31, 1985–2002. doi: 10.1016/S0305-0548(03)00158-8
   Web of Science ®Google Scholar
• Prins, C. 2009. A GRASP x Evolutionary Local Search Hybrid for the Vehicle Routing Problem.. In F. B. Pereira, J. Tavares (Ed.), Bio-inspired Algorithms for the Vehicle Routing Problem, 35–53. New York: Springer.
   Google Scholar
• ReiMann, M., Doerner, K., Hartl, R. F. 2004. D-Ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problem.. Computers and Operations Research 31, 563–591. doi: 10.1016/S0305-0548(03)00014-5
   Web of Science ®Google Scholar
• Tarantilis, C. D. 2005. Solving the Vehicle Routing Problem with Adaptive Memory Programming Methodology.. Computers and Operations Research 32, 2309–2327. doi: 10.1016/j.cor.2004.03.005
   Web of Science ®Google Scholar
• Tarantilis, C. D., Kiranoudis, C. T. 2002. Bone Route: An Adaptive Memory-Based Method for Effective Fleet Management.. Annals of Operations Research 115, 227–241. doi: 10.1023/A:1021157406318
   Web of Science ®Google Scholar
• Toth, P., Vigo, D. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA: SIAM Publishing.
   Google Scholar
• Toth, P., Vigo, D. 2003. The Granular Tabu Search and its Application to the Vehicle Routing Problem.. INFORMS Journal of Computing 15, 333–348. doi: 10.1287/ijoc.15.4.333.24890
   Web of Science ®Google Scholar
• Triki, E., Collette, Y., Siarry, P. 2005. A Theoretical Study on the Behavior of Simulated Annealing Leading to a New Cooling Schedule.. European Journal of Operational Research 166, 77–92. doi: 10.1016/j.ejor.2004.03.035
   Web of Science ®Google Scholar
• Xiao, Y., Kaku, I., Zhao, Q., Zhang, R. 2011. A Reduced Variable Neighborhood Search Algorithm for Multilevel Uncapacitated Lot-Sizing Problems.. European Journal of Operational Research 214, 223–231. doi: 10.1016/j.ejor.2011.04.015
   Web of Science ®Google Scholar
• Xiao, Y., Zhao, Q., Kaku, I., Xu, Y. 2012. Development of a Fuel Consumption Optimization Model for the Capacitated Vehicle Routing Problem.. Computers & Operations Research 39 (7): 1419–1431. doi: 10.1016/j.cor.2011.08.013
   Web of Science ®Google Scholar