Analytics and machine learning in vehicle routing research

References

• Ahmed, Leena, Christine Mumford, and Ahmed Kheiri. 2019. “Solving Urban Transit Route Design Problem Using Selection Hyper-heuristics.” European Journal of Operational Research 274 (2): 545–559.
   Web of Science ®Google Scholar
• Aksen, Deniz, Onur Kaya, F. Sibel Salman, and Ozge Tuncel. 2014. “An Adaptive Large Neighborhood Search Algorithm for a Selective and Periodic Inventory Routing Problem.” European Journal of Operational Research 239 (2): 413–426.
   Web of Science ®Google Scholar
• Albareda-Sambola, Maria, Elena Fernández, and Gilbert Laporte. 2014. “The Dynamic Multiperiod Vehicle Routing Problem with Probabilistic Information.” Computers & Operations Research 48: 31–39.
   Web of Science ®Google Scholar
• Alvarez, Alejandro Marcos, Quentin Louveaux, and Louis Wehenkel. 2017. “A Machine Learning-Based Approximation of Strong Branching.” INFORMS Journal on Computing 29 (1): 185–195.
   Web of Science ®Google Scholar
• Anuar, Wadi Khalid, M. Moll, L. S. Lee, S. Pickl, and H. V. Seow. 2019. “Vehicle Routing Optimization for Humanitarian Logistics in Disaster Recovery: A Survey.” In Proceedings of the International Conference on Security and Management (SAM2019), Athens.
   Google Scholar
• Archetti, Claudia, and M. Grazia Speranza. 2014. “A Survey on Matheuristics for Routing Problems.” EURO Journal on Computational Optimization 2 (4): 223–246.
   Google Scholar
• Asghari, Mohammad, and S. Mohammad J. Mirzapour Al-e hashem. 2020. “A Green Delivery-pickup Problem for Home Hemodialysis Machines; Sharing Economy in Distributing Scarce Resources.” Transportation Research Part E-Logistics and Transportation Review 134: 101815.
   Web of Science ®Google Scholar
• Asta, Shahriar, and Ender Ozcan. 2014. An Apprenticeship Learning Hyper-Heuristic for Vehicle Routing in HyFlex. New York: IEEE.
   Google Scholar
• Augerat, Ph, Jose Manuel Belenguer, Enrique Benavent, A. Corberán, D. Naddef, and G. Rinaldi. 1995. Computational results with a branch and cut code for the capacitated vehicle routing problem. Vol. 34. IMAG.
   Google Scholar
• Azi, Nabila, Michel Gendreau, and Jean-Yves Potvin. 2014. “An Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Multiple Routes.” Computers & Operations Research 41: 167–173.
   Web of Science ®Google Scholar
• Bahdanau, Dzmitry, Kyung Hyun Cho, and Yoshua Bengio. 2015. “Neural Machine Translation by Jointly Learning to Align and Translate.” In 3rd International Conference on Learning Representations, ICLR 2015 - Conference Track Proceedings.
   Google Scholar
• Bai, Ruibin, Edmund K. Burke, Michel Gendreau, Graham Kendall, and Barry McCollum. 2007. Memory Length in Hyper-heuristics: An Empirical Study. New York: IEEE.
   Google Scholar
• Bai, Ruibin, Stein W. Wallace, Jingpeng Li, and Alain Yee-Loong Chong. 2014. “Stochastic Service Network Design with Rerouting.” Transportation Research Part B: Methodological 60: 50–65.
   Web of Science ®Google Scholar
• Balaji, Bharathan, Jordan Bell-Masterson, Enes Bilgin, Andreas Damianou, Pablo Moreno Garcia, Arpit Jain, Runfei Luo, Alvaro Maggiar, Balakrishnan Narayanaswamy, and Chun Ye. 2019. “ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems.” In AAAI, Nov. http://arxiv.org/abs/1911.10641
   Google Scholar
• Baldacci, Roberto, Eleni Hadjiconstantinou, and Aristide Mingozzi. 2004. “An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-commodity Network Flow Formulation.” Operations Research 52 (5): 723–738.
   Web of Science ®Google Scholar
• Beasley, J. E. 1983. “Route First–Cluster Second Methods for Vehicle Routing.” Omega 11 (4): 403–408.
   Web of Science ®Google Scholar
• Bellman, Richard. 1962. “Dynamic Programming Treatment of the Travelling Salesman Problem.” Journal of the ACM (JACM) 9: 61–63.
   Web of Science ®Google Scholar
• Bello, Irwan, Hieu Pham, Quoc V. Le, Mohammad Norouzi, and Samy Bengio. 2017. “Neural Combinatorial Optimization with Reinforcement Learning.” In ICLR Workshop, November, 473–474. http://arxiv.org/abs/1611.09940
   Google Scholar
• Belo-Filho, M. a. F., P. Amorim, and B. Almada-Lobo. 2015. “An Adaptive Large Neighbourhood Search for the Operational Integrated Production and Distribution Problem of Perishable Products.” International Journal of Production Research 53 (20): 6040–6058.
   Web of Science ®Google Scholar
• Bengio, Yoshua, Andrea Lodi, and Antoine Prouvost. 2021. “Machine Learning for Combinatorial Optimization: a Methodological Tour D'Horizon.” European Journal of Operational Research 290 (2): 405–421.
   Web of Science ®Google Scholar
• Bent, Russell W., and Pascal Van Hentenryck. 2004. “Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers.” Operations Research 52 (6): 977–987.
   Web of Science ®Google Scholar
• Bent, Russell, and Pascal Van Hentenryck. 2005. “Online Stochastic Optimization Without Distributions.” In ICAPS, Vol. 5, 171–180.
   Google Scholar
• Bertsekas, Dimitri P., and John N. Tsitsiklis. 1996. Neuro-dynamic Programming. Belmont, MA: Athena Scientific.
   Google Scholar
• Bertsimas, Dimitris, David Brown, and Constantine Caramanis. 2010. “Theory and Applications of Robust Optimization.” SIAM Review 53: 464–501.
   Web of Science ®Google Scholar
• Boussaïd, Ilhem, Julien Lepagnot, and Patrick Siarry. 2013. “A Survey on Optimization Metaheuristics.” Information Sciences 237: 82–117.
   Web of Science ®Google Scholar
• Boutilier, Justin J., and Timothy C. Y. Chan. 2020. “Ambulance Emergency Response Optimization in Developing Countries.” OPERATIONS RESEARCH 68 (5): 1315–1334.
   Web of Science ®Google Scholar
• Boyan, J. A., and A. W. Moore. 2000. “Learning Evaluation Functions to Improve Optimization by Local Search.” Journal of Machine Learning Research 1: 77–112.
   Web of Science ®Google Scholar
• Boyd, Stephen, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein. 2010. “Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers.” Foundations and Trends® in Machine Learning 3 (1): 1–122.
   Google Scholar
• Braekers, Kris, Katrien Ramaekers, and Inneke Van Nieuwenhuyse. 2016. “The Vehicle Routing Problem: State of the Art Classification and Review.” Computers & Industrial Engineering 99: 300–313.
   Web of Science ®Google Scholar
