Abstract
This paper proposes a team orienteering problem with time windows considering multiple deliverymen (TOPTWMD), which arises from practical situations where firms deliver goods to customers in congested urban areas. In addition to the routing and scheduling decisions, the crew size for each route also has to be decided. Adapted from iterative three-component heuristic (I3CH), an enhanced heuristic is designed for this problem. Integrating two effective methods and the alteration between feasible and infeasible regions, the proposed heuristic finally consists of three components, including (i) an iterated local search in feasible region, (ii) a tabu search in infeasible region, and (iii) a route recombination for a high-quality solution. Besides, due to the particularity of deliverymen assignment, some adaptive changes must be made accordingly compared with the original I3CH. The TOPTWMD instances are generated by modifying the Solomon instances. To evaluate the performance of the enhanced heuristic, computational experiments are conducted on a set of 138 instances for comparing enhanced heuristic with CPLEX and original I3CH. Results demonstrate the effectiveness and the stability of the proposed algorithm. Moreover, additional analyses verify that the joint use of the three components and the alteration between feasible and infeasible regions make significant contributions to the performance of the enhanced heuristic.
This is a preview of subscription content, access via your institution.
Availability of data and material
Not applicable.
Code availability
Not applicable.
References
Alvarez A, Munari P (2017) An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen. Comput Oper Res 83:1–12. https://doi.org/10.1016/j.cor.2017.02.001
Alvarez A, Munari P, Morabito R (2018) Iterated local search and simulated annealing algorithms for the inventory routing problem. Int Trans Oper Res 25:1785–1809. https://doi.org/10.1111/itor.12547
Anaya Fuentes GE, Hernández Gress ES, Mora Seck Tuoh JC, Medina Marín J (2018) Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic. PLoS ONE 13:e0201868
Aringhieri R, Bigharaz S, Duma D, Guastalla A (2022) Novel applications of the team orienteering problem in health care logistics. In: Optimization in artificial intelligence and data sciences. Springer, pp 235–245
Brandão J (2020) A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur J Oper Res 284:559–571. https://doi.org/10.1016/j.ejor.2020.01.008
de Grancy GS (2015) An adaptive metaheuristic for vehicle routing problems with time windows and multiple service workers. J UCS 21:1168–1192
De La Vega J, Munari P, Morabito R (2020) Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen. Comput Oper Res 124(105062):20. https://doi.org/10.1016/j.cor.2020.105062
Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156–166
Goeke D (2019) Granular tabu search for the pickup and delivery problem with time windows and electric vehicles. Eur J Oper Res 278:821–836. https://doi.org/10.1016/j.ejor.2019.05.010
Guan J, Lin G, Feng HB (2018) A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem. Appl Soft Comput 73:230–241
Gunawan A, Ng KM, Kendall G, Lai J (2018) An iterated local search algorithm for the team orienteering problem with variable profits. Eng Optim 50:1148–1163. https://doi.org/10.1080/0305215X.2017.1417398
Hu Q, Lim A (2014) An iterative three-component heuristic for the team orienteering problem with time windows. Eur J Oper Res 232:276–286
Jackson J, Mei Y (2020) Genetic programming hyper-heuristic with cluster awareness for stochastic team orienteering problem with time windows. In: 2020 IEEE congress on evolutionary computation (CEC). IEEE, pp 1–8
Li M, Hao JK, Wu Q (2022) Learning-driven feasible and infeasible tabu search for airport gate assignment. Eur J Oper Res 302:172–186. https://doi.org/10.1016/j.ejor.2021.12.019
Máximo VR, Nascimento MCV (2021) A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem. Eur J Oper Res 294:1108–1119. https://doi.org/10.1016/j.ejor.2021.02.024
Munari P, Morabito R (2018) A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen. Top 26:437–464
Pureza V, Morabito R, Reimann M (2012) Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW. Eur J Oper Res 218:636–647. https://doi.org/10.1016/j.ejor.2011.12.005
Ruiz-Meza J, Brito J, Montoya-Torres JR (2021) A grasp to solve the multi-constraints multi-modal team orienteering problem with time windows for groups with heterogeneous preferences. Comput Ind Eng 162:107776
Saeedvand S, Aghdasi HS, Baltes J (2020) Novel hybrid algorithm for team orienteering problem with time windows for rescue applications. Appl Soft Comput 96:106700
Sluijk N, Visser TR, Spliet R, (2016) Implementation of the iterative three-component heuristic for the team orienteering problem with time windows
Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265. https://doi.org/10.1287/opre.35.2.254
Sousa MM, González PH, Ochi LS, Martins SdL (2021) A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection. Comput Oper Res 129:16. https://doi.org/10.1016/j.cor.2021.105229
Sun W, Hao JK, Lai X, Wu Q (2018) Adaptive feasible and infeasible tabu search for weighted vertex coloring. Inform Sci 466:203–219. https://doi.org/10.1016/j.ins.2018.07.037
Vincent FY, Jewpanya P, Lin SW, Redi AP (2019) Team orienteering problem with time windows and time-dependent scores. Comput Ind Eng 127:213–224
Wang W, Hao JK, Wu Q (2018) Tabu search with feasible and infeasible searches for equitable coloring. Eng Appl Artif Intell 71:1–14
Wang J, Guo J, Chen J, Tian S, Gu T (2019) Uncertain team orienteering problem with time windows based on uncertainty theory. IEEE Access 7:63403–63414
Xia Y, Fu Z, Pan L, Duan F (2018) Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order. PLoS ONE 13:e0195457
Funding
The authors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Su, X., Nan, H. An enhanced heuristic for the team orienteering problem with time windows considering multiple deliverymen. Soft Comput 27, 2853–2872 (2023). https://doi.org/10.1007/s00500-022-07577-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-022-07577-9
Keywords
- Enhanced heuristic
- Iterative three-component heuristic
- Team orienteering problem with time windows
- Multiple deliverymen