Publisher
Springer Nature Switzerland
Reference31 articles.
1. Solomon’s benchmark instances (2008). https://www.sintef.no/projectweb/top/vrptw/solomon-benchmark/. Accessed 30 Mar 2023
2. Abdoun, O., Abouchabaka, J., Tajani, C.: Analyzing the performance of mutation operators to solve the travelling salesman problem. arXiv preprint arXiv:1203.3099 (2012)
3. Arnold, F., Santana, Í., Sörensen, K., Vidal, T.: PILS: exploring high-order neighborhoods by pattern mining and injection. Pattern Recogn. 116, 107957 (2021)
4. Arnold, F., Sörensen, K.: Knowledge-guided local search for the vehicle routing problem. Comput. Oper. Res. 105, 32–46 (2019)
5. Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3), 756–763 (2010)