• Braysy, I., and M. Gendreau. 2005a. “Vehicle Routing Problem with Time Windows, Part 1: Route Construction and Local Search Algorithms.” Transportation Science 39 (1): 104–118.
   Web of Science ®Google Scholar
• Braysy, I., and M. Gendreau. 2005b. “Vehicle Routing Problem with Time Windows, Part II: Metaheuristics.” Transportation Science 39 (1): 119–139.
   Web of Science ®Google Scholar
• Burke, Edmund K., Matthew R. Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, and John R. Woodward. 2019. “A Classification of Hyper-Heuristic Approaches: Revisited.” In Handbook of Metaheuristics, edited by Michel Gendreau and Jean-Yves Potvin, International Series in Operations Research & Management Science, 453–477. Cham: Springer International Publishing.
   Google Scholar
• Calvet, Laura, Albert Ferrer, M. Isabel Gomes, Angel A. Juan, and David Masip. 2016. “Combining Statistical Learning with Metaheuristics for the Multi-depot Vehicle Routing Problem with Market Segmentation.” Computers & Industrial Engineering 94: 93–104.
   Web of Science ®Google Scholar
• Calvet, Laura, Angel A. Juan, Carles Serrat, and Jana Ries. 2016. “A Statistical Learning based Approach for Parameter Fine-tuning of Metaheuristics.” SORT-Statistics and Operations Research Transactions, 201–224.
   Google Scholar
• Ce, Fu, and Wang Hui. 2010. “The Solving Strategy for the Real-world Vehicle Routing Problem.” In 2010 3rd International Congress on Image and Signal Processing.
   Google Scholar
• Chen, Xinan, Ruibin Bai, Rong Qu, Haibo Dong, and Jianjun Chen. 2020. “A Data-Driven Genetic Programming Heuristic for Real-World Dynamic Seaport Container Terminal Truck Dispatching.” In 2020 IEEE Congress on Evolutionary Computation (CEC), 1–8. IEEE.
   Google Scholar
• Chen, Mingxiang, Lei Gao, Qichang Chen, and Zhixin Liu. 2020. “Dynamic Partial Removal: A Neural Network Heuristic for Large Neighborhood Search.” arXiv.
   Google Scholar
• Chen, Mu-Chen, Yu-Hsiang Hsiao, Reddivari Himadeep Reddy, and Manoj Kumar Tiwari. 2016. “The Self-Learning Particle Swarm Optimization Approach for Routing Pickup and Delivery of Multiple Products with Material Handling in Multiple Cross-docks.” Transportation Research Part E-Logistics and Transportation Review 91: 208–226.
   Web of Science ®Google Scholar
• Chen, Binhui, Rong Qu, Ruibin Bai, and Wasakorn Laesanklang. 2018. “A Hyper-heuristic with Two Guidance Indicators for Bi-objective Mixed-shift Vehicle Routing Problem with Time Windows.” Applied Intelligence 48 (12): 4937–4959.
   Web of Science ®Google Scholar
• Chen, Binhui, Rong Qu, Ruibin Bai, and Wasakorn Laesanklang. 2020. “A Variable Neighborhood Search Algorithm with Reinforcement Learning for a Real-life Periodic Vehicle Routing Problem with Time Windows and Open Routes.” RAIRO - Operations Research 54 (5): 1467–1494.
   Web of Science ®Google Scholar
• Chen, Xinyun, and Yuandong Tian. 2019. “Learning to Perform Local Rewriting for Combinatorial Optimization.” In NeurIPS, 6281–6292. https://github.com/facebookresearch/neural-rewriter
   Google Scholar
• Christiansen, Christian H., and Jens Lysgaard. 2007. “A Branch-and-price Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands.” Operations Research Letters 35 (6): 773–781.
   Web of Science ®Google Scholar
• Chuah, Keng Hoo, and Jon C. Yingling. 2005. “Routing for a Just-in-Time Supply Pickup and Delivery System.” Transportation Science 39 (3): 328–339.
   Web of Science ®Google Scholar
• Comert, Serap Ercan, Harun Resit Yazgan, Sena Kır, and Furkan Yener. 2018. “A Cluster First-route Second Approach for a Capacitated Vehicle Routing Problem: a Case Study.” International Journal of Procurement Management 11 (4): 399.
   Google Scholar
• Comert, Serap Ercan, Harun Resit Yazgan, Irem Sertvuran, and Hanife Sengul. 2017. “A New Approach for Solution of Vehicle Routing Problem with Hard Time Window: An Application in a Supermarket Chain.” Sādhanā 42 (12): 2067–2080.
   Web of Science ®Google Scholar
• Cooray, P. L. N. U., and Thashika D. Rupasinghe. 2017. “Machine Learning-Based Parameter Tuned Genetic Algorithm for Energy Minimizing Vehicle Routing Problem.” Journal of Industrial Engineering2017: 3019523.
   Google Scholar
• Cordeau, Jean-François, Mauro Dell'Amico, Simone Falavigna, and Manuel Iori. 2015. “A Rolling Horizon Algorithm for Auto-carrier Transportation.” Transportation Research Part B: Methodological 76: 68–80.
   Web of Science ®Google Scholar
• Costa, Joao Guilherme Cavalcanti, Yi Mei, and Mengjie Zhang. 2020. “Cluster-based Hyper-Heuristic for Large-Scale Vehicle Routing Problem.” In 2020 IEEE Congress on Evolutionary Computation (CEC), 1–8. IEEE.
   Google Scholar
• Da Costa, Paulo R de O, Jason Rhuggenaath, Yingqian Zhang, and Alp Akcay. 2020. “Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learning.” In Proceedings of The 12th Asian Conference on Machine Learning (PMLR), 465–480.
   Google Scholar
• Dai, Hanjun, Elias B. Khalil, Yuyu Zhang, Bistra Dilkina, and Le Song. 2017. “Learning Combinatorial Optimization Algorithms over Graphs.” Advances in Neural Information Processing Systems, December 2017, 6349–6359.
   Google Scholar
• Dantzig, George B., and John H. Ramser. 1959. “The Truck Dispatching Problem.” Management Science6 (1): 80–91.
   Web of Science ®Google Scholar
• Defourny, Boris. 2010. “Machine Learning Solution Methods for Multistage Stochastic Programming.” PhD diss., University of Liege. https://www.lehigh.edu/defourny/PhDthesis_B_Defourny.pdf
   Google Scholar
• Demir, Emrah, Tolga Bektas, and Gilbert Laporte. 2012. “An Adaptive Large Neighborhood Search Heuristic for the Pollution-Routing Problem.” European Journal of Operational Research 223 (2): 346–359.
   Web of Science ®Google Scholar
• Desaulniers, Guy, Andrea Lodi, and Mouad Morabit. 2020. Machine-Learning-Based Column Selection for Column Generation. Technical Report G-2020-29. GERAD. ISSN: 0771-2440. Publication Title: Les Cahiers du GERAD. Accessed 29 September 2020. https://www.gerad.ca/en/papers/G-2020-29
   Google Scholar
