A Variable Neighbourhood Search Algorithm with Compound Neighbourhoods for VRPTW

Binhui Chen, Rong Qu, Ruibin Bai, Hisao Ishibuchi

Abstract

The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time interval and capacity constraints. A Variable Neighbourhood Search algorithm with Compound Neighbourhoods is proposed to solve VRPTW in this paper. A number of independent neighbourhood operators are composed into compound neighbourhood operators in a new way, to explore wider search area concerning two objectives (to minimize the number of vehicles and the total travel distance) simultaneously. Promising results are obtained on benchmark datasets.

References

  1. Alvarenga, G. B., Mateus, G. R., and De Tomi, G. (2007). A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computers & Operations Research, 34(6):1561-1584.
  2. Bräysy, O. (2003). A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS Journal on Computing, 15(4):347-368.
  3. Bräysy, O. and Gendreau, M. (2001). Metaheuristics for the vehicle routing problem with time windows. Report STF42 A, 1025.
  4. Chiang, W.-C. and Russell, R. A. (1997). A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on computing, 9(4):417-430.
  5. Cook, W. and Rich, J. L. (1999). A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Computational and Applied Mathematics Department, Rice University, Houston, TX, Technical Report.
  6. Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M., and Soumis, F. (2001). Vrp with time windows. In The vehicle routing problem, pages 157-193. Society for Industrial and Applied Mathematics.
  7. de Oliveira, H., Vasconcelos, G., Alvarenga, G., Mesquita, R., and de Souza, M. (2007). A robust method for the vrptw with multi-start simulated annealing and statistical analysis. In Computational Intelligence in Scheduling, 2007. SCIS'07. IEEE Symposium on, pages 198-205. IEEE.
  8. Dueck, G. (1993). New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics, 104(1):86-92.
  9. Ergun, O., Orlin, J. B., and Steele-Feldman, A. (2006). Creating very large scale neighborhoods out of smaller ones by compounding moves. Journal of Heuristics, 12(1-2):115-140.
  10. Fleszar, K., Osman, I. H., and Hindi, K. S. (2009). A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research, 195(3):803-809.
  11. Ghoseiri, K. and Ghannadpour, S. F. (2010). Multiobjective vehicle routing problem with time windows using goal programming and genetic algorithm. Applied Soft Computing, 10(4):1096-1107.
  12. Hansen, P. and Mladenovic, N. (2001). J-means: a new local search heuristic for minimum sum of squares clustering. Pattern recognition, 34(2):405-413.
  13. Hansen, P., Mladenovic, N., and Pérez, J. A. M. (2010). Variable neighbourhood search: methods and applications. Annals of Operations Research, 175(1):367- 407.
  14. Hansen, P., Mladenovic, N., and Perez-Britos, D. (2001). Variable neighborhood decomposition search. Journal of Heuristics, 7(4):335-350.
  15. Hansen, P., Mladenovic, N., and Urosevic, D. (2006). Variable neighborhood search and local branching. Computers & Operations Research, 33(10):3034-3045.
  16. Hemmelmayr, V. C., Doerner, K. F., and Hartl, R. F. (2009). A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research, 195(3):791-802.
  17. Jozefowiez, N., Semet, F., and Talbi, E.-G. (2008). Multiobjective vehicle routing problems. European journal of operational research, 189(2):293-309.
  18. Kallehauge, B., Larsen, J., and Madsen, O. B. (2006). Lagrangian duality applied to the vehicle routing problem with time windows. Computers & Operations Research, 33(5):1464-1487.
  19. Kohl, N., Desrosiers, J., Madsen, O. B., Solomon, M. M., and Soumis, F. (1999). 2-path cuts for the vehicle routing problem with time windows. Transportation Science, 33(1):101-116.
  20. Küc¸ ükog? lu, ?I. and Oztürk, N. (2014). An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows. Computers & Industrial Engineering.
  21. Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3):345- 358.
  22. Lin, S. (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal, The, 44(10):2245-2269.
  23. Mladenovic, N. and Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11):1097-1100.
  24. Ombuki, B., Ross, B. J., and Hanshar, F. (2006). Multiobjective genetic algorithms for vehicle routing problem with time windows. Applied Intelligence, 24(1):17-30.
  25. Or, I. (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Xerox University Microfilms.
  26. Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of operations Research, 41(4):421-451.
  27. Polacek, M., Hartl, R. F., Doerner, K., and Reimann, M. (2004). A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of heuristics, 10(6):613-627.
  28. Potvin, J.-Y., Kervahut, T., Garcia, B.-L., and Rousseau, J.-M. (1996). The vehicle routing problem with time windows part i: tabu search. INFORMS Journal on Computing, 8(2):158-164.
  29. Rego, C. (1998). A subpath ejection method for the vehicle routing problem. Management Science, 44(10):1447- 1459.
  30. Rochat, Y. and Taillard, Ó. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of heuristics, 1(1):147-167.
  31. SINTEF (2015). Best known solution values for solomon benchmark. http:// www.sintef.no/Projectweb/TOP/VRPTW/Solomonbenchmark/100-customers/
  32. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research, 35(2):254-265.
  33. Taillard, . A., Badeau, P., Gendreau, M., Guertin, F. A., and Potvin, J.-Y. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science, 31(2):170-186.
  34. Tan, K., Chew, Y., and Lee, L. (2006). A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Computational Optimization and Applications, 34(1):115-151.
  35. Ursani, Z., Essam, D., Cornforth, D., and Stocker, R. (2011). Localized genetic algorithm for vehicle routing problem with time windows. Applied Soft Computing, 11(8):5375-5390.
  36. Van Breedam, A. (1995). Improvement heuristics for the vehicle routing problem based on simulated annealing. European Journal of Operational Research, 86(3):480-490.
Download


Paper Citation


in Harvard Style

Chen B., Qu R., Bai R. and Ishibuchi H. (2016). A Variable Neighbourhood Search Algorithm with Compound Neighbourhoods for VRPTW . In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-171-7, pages 25-35. DOI: 10.5220/0005661800250035


in Bibtex Style

@conference{icores16,
author={Binhui Chen and Rong Qu and Ruibin Bai and Hisao Ishibuchi},
title={A Variable Neighbourhood Search Algorithm with Compound Neighbourhoods for VRPTW},
booktitle={Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2016},
pages={25-35},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005661800250035},
isbn={978-989-758-171-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Variable Neighbourhood Search Algorithm with Compound Neighbourhoods for VRPTW
SN - 978-989-758-171-7
AU - Chen B.
AU - Qu R.
AU - Bai R.
AU - Ishibuchi H.
PY - 2016
SP - 25
EP - 35
DO - 10.5220/0005661800250035