231
Views
2
CrossRef citations to date
0
Altmetric
Research Articles

A decomposition approach for the periodic consistent vehicle routeing problem with an application in the cleaning sector

, &
Pages 7727-7748 | Received 04 Oct 2021, Accepted 29 Nov 2022, Published online: 06 Jan 2023

References

  • Alegre, J., M. Laguna, and J. Pacheco. 2007. “Optimizing the Periodic Pick-Up of Raw Materials for a Manufacturer of Auto Parts.” European Journal of Operational Research 179 (3): 736–746. doi:10.1016/j.ejor.2005.03.063.
  • An, Y.-J., Y.-D. Kim, B. Jeong, and S.-D. Kim. 2012. “Scheduling Healthcare Services in a Home Healthcare System.” Journal of the Operational Research Society 63 (11): 1589–1599. doi:10.1057/jors.2011.153.
  • Archetti, C., E. Fernandez, and D. L. Huerta-Munoz. 2017. “The Flexible Periodic Vehicle Routing Problem.” Computers & Operations Research 85: 58–70. doi:10.1016/j.cor.2017.03.008.
  • Archetti, C., E. Fernandez, and D. L. Huerta-Munoz. 2018. “A Two-Phase Solution Algorithm for the Flexible Periodic Vehicle Routing Problem.” Computers & Operations Research 99: 27–37. doi:10.1016/j.cor.2018.05.021.
  • Baldacci, R., E. Bartolini, A. Mingozzi, and A. Valletta. 2011. “An Exact Algorithm for the Period Routing Problem.” Operations Research 59 (1): 228–241. doi:10.1287/opre.1100.0875.
  • Bellmore, M., and G. L. Nemhauser. 1968. “The Traveling Salesman Problem: A Survey.” Operations Research 16 (3): 538–558. doi:10.1287/opre.16.3.538.
  • Beltrami, E. J., and L. D. Bodin. 1974. “Networks and Vehicle Routing for Municipal Waste Collection.” Networks 4 (1): 65–94. doi:10.1002/(ISSN)1097-0037.
  • Blakeley, F., B. Arguello, B. Cao, W. Hall, and J. Knolmajer. 2003. “Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation.” Interfaces 33 (1): 67–79. doi:10.1287/inte.33.1.67.12722.
  • Braekers, K., and A. A. Kovacs. 2016. “A Multi-Period Dial-a-Ride Problem with Driver Consistency.” Transportation Research Part B: Methodological 94: 355–377. doi:10.1016/j.trb.2016.09.010.
  • Campbell, A. M., and J. H. Wilson. 2014. “Forty Years of Periodic Vehicle Routing.” Networks 63 (3): 276–276. doi:10.1002/net.21544.
  • Campelo, P., F. Neves-Moreira, P. Amorim, and B. Almada-Lobo. 2019. “Consistent Vehicle Routing Problem with Service Level Agreements: A Case Study in the Pharmaceutical Distribution Sector.” European Journal of Operational Research 273 (1): 131–145. doi:10.1016/j.ejor.2018.07.030.
  • Cantu-Funes, R., M. A. Salazar-Aguilar, and V. Boyer. 2018. “Multi-Depot Periodic Vehicle Routing Problem with Due Dates and Time Windows.” Journal of the Operational Research Society 69 (2): 296–306. doi:10.1057/s41274-017-0206-7.
  • Carotenuto, P., S. Giordani, S. Massari, and F. Vagaggini. 2018. “A Multi-Depot Periodic Vehicle Routing Model for Petrol Station Replenishment.” In Advanced Concepts, Methodologies and Technologies for Transportation and Logistics, edited by Żak J., Y. Hadas, and R. Rossi, 421–437.
  • Christofides, N., and J. E. Beasley. 1984. “The Period Routing Problem.” Networks 14 (2): 237–256. doi:10.1002/(ISSN)1097-0037.
  • Coene, S., A. Arnout, and F. C. R. Spieksma. 2010. “On a Periodic Vehicle Routing Problem.” Journal of the Operational Research Society 61 (12): 1719–1728. doi:10.1057/jors.2009.154.
  • Cordeau, J.-F., M. Gendreau, and G. Laporte. 1997. “A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems.” Networks: An International Journal 30 (2): 105–119. doi:10.1002/(ISSN)1097-0037.
  • Fauske, M. F., C. Mannino, and P. Ventura. 2020. “Generalized Periodic Vehicle Routing and Maritime Surveillance.” Transportation Science 54 (1): 164–183. doi:10.1287/trsc.2019.0899.
  • Feillet, D., T. Garaix, F. Lehuédé, O. Péton, and D. Quadri. 2014. “A New Consistent Vehicle Routing Problem for the Transportation of People with Disabilities.” Networks 63 (3): 211–224. doi:10.1002/net.v63.3.
  • Francis, P., K. Smilowitz, and M. Tzur. 2006. “The Period Vehicle Routing Problem with Service Choice.” Transportation Science 40 (4): 439–454. doi:10.1287/trsc.1050.0140.
  • Ghasemkhani, A., R. Tavakkoli-Moghaddam, Y. Rahimi, S. Shahnejat-Bushehri, and H. Tavakkoli-Moghaddam. 2021. “Integrated Production-Inventory-Routing Problem for Multi-Perishable Products under Uncertainty by Meta-Heuristic Algorithms.” International Journal of Production Research 0 (0): 1–21.
  • Goeke, D., R. Roberti, and M. Schneider. 2019. “Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem.” Transportation Science 53 (4): 1023–1042. doi:10.1287/trsc.2018.0864.
  • Google. 2018. “Distance Matrix API.” Accessed October 30, 2018. https://developers.google.com/maps/documentation/distance-matrix/start.
  • Groër, C., B. Golden, and E. Wasil. 2009. “The Consistent Vehicle Routing Problem.” Manufacturing & Service Operations Management 11 (4): 630–643. doi:10.1287/msom.1080.0243.
  • Hemmelmayr, V. C., K. F. Doerner, and R. F. Hartl. 2009. “A Variable Neighborhood Search Heuristic for Periodic Routing Problems.” European Journal of Operational Research 195 (3): 791–802. doi:10.1016/j.ejor.2007.08.048.
  • Holzapfel, A., A. Hubner, H. Kuhn, and M. G. Sternbeck. 2016. “Delivery Pattern and Transportation Planning in Grocery Retailing.” European Journal of Operational Research 252 (1): 54–68. doi:10.1016/j.ejor.2015.12.036.
  • Hu, H., Y. Zhang, and L. Zhen. 2017. “A Two-Stage Decomposition Method on Fresh Product Distribution Problem.” International Journal of Production Research 55 (16): 4729–4752. doi:10.1080/00207543.2017.1292062.
  • Kirkpatrick, S., C. Gelatt, and M. Vecchi. 1983. “Optimization by Simulated Annealing.” Science (New York, N.Y.) 220 (4598): 671–680. doi:10.1126/science.220.4598.671.
  • Kovacs, A. A., B. L. Golden, R. F. Hartl, and S. N. Parragh. 2014. “The Generalized Consistent Vehicle Routing Problem.” Transportation Science 49 (4): 796–816. doi:10.1287/trsc.2014.0529.
  • Kovacs, A. A., S. N. Parragh, and R. F. Hartl. 2014. “A Template-Based Adaptive Large Neighborhood Search for the Consistent Vehicle Routing Problem.” Networks 63 (1): 60–81. doi:10.1002/net.21522.
  • Kulachenko, I. N., and P. A. Kononova. 2020. “A Hybrid Local Search Algorithm for the Consistent Periodic Vehicle Routing Problem.” Journal of Applied and Industrial Mathematics 14 (2): 340–352. doi:10.1134/S199047892002012X.
  • Lin, S., and B. W. Kernighan. 1973. “An Effective Heuristic Algorithm for the Traveling-Salesman Problem.” Operations Research 21 (2): 498–516. doi:10.1287/opre.21.2.498.
  • Liu, C.-H. 2016. “Solving the Bi-Objective Optimisation Problem with Periodic Delivery Operations Using a Lexicographic Method.” International Journal of Production Research 54 (8): 2275–2283. doi:10.1080/00207543.2015.1070969.
  • Luo, Z., H. Qin, C. Che, and A. Lim. 2015. “On Service Consistency in Multi-Period Vehicle Routing.” European Journal of Operational Research 243 (3): 731–744. doi:10.1016/j.ejor.2014.12.019.
  • Mancini, S., M. Gansterer, and R. F. Hartl. 2021. “The Collaborative Consistent Vehicle Routing Problem with Workload Balance.” European Journal of Operational Research 293 (3): 955–965. doi:10.1016/j.ejor.2020.12.064.
  • Matos, A. C., and R. C. Oliveira. 2004. “An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem.” In Ant Colony Optimization and Swarm Intelligence, 286–293. Berlin, Heidelberg: Springer.
  • Messaoudi, B., A. Oulamara, and N. Rahmani. 2019. “Multiple Periods Vehicle Routing Problems: A Case Study.” In Evolutionary Computation in Combinatorial Optimization, edited by A. Liefooghe and L. Paquete, 83–98. Cham: Springer International Publishing – LNCS (11452).
  • Mor, A., and M. G. Speranza. 2022. “Vehicle Routing Problems Over Time: A Survey.” Annals of Operations Research 314:  255–275.
  • Mourgaya, M., and F. Vanderbeck. 2007. “Column Generation Based Heuristic for Tactical Planning in Multi-Period Vehicle Routing.” European Journal of Operational Research 183 (3): 1028–1041. doi:10.1016/j.ejor.2006.02.030.
  • Nguyen, P. K., T. G. Crainic, and M. Toulouse. 2014. “A Hybrid Generational Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows.” Journal of Heuristics 20 (4): 383–416. doi:10.1007/s10732-014-9244-3.
  • Rodríguez-Martín, I., J.-J. Salazar-González, and H. Yaman. 2019. “The Periodic Vehicle Routing Problem with Driver Consistency.” European Journal of Operational Research 273 (2): 575–584. doi:10.1016/j.ejor.2018.08.032.
  • Ronen, D., and C. A. Goodhart. 2008. “Tactical Store Delivery Planning.” Journal of the Operational Research Society 59 (8): 1047–1054. doi:10.1057/palgrave.jors.2602449.
  • Ropke, S., and D. Pisinger. 2006a. “An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.” Transportation Science 40 (4): 455–472. doi:10.1287/trsc.1050.0135.
  • Ropke, S., and D. Pisinger. 2006b. “A Unified Heuristic for a Large Class of Vehicle Routing Problems with Backhauls.” European Journal of Operational Research 171 (3): 750–775. doi:10.1016/j.ejor.2004.09.004.
  • Rothenbächer, A.-K. 2019. “Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures.” Transportation Science 53 (3): 850–866. doi:10.1287/trsc.2018.0855.
  • Russell, R. A., and D. Gribbin. 1991. “A Multiphase Approach to the Period Routing Problem.” Networks21 (7): 747–765. doi:10.1002/(ISSN)1097-0037.
  • Russell, R., and W. Igo. 1979. “An Assignment Routing Problem.” Networks 9: 1–17. doi:10.1002/(ISSN)1097-0037.
  • Russell, D., R. J. Rosati, P. Rosenfeld, and J. M. Marren. 2011. “Continuity in Home Health Care: Is Consistency in Nursing Personnel Associated with Better Patient Outcomes?.” Journal for Healthcare Quality 33 (6): 33–39. doi:10.1111/j.1945-1474.2011.00131.x.
  • Salhi, S. 2017. Heuristic Search: The Emerging Science of Problem Solving. Springer.
  • Schubert, E., and P. J. Rousseeuw. 2019. “Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithms.” In International Conference on Similarity Search and Applications, 171–187. Springer.
  • Smilowitz, K., M. Nowak, and T. Jiang. 2013. “Workforce Management in Periodic Delivery Operations.” Transportation Science 47 (2): 214–230. doi:10.1287/trsc.1120.0407.
  • Stavropoulou, F. 2022. “The Consistent Vehicle Routing Problem with Heterogeneous Fleet.” Computers & Operations Research 140: 105644. doi:10.1016/j.cor.2021.105644.
  • Stavropoulou, F., P. Repoussis, and C. Tarantilis. 2019. “The Vehicle Routing Problem with Profits and Consistency Constraints.” European Journal of Operational Research 274 (1): 340–356. doi:10.1016/j.ejor.2018.09.046.
  • Tarantilis, C. D., F. Stavropoulou, and P. P. Repoussis. 2012. “A Template-Based Tabu Search Algorithm for the Consistent Vehicle Routing Problem.” Expert Systems with Applications 39 (4): 4233–4239. doi:10.1016/j.eswa.2011.09.111.
  • Teemu, N., K. Jari, N. Harri, and B. Olli. 2006. “Improved Route Planning and Scheduling of Waste Collection and Transport.” Expert Systems with Applications 30 (2): 223–232. doi:10.1016/j.eswa.2005.07.009.
  • Toth, P., and D. Vigo. 2014. Vehicle Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization.
  • Vidal, T., T. G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei. 2012. “A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems.” Operations Research 60 (3): 611–624. doi:10.1287/opre.1120.1048.
  • Vidal, T., G. Laporte, and P. Matl. 2020. “A Concise Guide to Existing and Emerging Vehicle Routing Problem Variants.” European Journal of Operational Research 286 (2): 401–416. doi:10.1016/j.ejor.2019.10.010.
  • Wang, Y., L. Wang, G. Chen, Z. Cai, Y. Zhou, and L. Xing. 2020. “An Improved Ant Colony Optimization Algorithm to the Periodic Vehicle Routing Problem with Time Window and Service Choice.” Swarm and Evolutionary Computation 55: 100675. doi:10.1016/j.swevo.2020.100675.
  • Xu, Z., and Y. Cai. 2018. “Variable Neighborhood Search for Consistent Vehicle Routing Problem.” Expert Systems with Applications 113: 66–76. doi:10.1016/j.eswa.2018.07.007.
  • Zajac, S. 2017. “An Adaptive Large Neighborhood Search for the Periodic Vehicle Routing Problem.” In Computational Logistics, edited by T. Bektaş, S. Coniglio, A. Martinez-Sykora, and S. Voß, 34–48. Springer International Publishing.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.