• Deudon, Michel, Pierre Cournut, Alexandre Lacoste, Yossiri Adulyasak, and Louis Martin Rousseau. 2018. “Learning Heuristics for the TSP by Policy Gradient.” In CPAIOR, LNCS, Vol. 10848, 170–181. Springer Verlag. http://hanalog.polymtl.ca/wp-content/uploads/2018/11/cpaior-learning-heuristics-6.pdf
   Google Scholar
• Dinh, Thai, Ricardo Fukasawa, and James Luedtke. 2018. “Exact Algorithms for the Chance-constrained Vehicle Routing Problem.” Mathematical Programming 172 (1-2): 105–138.
   Web of Science ®Google Scholar
• Dondo, Rodolfo, and Jaime Cerdá. 2007. “A Cluster-based Optimization Approach for the Multi-depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows.” European Journal of Operational Research 176 (3): 1478–1507.
   Web of Science ®Google Scholar
• Drake, John H., Ender Özcan, and Edmund K. Burke. 2012. “An Improved Choice Function Heuristic Selection for Cross Domain Heuristic Search.” In Parallel Problem Solving from Nature - PPSN XII, edited by Carlos A. Coello Coello, Vincenzo Cutello, Kalyanmoy Deb, Stephanie Forrest, Giuseppe Nicosia, and Mario Pavone, Lecture Notes in Computer Science, 307–316. Berlin, Heidelberg: Springer.
   Google Scholar
• Duan, Lu, Yang Zhan, Haoyuan Hu, Yu Gong, Jiangwen Wei, Xiaodong Zhang, and Yinghui Xu. 2020. “Efficiently Solving the Practical Vehicle Routing Problem: A Novel Joint Learning Approach.” In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD '20, New York, NY, USA, August, 3054–3063. Association for Computing Machinery.
   Google Scholar
• Eksioglu, Burak, Arif Volkan Vural, and Arnold Reisman. 2009. “The Vehicle Routing Problem: A Taxonomic Review.” Computers & Industrial Engineering 57 (4): 1472–1483.
   Web of Science ®Google Scholar
• Elshaer, Raafat, and Hadeer Awad. 2020. “A Taxonomic Review of Metaheuristic Algorithms for Solving the Vehicle Routing Problem and Its Variants.” Computers & Industrial Engineering 140: 106242.
   Web of Science ®Google Scholar
• Erdoğan, Sevgi, and Elise Miller-Hooks. 2012. “A Green Vehicle Routing Problem.” Transportation Research Part E: Logistics and Transportation Review 48 (1): 100–114.
   Web of Science ®Google Scholar
• Feo, Thomas A., and Mauricio G. C. Resende. 1995. “Greedy Randomized Adaptive Search Procedures.” Journal of Global Optimization 6 (2): 109–133.
   Web of Science ®Google Scholar
• Fisher, Marshall L., and Ramchandran Jaikumar. 1981. “A Generalized Assignment Heuristic for Vehicle Routing.” Networks 11 (2): 109–124.
   Web of Science ®Google Scholar
• Fu, Zhang-Hua, Kai-Bin Qiu, and Hongyuan Zha. 2021. “Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances.” In AAAI.
   Google Scholar
• Furian, Nikolaus, Michael O'Sullivan, Cameron Walker, and Eranda Çela. 2021. “A Machine Learning-based Branch and Price Algorithm for a Sampled Vehicle Routing Problem.” OR Spectrum43: 693–732.
   Web of Science ®Google Scholar
• Gao, Lei, Mingxiang Chen, Qichang Chen, Ganzhong Luo, Nuoyi Zhu, and Zhixin Liu. 2020. “Learn to Design the Heuristics for Vehicle Routing Problem.” In arXiv, Feb. Accessed 3 October 2020. http://arxiv.org/abs/2002.08539
   Google Scholar
• Gao, Shangce, Yirui Wang, Jiujun Cheng, Yasuhiro Inazumi, and Zheng Tang. 2016. “Ant Colony Optimization with Clustering for Solving the Dynamic Location Routing Problem.” Applied Mathematics and Computation 285: 149–173.
   Web of Science ®Google Scholar
• Garrido, Pablo, and Maria Cristina Riff. 2010. “DVRP: a Hard Dynamic Combinatorial Optimisation Problem Tackled by An Evolutionary Hyper-heuristic.” Journal of Heuristics 16 (6): 795–834.
   Web of Science ®Google Scholar
• Geetha, S., G. Poonthalir, and P. T. Vanathi. 2013. “Nested Particle Swarm Optimisation for Multi-depot Vehicle Routing Problem.” International Journal of Operational Research 16 (3): 329.
   Google Scholar
• Geetha, S., P. T. Vanathi, and G. Poonthalir. 2012. “Metaheuristic Approach For The Multi Depot Vehicle Routing Problem.” Applied Artificial Intelligence 26 (9): 878–901.
   Web of Science ®Google Scholar
• Gendreau, M., G. Laporte, and R. Seguin. 1996. “Stochastic Vehicle Routing.” European Journal of Operational Research 88 (1): 3–12.
   Web of Science ®Google Scholar
• Gendreau, M., and J. Potvin. 2010. Handbook of Metaheuristics. International Series in Operations Research & Management Science, Vol 46. Boston, MA: Springer.
   Google Scholar
• Ghosal, Shubhechyya, and Wolfram Wiesemann. 2020. “The Distributionally Robust Chance Constrained Vehicle Routing Problem.” Operations Research 68: 716–732.
   Web of Science ®Google Scholar
• Glover, Fred W., and Manuel Laguna. 1997. Tabu Search. Amsterdam: Springer US.
   Google Scholar
• Göçmen, Elifcan, and Rızvan Erol. 2019. “Transportation Problems for Intermodal Networks: Mathematical Models, Exact and Heuristic Algorithms, and Machine Learning.” Expert Systems with Applications 135: 374–387.
   Web of Science ®Google Scholar
• Godfrey, Gregory A., and Warren B. Powell. 2002. “An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times.” Transportation Science 36 (1): 21–39.
   Web of Science ®Google Scholar
• Gounaris, Chrysanthos E., Wolfram Wiesemann, and Christodoulos A. Floudas. 2013. “The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty.” Operations Research 61 (3): 677–693.
   Web of Science ®Google Scholar
• Grunow, Martin, Hans-Otto Günther, and Matthias Lehmann. 2006. “Strategies for Dispatching AGVs At Automated Seaport Container Terminals.” OR Spectrum 28 (4): 587–610.
   Web of Science ®Google Scholar
• Grzybowska, Hanna, Briscoe Kerferd, Charles Gretton, and S. Travis Waller. 2020. “A Simulation-optimisation Genetic Algorithm Approach to Product Allocation in Vending Machine Systems.” Expert Systems with Applications 145: 113110.
   Web of Science ®Google Scholar
• Gutierrez, Andres, Laurence Dieulle, Nacima Labadie, and Nubia Velasco. 2018. “A Multi-population Algorithm to Solve the VRP with Stochastic Service and Travel Times.” Computers & Industrial Engineering 125: 144–156.
   Web of Science ®Google Scholar
• Ha, Minh Hoang, Tat Dat Nguyen, Thinh Nguyen Duy, Hoang Giang Pham, Thuy Do, and Louis-Martin Rousseau. 2020. “A New Constraint Programming Model and a Linear Programming-based Adaptive Large Neighborhood Search for the Vehicle Routing Problem with Synchronization Constraints.” Computers & Operations Research 124: 105085.
   Web of Science ®Google Scholar
• Han, Jinil, Chungmok Lee, and Sungsoo Park. 2014. “A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times.” Transportation Science 48 (3): 373–390.
   Web of Science ®Google Scholar
• Hasan, Hameedah Sahib, M. Shukri Zainal Abidin, M. S. A. Mahmud, and M. F. Muhamad Said. 2019. “Automated Guided Vehicle Routing: Static, Dynamic and Free Range.” International Journal of Engineering and Advanced Technology 8 (5C): 1–7.
   Google Scholar
• He, He, Hal Daume III, and Jason M. Eisner. 2014. “Learning to Search in Branch and Bound Algorithms.” In Advances in Neural Information Processing Systems 27, edited by Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, 3293–3301. Curran Associates, Inc.
   Google Scholar
• He, Ruhan, Weibin Xu, Jiaxia Sun, and Bingqiao Zu. 2009. “Balanced K-Means Algorithm for Partitioning Areas in Large-Scale Vehicle Routing Problem.” In 2009 Third International Symposium on Intelligent Information Technology Application, NanChang, China, 87–90. IEEE.
   Google Scholar
• Held, Michael, and Richard M. Karp. 1962. “A Dynamic Programming Approach to Sequencing Problems.” Journal of the Society for Industrial and Applied Mathematics 10 (1): 196–210.
   Google Scholar
• Helsgaun, Keld. 2017. An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems. Roskilde: Roskilde University.
   Google Scholar
• Hemmelmayr, Vera C., Jean-Francois Cordeau, and Teodor Gabriel Crainic. 2012. “An Adaptive Large Neighborhood Search Heuristic for Two-Echelon Vehicle Routing Problems Arising in City Logistics.” Computers & Operations Research 39 (12): 3215–3228.
   PubMed Web of Science ®Google Scholar
• Heyken Soares, Philipp, Leena Ahmed, Yong Mao, and Christine L. Mumford. 2020. “Public Transport Network Optimisation in PTV Visum Using Selection Hyper-heuristics.” Public Transport 13: 163–196.
   Web of Science ®Google Scholar
• Hong, L. Jeff, Zhiyuan Huang, and Henry Lam. 2021. “Learning-based Robust Optimization: Procedures and Statistical Guarantees.” Management Science 67 (6): 3447–3467.
   Web of Science ®Google Scholar
• Hopfield, J. J., and D. W. Tank. 1985. “‘Neural’ Computation of Decisions in Optimization Problems.” Biological Cybernetics 52 (3): 141–152.
   PubMed Web of Science ®Google Scholar
• Hottung, André, and Kevin Tierney. 2019. “Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem.” https://arxiv.org/abs/1911.09539
   Google Scholar
• Hu, Xiangpei, Minfang Huang, and Amy Z. Zeng. 2007. “An Intelligent Solution System for a Vehicle Routing Problem in Urban Distribution.” International Journal of Innovative Computing, Information and Control 3 (1): 189–198.
   Web of Science ®Google Scholar
• Hu, Yujiao, Yuan Yao, and Wee Sun Lee. 2020. “A Reinforcement Learning Approach for Optimizing Multiple Traveling Salesman Problems Over Graphs.” Knowledge-Based Systems 204: 106244.
   Web of Science ®Google Scholar
• Hwang, Illhoe, and Young Jae Jang. 2020. “Q(λ) Learning-based Dynamic Route Guidance Algorithm for Overhead Hoist Transport Systems in Semiconductor Fabs.” International Journal of Production Research 58 (4): 1199–1221.
   Web of Science ®Google Scholar
• Jacobsen-Grocott, Josiah, Yi Mei, Gang Chen, and Mengjie Zhang. 2017. “Evolving Heuristics for Dynamic Vehicle Routing with Time Windows using Genetic Programming.” In 2017 IEEE Congress on Evolutionary Computation (CEC), June, 1948–1955.
   Google Scholar
• James, J. Q., Wen Yu, and Jiatao Gu. 2019. “Online Vehicle Routing with Neural Combinatorial Optimization and Deep Reinforcement Learning.” IEEE Transactions on Intelligent Transportation Systems 20 (10): 3806–3817.
   Web of Science ®Google Scholar
• Jayachandran, M., Ch. Rami Reddy, Sanjeevikumar Padmanaban, and A. H. Milyani. 2021. “Operational Planning Steps in Smart Electric Power Delivery System.” Scientific Reports 11 (1): 17250.
   PubMed Web of Science ®Google Scholar
• Joe, Waldy, and Hoong Chuin Lau. 2020. “Deep reinforcement learning approach to solve dynamic vehicle routing problem with stochastic customers.” In Proceedings of the International Conference on Automated Planning and Scheduling, Vol. 30, 394–402.
   Google Scholar
• Joshi, Chaitanya K., Thomas Laurent, and Xavier Bresson. 2019a. “An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem.” http://arxiv.org/abs/1906.01227.
   Google Scholar
• Joshi, Chaitanya K., Thomas Laurent, and Xavier Bresson. 2019b. “On Learning Paradigms for the Travelling Salesman Problem.” In NeurIPS 2019 Graph Representation Learning Workshop. https://github.com/chaitjo/learning-paradigms-for-tsp
   Google Scholar
• Kadaba, Nagesh, Kendall E. Nygard, and Paul L. Juell. 1991. “Integration of Adaptive Machine Learning and Knowledge-based Systems for Routing and Scheduling Applications.” Expert Systems with Applications 2 (1): 15–27.
   Web of Science ®Google Scholar
• Kaempfer, Yoav, and Lior Wolf. 2019. “Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks.” February. http://arxiv.org/abs/1803.09621
   Google Scholar
• Kalakanti, Arun Kumar, Shivani Verma, Topon Paul, and Takufumi Yoshida. 2019. “RL SolVeR pro: Reinforcement Learning for Solving Vehicle Routing Problem.” In 2019 1st International Conference on Artificial Intelligence and Data Sciences (AiDAS), 94–99. IEEE.
   Google Scholar
• Karimi-Mamaghan, Maryam, Mehrdad Mohammadi, Patrick Meyer, Amir Mohammad Karimi-Mamaghan, and El-Ghazali Talbi. 2022. “Machine Learning At the Service of Meta-heuristics for Solving Combinatorial Optimization Problems: A State-of-the-art.” European Journal of Operational Research 296 (2): 393–422.
   Web of Science ®Google Scholar
• Khalil, Elias B., Pierre Le Bodic, Le Song, George Nemhauser, and Bistra Dilkina. 2016. “Learning to Branch in Mixed Integer Programming.” In 30th AAAI Conference on Artificial Intelligence, AAAI 2016. https://www.cc.gatech.edu/lsong/papers/KhaLebSonNemDil16.pdf
   Google Scholar
• Kirkpatrick, Scott, C. Daniel Gelatt, and Mario P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220 (4598): 671–680.
   PubMed Web of Science ®Google Scholar
• Kool, Wouter, Herke van Hoof, and Max Welling. 2019. “Attention, Learn to Solve Routing Problems!” In 7th International Conference on Learning Representations, ICLR 2019. ICLR. http://arxiv.org/abs/1803.08475
   Google Scholar
• Korayem, L., M. Khorsid, and S. S. Kassem. 2015. “Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem.” IOP Conference Series: Materials Science and Engineering 83: 012014.
   Google Scholar
• Kovacs, Attila A., Sophie N. Parragh, Karl F. Doerner, and Richard F. Hartl. 2012. “Adaptive Large Neighborhood Search for Service Technician Routing and Scheduling Problems.” Journal of Scheduling15 (5): 579–600.
   Web of Science ®Google Scholar
• Kruber, Markus, Marco E. Lübbecke, and Axel Parmentier. 2017. “Learning When to Use a Decomposition.” In Integration of AI and OR Techniques in Constraint Programming, edited by Domenico Salvagnin and Michele Lombardi, Vol. 10335, 202–210. Cham: Springer International Publishing.
   Google Scholar
• Kubra, Ekiz Melike, Bozdemir Muhammet, and Turkkan Burcu Ozcan. 2019. “Route First-Cluster Second Method For Personal Service Routing Problem.” Journal of Engineering Studies and Research 25 (2): 18–24.
   Google Scholar
• Kucharska, Edyta. 2019. “Dynamic Vehicle Routing Problem: Predictive and Unexpected Customer Availability.” Symmetry 11 (4): 546.
   Google Scholar
• Lahyani, Rahma, Anne-Lise Gouguenheim, and Leandro C. Coelho. 2019. “A Hybrid Adaptive Large Neighbourhood Search for Multi-depot Open Vehicle Routing Problems.” International Journal of Production Research 57 (22): 6963–6976.
   Web of Science ®Google Scholar
• Laporte, Gilbert, Roberto Musmanno, and Francesca Vocaturo. 2010. “An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands.” Transportation Science 44 (1): 125–135.
   Web of Science ®Google Scholar
• Leng, Longlong, Yanwei Zhao, Zheng Wang, Jingling Zhang, Wanliang Wang, and Chunmiao Zhang. 2019. “A Novel Hyper-Heuristic for the Biobjective Regional Low-Carbon Location-Routing Problem with Multiple Constraints.” Sustainability 11 (6): 1596.
   Web of Science ®Google Scholar
• Li, Xia, Ruibin Bai, Peer-Olaf Siebers, and Christian Wagner. 2019. “Travel Time Prediction in Transport and Logistics.” VINE Journal of Information and Knowledge Management Systems 49 (3): 277–306.
   Web of Science ®Google Scholar
• Li, Zhuwen, Qifeng Chen, and Vladlen Koltun. 2018. “Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search.” In Advances in Neural Information Processing Systems, Vol. 2018-December, 539–548. http://arxiv.org/abs/1810.10659
   Google Scholar
• Li, Jingwen, Yining Ma, Ruize Gao, Zhiguang Cao, Andrew Lim, Wen Song, and Jie Zhang. 2021. “Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem.” IEEE Transactions on Cybernetics. https://doi.org/10.1109/TCYB.2021.3111082
   Web of Science ®Google Scholar
• Li, Xiangyong, Peng Tian, and Stephen C. H. Leung. 2010. “Vehicle Routing Problems with Time Windows and Stochastic Travel and Service Times: Models and Algorithm.” International Journal of Production Economics 125 (1): 137–145.
   Web of Science ®Google Scholar
• Li, Xijun, Mingxuan Yuan, Di Chen, Jianguo Yao, and Jia Zeng. 2018. “A Data-Driven Three-Layer Algorithm for Split Delivery Vehicle Routing Problem with 3D Container Loading Constraint.” In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 528–536.
   Google Scholar
• Liu, Bingbing, Xiaolong Guo, Yugang Yu, and Qiang Zhou. 2019. “Minimizing the Total Completion Time of An Urban Delivery Problem with Uncertain Assembly Time.” Transportation Research Part E-Logistics and Transportation Review 132: 163–182.
   Web of Science ®Google Scholar
• Liu, Yuxin, Yi Mei, Mengjie Zhang, and Zili Zhang. 2017. “Automated Heuristic Design Using Genetic Programming Hyper-heuristic for Uncertain Capacitated arc Routing Problem.” In Proceedings of the Genetic and Evolutionary Computation Conference, 290–297.
   Google Scholar
• Lodi, Andrea, and Giulia Zarpellon. 2017. “On Learning and Branching: a Survey.” TOP 25 (2): 207–236.
   Web of Science ®Google Scholar
• Lu, Hao, Xingwen Zhang, and Shuang Yang. 2020. “A Learning-based Iterative Method for Solving Vehicle Routing Problems.” In ICLR, 15.
   Google Scholar
• Luo, Jianping, and Min-Rong Chen. 2014. “Multi-phase Modified Shuffled Frog Leaping Algorithm with Extremal Optimization for the MDVRP and the MDVRPTW.” Computers & Industrial Engineering72: 84–97.
   Web of Science ®Google Scholar
• Ma, Qiang, Suwen Ge, Danyang He, Darshan Thaker, and Iddo Drori. 2020. “Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning.” In AAAI Workshop on Deep Learning on Graphs: Methodologies and Applications. https://arxiv.org/pdf/1911.04936.pdf
   Google Scholar
• MacLachlan, Jordan, Yi Mei, Juergen Branke, and Mengjie Zhang. 2020. “Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems.” Evolutionary Computation 28 (4): 563–593.
   PubMed Web of Science ®Google Scholar
• Markovic, H., I. Cavar, and T. Caric. 2005. “Using Data Mining to Forecast Uncertain Demands in Stochastic Vehicle Routing Problem.” In 13th International Symposium on Elecronics in Transport (ISEP), Slovenia, 1–6.
   Google Scholar
• Masson, Renaud, Fabien Lehuede, and Olivier Peton. 2013. “An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers.” Transportation Science 47 (3): 344–355.
   Web of Science ®Google Scholar
• Mendoza, J. E., C. Gueret, M. Hoskins, H. Lobit, and D. Vigo. 2014. “VRP-REP: The Vehicle Routing Community Repository.” In Third Meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization (VeRoLog).
   Google Scholar
• Menger, Karl. 1932. “Das Botenproblem.” Ergebnisse Eines Mathematischen Kolloquiums 2 (4): 11–12.
   Google Scholar
• Miranda-Bront, Juan José, Brian Curcio, Isabel Méndez-Díaz, Agustín Montero, Federico Pousa, and Paula Zabala. 2017. “A Cluster-first Route-second Approach for the Swap Body Vehicle Routing Problem.” Annals of Operations Research 253 (2): 935–956.
   Web of Science ®Google Scholar
• Mladenović, Nenad, and Pierre Hansen. 1997. “Variable Neighborhood Search.” Computers & Operations Research 24 (11): 1097–1100.
   Web of Science ®Google Scholar
• Moll, R. N., A. G. Barto, T. J. Perkins, and R. S. Sutton. 1998. “Learning Instance-Independent Value Functions to Enhance Local Search.” In Neural Information Processing Systems, 1017–1023.
   Google Scholar
• Montoya, Jose A., Christelle Guéret, Jorge E. Mendoza, and Juan G. Villegas. 2014. “A Route-First Cluster-Second Heuristic for the Green Vehicle Routing Problem.” In ROADEF2014, Bordeaux, France, February. Accessed 2 October 2020. https://hal.archives-ouvertes.fr/hal-00946492
   Google Scholar
• Moradi, Behzad. 2020. “The New Optimization Algorithm for the Vehicle Routing Problem with Time Windows Using Multi-objective Discrete Learnable Evolution Model.” Soft Computing 24 (9, SI): 6741–6769.
   Web of Science ®Google Scholar
• Musolino, Giuseppe, Antonio Polimeni, Corrado Rindone, and Antonino Vitetta. 2013. “Travel Time Forecasting and Dynamic Routes Design for Emergency Vehicles.” Procedia-Social and Behavioral Sciences 87: 193–202.
   Google Scholar
• Nallusamy, R., K. Duraiswamy, R. Dhanalaksmi, and P. Parthiban. 2010. “Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms.” http://arxiv.org/abs/1001.4197
   Google Scholar
• Nazari, Mohammadreza, Afshin Oroojlooy, Lawrence V. Snyder, and Martin Takac. 2018. “Reinforcement Learning for Solving the Vehicle Routing Problem.” https://arxiv.org/abs/1802.04240
   Google Scholar
• Nguyen, Minh Anh, Kazushi Sano, and Vu Tu Tran. 2020. “A Monte Carlo Tree Search for Traveling Salesman Problem with Drone.” Asian Transport Studies 6: 100028.
   Google Scholar
• Ning, Chao, and Fengqi You. 2018. “Data-driven Stochastic Robust Optimization: General Computational Framework and Algorithm Leveraging Machine Learning for Optimization Under Uncertainty in the Big Data Era.” Computer & Chemical Engineering 111 (4): 115–133.
   Web of Science ®Google Scholar
• Nowak, Alex, Soledad Villar, Afonso S. Bandeira, and Joan Bruna. 2017. “A Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks.” https://arxiv.org/abs/1706.07450v1.
   Google Scholar
• Ouyang, Wenbin, Yisen Wang, Shaochen Han, Zhejian Jin, and Paul Weng. 2021. “Improving Generalization of Deep Reinforcement Learning-based TSP Solvers.” In IEEE SSCI ADPRL.
   Google Scholar
• Ouyang, Wenbin, Yisen Wang, Paul Weng, and Shaochen Han. 2021. “Generalization in Deep RL for TSP Problems via Equivariance and Local Search.” https://arxiv.org/abs/2110.03595
   Google Scholar
• Pandiri, Venkatesh, and Alok Singh. 2018. “A Hyper-heuristic Based Artificial Bee Colony Algorithm for K-Interconnected Multi-depot Multi-traveling Salesman Problem.” Information Sciences 463: 261–281.
   Web of Science ®Google Scholar
• Parragh, Sophie N., and Jean-Francois Cordeau. 2017. “Branch-and-price and Adaptive Large Neighborhood Search for the Truck and Trailer Routing Problem with Time Windows.” Computers & Operations Research 83: 28–44.
   Web of Science ®Google Scholar
• Peng, Bo, Jiahai Wang, and Zizhen Zhang. 2020. “A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems.” In Artificial Intelligence Algorithms and Applications, edited by Kangshun Li, Wei Li, Hui Wang, and Yong Liu, Communications in Computer and Information Science, Singapore, 636–650. Springer.
   Google Scholar
• Pillac, Victor, Michel Gendreau, Christelle Gueret, and Andres L. Medaglia. 2013. “A Review of Dynamic Vehicle Routing Problems.” European Journal of Operational Research 225 (1): 1–11.
   Web of Science ®Google Scholar
• Pisinger, David, and Stefan Ropke. 2010. “Large Neighborhood Search.” In Handbook of Metaheuristics, 399–419. Springer.
   Google Scholar
• Potvin, Jean-Yves, Guy Lapalme, and Jean-Marc Rousseau. 1990. “Integration of AI and OR Techniques for Computer-aided Algorithmic Design in the Vehicle Routing Domain.” Journal of the Operational Research Society 41 (6): 517–525.
   Web of Science ®Google Scholar
• Pour, Shahrzad M., John H. Drake, and Edmund K. Burke. 2018. “A Choice Function Hyper-heuristic Framework for the Allocation of Maintenance Tasks in Danish Railways.” Computers & Operations Research 93: 15–26.
   Web of Science ®Google Scholar
• Prates, Marcelo O. R., Pedro H. C. Avelar, Henrique Lemos, Luis Lamb, and Moshe Vardi. 2019. “Learning to Solve NP-Complete Problems - A Graph Neural Network for Decision TSP.” In AAAI. http://arxiv.org/abs/1809.02721
   Google Scholar
• Qi, Mingyao, Guoxiang Ding, You Zhou, and Lixin Miao. 2011. “Vehicle Routing Problem with Time Windows Based on Spatiotemporal Distance.” Journal of Transportation Systems Engineering and Information Technology 11 (1): 85–89.
   Google Scholar
• Qi, Charles R., Hao Su, Kaichun Mo, and Leonidas J. Guibas. 2017. “PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation.” In Proceedings - 30th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017.
   Google Scholar
• Qin, Wei, Zilong Zhuang, Zizhao Huang, and Haozhe Huang. 2021. “A Novel Reinforcement Learning-based Hyper-heuristic for Heterogeneous Vehicle Routing Problem.” Computers & Industrial Engineering 156: 107252.
   Web of Science ®Google Scholar
• Qiu, Ling, Wen-Jing Hsu, Shell-Ying Huang, and Han Wang. 2002. “Scheduling and Routing Algorithms for AGVs: a Survey.” International Journal of Production Research 40 (3): 745–760.
   Web of Science ®Google Scholar
• Qu, Yuan, and Jonathan F. Bard. 2012. “A GRASP with Adaptive Large Neighborhood Search for Pickup and Delivery Problems with Transshipment.” Computers & Operations Research 39 (10): 2439–2456.
   Web of Science ®Google Scholar
• Ralphs, Ted K., Leonid Kopman, William R. Pulleyblank, and Leslie E. Trotter. 2003. “On the Capacitated Vehicle Routing Problem.” Mathematical Programming 94 (2-3): 343–359.
   Web of Science ®Google Scholar
• Rautela, Anubha, S. K. Sharma, and P. Bhardwaj. 2019. “Distribution Planning Using Capacitated Clustering and Vehicle Routing Problem: A Case of Indian Cooperative Dairy.” Journal of Advances in Management Research 16 (5): 781–795.
   Web of Science ®Google Scholar
• Reed, Martin, Aliki Yiannakou, and Roxanne Evering. 2014. “An Ant Colony Algorithm for the Multi-compartment Vehicle Routing Problem.” Applied Soft Computing 15: 169–176.
   Web of Science ®Google Scholar
• Regue, Robert, and Will Recker. 2014. “Proactive Vehicle Routing with Inferred Demand to Solve the Bikesharing Rebalancing Problem.” Transportation Research Part E: Logistics and Transportation Review 72: 192–209.
   Web of Science ®Google Scholar
• Ribeiro, Glaydston Mattos, and Gilbert Laporte. 2012. “An Adaptive Large Neighborhood Search Heuristic for the Cumulative Capacitated Vehicle Routing Problem.” Computers & Operations Research 39 (3): 728–735.
   Web of Science ®Google Scholar
• Ritzinger, Ulrike, and Jakob Puchinger. 2013. “Hybrid Metaheuristics for Dynamic and Stochastic Vehicle Routing.” In Hybrid Metaheuristics, edited by El-Ghazali Talbi, Vol. 434, 77–95. Berlin, Heidelberg: Springer Berlin Heidelberg.
   Google Scholar
• Ritzinger, Ulrike, Jakob Puchinger, and Richard F. Hartl. 2016. “A Survey on Dynamic and Stochastic Vehicle Routing Problems.” International Journal of Production Research 54 (1): 215–231.
   Web of Science ®Google Scholar
• Ropke, Stefan, and David Pisinger. 2006. “An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.” Transportation Science 40 (4): 455–472.
   Web of Science ®Google Scholar
• Sabar, Nasser R., Masri Ayob, Graham Kendall, and Rong Qu. 2013. “Grammatical Evolution Hyper-Heuristic for Combinatorial Optimization Problems.” Ieee Transactions on Evolutionary Computation 17 (6): 840–861.
   Web of Science ®Google Scholar
• Sabar, Nasser R., Masri Ayob, Graham Kendall, and Rong Qu. 2014. “A Dynamic Multiarmed Bandit-gene Expression Programming Hyper-heuristic for Combinatorial Optimization Problems.” IEEE Transactions on Cybernetics 45 (2): 217–228.
   PubMed Web of Science ®Google Scholar
• Sabar, Nasser R., Masri Ayob, Graham Kendall, and Rong Qu. 2015. “A Dynamic Multiarmed Bandit-Gene Expression Programming Hyper-Heuristic for Combinatorial Optimization Problems.” IEEE Transactions on Cybernetics 45 (2): 217–228.
   PubMed Web of Science ®Google Scholar
• Salama, Mohamed, and Sharan Srinivas. 2020. “Joint Optimization of Customer Location Clustering and Drone-based Routing for Last-mile Deliveries.” Transportation Research Part C: Emerging Technologies114: 620–642.
   Web of Science ®Google Scholar
• Secomandi, Nicola. 2000. “Comparing Neuro-dynamic Programming Algorithms for the Vehicle Routing Problem with Stochastic Demands.” Computers & Operations Research 27: 1201–1225.
   Web of Science ®Google Scholar
• Sheng, Yuxiang, Huawei Ma, and Wei Xia. 2020. “A Pointer Neural Network for the Vehicle Routing Problem with Task Priority and Limited Resources.” Information Technology And Control 49 (2): 237–248.
   Web of Science ®Google Scholar
• Shimomura, Masato, and Yasuhiro Takashima. 2016. “Application of Monte-Carlo Tree Search to Traveling-Salesman Problem.” In SASIMI.
   Google Scholar
• Silva, Maria A. L., Sergio R. D. Souza, Marcone J. F. Souza, and Ana L. C. Bazzan. 2019. “A Reinforcement Learning-based Multi-agent Framework Applied for Solving Routing and Scheduling Problems.” Expert Systems with Applications 131: 148–171.
   Web of Science ®Google Scholar
• Smith, Kate A. 1999. “Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research.” INFORMS Journal on Computing 11 (1): 15–34.
   Web of Science ®Google Scholar
• Snoeck, André, Daniel Merchán, and Matthias Winkenbach. 2020. “Route Learning: a Machine Learning-based Approach to Infer Constrained Customers in Delivery Routes.” Transportation Research Procedia 46: 229–236.
   Google Scholar
• Soria-Alcaraz, Jorge A., Gabriela Ochoa, Marco A. Sotelo-Figeroa, and Edmund K. Burke. 2017. “A Methodology for Determining An Effective Subset of Heuristics in Selection Hyper-heuristics.” European Journal of Operational Research 260 (3): 972–983.
   Web of Science ®Google Scholar
• Stützle, Thomas. 1999. Local Search Algorithms for Combinatorial Problems: Analysis, Improvements, and New Applications. Amsterdam: IOS Press.
   Google Scholar
• Sungur, Ilgaz, Fernando Ordóñez, and Maged Dessouky. 2008. “A Robust Optimization Approach for the Capacitated Vehicle Routing Problem with Demand Uncertainty.” IIE Transactions 40 (5): 509–523.
   Web of Science ®Google Scholar
• Talbi, El-Ghazali. 2016. “Combining Metaheuristics with Mathematical Programming, Constraint Programming and Machine Learning.” Annals of Operations Research 240 (1): 171–215.
   Web of Science ®Google Scholar
• Tanveer, Jawad, Amir Haider, Rashid Ali, and Ajung Kim. 2021. “Reinforcement Learning-Based Optimization for Drone Mobility in 5G and Beyond Ultra-Dense Networks.” Computers Materials & Continua 68 (3): 3807–3823.
   Web of Science ®Google Scholar
• Taş, Duygu, Nico Dellaert, Tom VanWoensel, and Ton De Kok. 2013. “Vehicle Routing Problem with Stochastic Travel Times Including Soft Time Windows and Service Costs.” Computers & Operations Research 40 (1): 214–224.
   Web of Science ®Google Scholar
• Taş, D., Michel Gendreau, Nico Dellaert, Tom Van Woensel, and A. G. De Kok. 2014. “Vehicle Routing with Soft Time Windows and Stochastic Travel Times: A Column Generation and Branch-and-price Solution Approach.” European Journal of Operational Research 236 (3): 789–799.
   Web of Science ®Google Scholar
• Tulabandhula, Theja, and Cynthia Rudin. 2014. “Robust Optimization using Machine Learning for Uncertainty Sets.” Working Paper.
   Google Scholar
• Tyasnurita, Raras, Ender Ozcan, and Robert John. 2017. “Learning Heuristic Selection using a Time Delay Neural Network for Open Vehicle Routing.” In 2017 IEEE Congress on Evolutionary Computation (CEC 2017), June.
   Google Scholar
• Ulmer, Marlin W., Justin C. Goodson, Dirk C. Mattfeld, and Barrett W. Thomas. 2020. “On Modeling Stochastic Dynamic Vehicle Routing Problems.” EURO Journal on Transportation and Logistics 9 (2): 100008.
   Web of Science ®Google Scholar
• Veliçković, Petar, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, and Yoshua Bengio. 2018. “Graph Attention Networks.” http://arxiv.org/abs/1710.10903
   Google Scholar
• Vidal, Thibaut, Gilbert Laporte, and Piotr Matl. 2020. “A Concise Guide to Existing and Emerging Vehicle Routing Problem Variants.” European Journal of Operational Research 286 (2): 401–416.
   Web of Science ®Google Scholar
• Vinyals, Oriol, Meire Fortunato, and Navdeep Jaitly. 2015. “Pointer Networks.” In Advances in Neural Information Processing Systems 28, edited by C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, 2692–2700. Curran Associates, Inc. http://papers.nips.cc/paper/5866-pointer-networks.pdf
   Google Scholar
• Vis, Iris F. A. 2006. “Survey of Research in the Design and Control of Automated Guided Vehicle Systems.” European Journal of Operational Research 170 (3): 677–709.
   Web of Science ®Google Scholar
• Voudouris, Christos, and Edward P. K. Tsang. 2003. ““Guided Local Search.” In Handbook of Metaheuristics, edited by Fred W. Glover and Gary A, 185–218. Springer, Boston, MA: Kochenberger publisher.
   Google Scholar
• Wang, Shaolin, Yi Mei, John Park, and Mengjie Zhang. 2019. “Evolving Ensembles of Routing Policies using Genetic Programming for Uncertain Capacitated Arc Routing Problem.” In 2019 IEEE Symposium Series on Computational Intelligence (SSCI), December, 1628–1635.
   Google Scholar
• Wang, Chunbao, Lin Wang, Jian Qin, Zhengzhi Wu, Lihong Duan, Zhongqiu Li, and Mequn Cao, et al. 2015. “Path Planning of Automated Guided Vehicles based on Improved A-Star Algorithm.” In 2015 IEEE International Conference on Information and Automation, 2071–2076. IEEE.
   Google Scholar
• Wen, Min, Jean-François Cordeau, Gilbert Laporte, and Jesper Larsen. 2010. “The Dynamic Multi-period Vehicle Routing Problem.” Computers & Operations Research 37 (9): 1615–1623.
   Web of Science ®Google Scholar
• Wu, Yaoxin, Wen Song, Zhiguang Cao, Jie Zhang, and Andrew Lim. 2020. “Learning Improvement Heuristics for Solving Routing Problems.” arXiv:1912.05784
   Google Scholar
• Wu, Hailin, Fengming Tao, Qingqing Qiao, and Mengjun Zhang. 2020. “A Chance-constrained Vehicle Routing Problem for Wet Waste Collection and Transportation Considering Carbon Emissions.” International Journal of Environmental Research and Public Health 17 (2): 458.
   PubMed Web of Science ®Google Scholar
• Xing, Z., and S. Tu. 2020. “A Graph Neural Network Assisted Monte Carlo Tree Search Approach to Traveling Salesman Problem.” IEEE Access 8: 108418–108428.
   Web of Science ®Google Scholar
• Xu, Haitao, Pan Pu, and Feng Duan. 2018. “Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization.” Discrete Dynamics in Nature and Society 2018: 1–13.
   Web of Science ®Google Scholar
• Yang, Feidiao, Tiancheng Jin, Tie-Yan Liu, Xiaoming Sun, and Jialin Zhang. 2018. “Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems.” In ICML, Vol. 95, 726–739.
   Google Scholar
• Yao, Yuan, Zhe Peng, and Bin Xiao. 2018. “Parallel Hyper-Heuristic Algorithm for Multi-Objective Route Planning in a Smart City.” IEEE Transactions on Vehicular Technology 67 (11): 10307–10318.
   Web of Science ®Google Scholar
• Yao, Yu, Xiaoning Zhu, Hongyu Dong, Shengnan Wu, Hailong Wu, Lu Carol Tong, and Xuesong Zhou. 2019. “ADMM-based Problem Decomposition Scheme for Vehicle Routing Problem with Time Windows.” Transportation Research Part B: Methodological 129: 156–174.
   Web of Science ®Google Scholar
• Yu, James J. Q., Wen Yu, and Jiatao Gu. 2019. “Online Vehicle Routing With Neural Combinatorial Optimization and Deep Reinforcement Learning.” IEEE Transactions on Intelligent Transportation Systems 20 (10): 3806–3817.
   Web of Science ®Google Scholar
• Yücenur, G. Nilay, and Nihan Çetin Demirel. 2011. “A New Geometric Shape-based Genetic Clustering Algorithm for the Multi-depot Vehicle Routing Problem.” Expert Systems with Applications38 (9): 11859–11865.
   Web of Science ®Google Scholar
• Zantalis, Fotios, Grigorios Koulouras, Sotiris Karabetsos, and Dionisis Kandris. 2019. “A Review of Machine Learning and IoT in Smart Transportation.” Future Internet 11 (4): 94.
   Web of Science ®Google Scholar
• Zhang, C., N. P. Dellaert, L. Zhao, T. Van Woensel, and Derya Sever. 2013. “Single Vehicle Routing with Stochastic Demands: Approximate Dynamic Programming.” Tech. Rep. 425. Beijing, China: Department of Industrial Engineering, Tsinghua University.
   Google Scholar
• Zhang, Ke, Fang He, Zhengchao Zhang, Xi Lin, and Meng Li. 2020. “Multi-vehicle Routing Problems with Soft Time Windows: A Multi-agent Reinforcement Learning Approach.” Transportation Research Part C: Emerging Technologies 121: 102861.
   Web of Science ®Google Scholar
• Zhang, Junlong, William H. K. Lam, and Bi Yu Chen. 2013. “A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-off Between Cost and Customer Service.” Networks and Spatial Economics 13 (4): 471–496.
   Web of Science ®Google Scholar
• Zhang, Yan, Ling-ling Li, Hsiung-Cheng Lin, Zewen Ma, and Jiang Zhao. 2019. “Development of Path Planning Approach Using Improved A-star Algorithm in AGV System.” Journal of Internet Technology20 (3): 915–924.
   Web of Science ®Google Scholar
• Zhang, Junping, Fei-Yue Wang, Kunfeng Wang, Wei-Hua Lin, Xin Xu, and Cheng Chen. 2011. “Data-Driven Intelligent Transportation Systems: A Survey.” IEEE Transactions on Intelligent Transportation Systems 12 (4): 1624–1639.
   Web of Science ®Google Scholar
• Zulj, Ivan, Sergej Kramer, and Michael Schneider. 2018. “A Hybrid of Adaptive Large Neighborhood Search and Tabu Search for the Order-batching Problem.” European Journal of Operational Research264 (2): 653–664.
   Web of Science ®Google Scholar
• Žunić, Emir, Dženana Ðonko, and Emir Buza. 2020. “An Adaptive Data-driven Approach to Solve Real-world Vehicle Routing Problems in Logistics.” Complexity 2020. https://doi.org/10.1155/2020/7386701
   Web of Science ®Google Scholar