The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics

Frank Neumann; Helen Yuliana Angmalisang

arxiv: 2604.06724 · v1 · submitted 2026-04-08 · 💻 cs.NE · cs.AI

The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics

Helen Yuliana Angmalisang , Frank Neumann This is my paper

Pith reviewed 2026-05-10 17:55 UTC · model grok-4.3

classification 💻 cs.NE cs.AI

keywords traveling thief problemtime windowsheuristicsbenchmark instancesmulti-component optimizationtraveling salesperson problemcombinatorial optimization

0 comments

The pith

A new heuristic for the traveling thief problem with time windows outperforms adaptations of existing TTP and TSP methods on new benchmark instances.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces time window constraints to the traveling thief problem so that items can only be collected during specific time intervals. It generates new benchmark instances by extending existing TTP problems to include these timing rules. Adaptations of standard TTP solvers and TSP-with-time-windows methods are tested on the new instances. A custom heuristic is developed that directly addresses the combined tour-planning and timed-collection decisions. Experiments show this new heuristic produces better solutions than the adapted approaches across a wide range of the generated test cases.

Core claim

We examine adaptions of existing approaches for TTP and the Traveling Salesperson Problem with time windows to this new problem and evaluate their performance. Furthermore, we provide a new heuristic approach for the TTP with time windows. To evaluate algorithms for TTP with time windows, we introduce new TTP benchmark instances with time windows based on TTP instances existing in the literature. Our experimental investigations evaluate the different approaches and show that the newly designed algorithm outperforms the other approaches on a wide range of benchmark instances.

What carries the argument

A new heuristic that jointly plans the thief's tour and selects collection times to respect the added time-window constraints on item pickup.

Load-bearing premise

The newly generated benchmark instances with time windows are representative of real-world scenarios and that the performance comparisons fairly reflect algorithmic merit without implementation biases or insufficient statistical testing.

What would settle it

An independent reimplementation of one of the adapted methods that matches or exceeds the new heuristic's objective values on the same benchmark set, or a test on actual logistics data with documented time windows showing no consistent advantage.

read the original abstract

While traditional optimization problems were often studied in isolation, many real-world problems today require interdependence among multiple optimization components. The traveling thief problem (TTP) is a multi-component problem that has been widely studied in the literature. In this paper, we introduce and investigate the TTP with time window constraints which provides a TTP variant highly relevant to real-world situations where good can only be collected at given time intervals. We examine adaptions of existing approaches for TTP and the Traveling Salesperson Problem (TSP) with time windows to this new problem and evaluate their performance. Furthermore, we provide a new heuristic approach for the TTP with time windows. To evaluate algorithms for TTP with time windows, we introduce new TTP benchmark instances with time windows based on TTP instances existing in the literature. Our experimental investigations evaluate the different approaches and show that the newly designed algorithm outperforms the other approaches on a wide range of benchmark instances.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper defines TTP with time windows, supplies new benchmarks derived from existing instances, and reports a custom heuristic beating adapted baselines on them.

read the letter

The main thing to know is that this work adds time-window constraints to the traveling thief problem, builds a set of benchmark instances from prior TTP data, and introduces a heuristic that the authors say beats straightforward adaptations of existing TTP and TSP-with-time-windows methods across those instances. That extension makes sense for applications where collection or delivery is only possible in certain intervals, and the benchmark generation step gives the community something concrete to test against without starting from zero. The abstract frames the evaluation as direct empirical comparison, which is the right way to present a new variant. The soft spots sit in the experimental details. The outperformance claim will only be convincing if the paper shows that the baseline methods received equivalent implementation effort and tuning, that results come from multiple runs with reported variance or statistical tests rather than single best values, and that the procedure for adding time windows to the original instances does not inadvertently favor the new heuristic's search bias. If those checks are present and clean, the result is usable; if they are thin, the superiority could be an artifact. This paper is for people already working on the traveling thief problem or similar interdependent routing tasks. A reader in that niche gets immediate value from the problem statement and the instance set for their own experiments. It deserves a serious referee because the core formulation and the benchmarks are straightforward additions that others can build on, even if the heuristic itself needs closer scrutiny on the comparison protocol. I would send it to peer review.

Referee Report

2 major / 1 minor

Summary. The paper introduces the Traveling Thief Problem with Time Windows (TW-TTP) as a realistic extension of the classic TTP that adds time-window constraints on item collection. It generates new benchmark instances by augmenting existing TTP instances with time windows, adapts several TTP and TSP-with-time-windows heuristics to the new setting, proposes a novel heuristic for TW-TTP, and reports experimental results claiming that this new heuristic outperforms the adapted baselines across a wide range of the introduced instances.

Significance. If the reported superiority is shown to be robust, the work is significant because it supplies the first publicly available TW-TTP benchmark set and a competitive baseline heuristic for a multi-component problem that incorporates temporal feasibility. These artifacts directly support research on interdependent optimization problems arising in logistics and scheduling. The paper also earns credit for creating new instances and for attempting direct empirical comparison rather than relying on parameter fitting.

major comments (2)

[§5] §5 (Experimental investigations): the central claim that the new heuristic outperforms adapted TTP and TSP-with-time-windows methods rests on comparisons whose fairness is not demonstrated; the text does not report whether all competitors received comparable implementation effort, tuning budgets, or the same number of independent runs with variance statistics and significance tests.
[§3] §3 (Benchmark generation): the procedure used to add time windows to existing TTP instances is not accompanied by an analysis showing that the resulting difficulty distribution does not inadvertently favor the search bias of the newly proposed heuristic; without such controls the headline superiority result could be an artifact of instance construction.

minor comments (1)

[Abstract] The abstract and §5 could quantify the number of instances, the magnitude of the observed profit/time improvements, and the precise performance metric (e.g., average profit, feasibility rate) used to declare outperformance.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed review of our manuscript. We have carefully considered the major comments and provide point-by-point responses below, indicating where we will revise the paper to address the concerns raised.

read point-by-point responses

Referee: [§5] §5 (Experimental investigations): the central claim that the new heuristic outperforms adapted TTP and TSP-with-time-windows methods rests on comparisons whose fairness is not demonstrated; the text does not report whether all competitors received comparable implementation effort, tuning budgets, or the same number of independent runs with variance statistics and significance tests.

Authors: We agree that additional transparency on the experimental protocol is necessary to substantiate the fairness of the comparisons. In the revised manuscript we will expand Section 5 with a dedicated subsection on experimental setup. This will detail the implementation effort invested in each competitor (including code structure and optimization techniques), the tuning budgets and procedures applied to all methods, the exact number of independent runs performed, the reported variance statistics, and the results of statistical significance tests (e.g., Wilcoxon signed-rank tests with p-values) comparing the new heuristic against the baselines. revision: yes
Referee: [§3] §3 (Benchmark generation): the procedure used to add time windows to existing TTP instances is not accompanied by an analysis showing that the resulting difficulty distribution does not inadvertently favor the search bias of the newly proposed heuristic; without such controls the headline superiority result could be an artifact of instance construction.

Authors: The time windows were generated by extending the existing TTP instances using a deterministic procedure based on tour length estimates and item value distributions to produce realistic temporal constraints. While the original submission did not include a formal difficulty analysis, we recognize its value for ruling out construction bias. In the revision we will augment Section 3 with an analysis of instance difficulty, reporting metrics such as the fraction of feasible random tours, the distribution of time-window tightness, and the correlation between instance features and solver performance across a range of heuristics. This will demonstrate that the benchmark set spans diverse difficulty levels without systematic favoritism toward the proposed heuristic's search bias. revision: yes

Circularity Check

0 steps flagged

No circularity: empirical outperformance rests on new benchmarks and direct comparisons

full rationale

The paper introduces TTP with time windows as a new variant, generates benchmark instances by extending existing TTP data with time windows, adapts prior TTP and TSP-with-time-windows methods, and presents a new heuristic. All performance claims are obtained via direct experimental runs on the generated instances. No equations, parameters, or uniqueness results are defined in terms of the target outcomes; the derivation chain (problem definition → instance generation → heuristic design → empirical evaluation) remains self-contained and does not reduce any result to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based solely on the abstract; no explicit free parameters, axioms, or invented entities are described. The new heuristic likely incorporates tunable parameters for time-window handling and item selection, but details are absent.

pith-pipeline@v0.9.0 · 5458 in / 1042 out tokens · 27686 ms · 2026-05-10T17:55:22.065914+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We propose a set of evolutionary algorithms, named Dual Search Evolutionary Algorithm (DSEA), that utilize a new tour initialization algorithm, modified operators, and different packing plan repair approaches.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

The objective of this problem is to find a tour Π = (x1, x2, ..., xn) and a packing plan P to maximize profit.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

31 extracted references · 31 canonical work pages

[1]

URLhttps://doi.org/10.3141/2484-08

doi:10.3141/2484-08. URLhttps://doi.org/10.3141/2484-08. Fan Pu, Zihao Li, Yifan Wu, Chaolun Ma, and Ruonan Zhao. Recent advances in disaster emergency response planning: Integrating optimization, machine learning, and simulation.Safety Emergency Science, 1(1):9590007,

work page doi:10.3141/2484-08
[2]

URL https://www.sciopen.com/article/10.26599/SES.2025.9590007

doi:10.26599/SES.2025.9590007. URL https://www.sciopen.com/article/10.26599/SES.2025.9590007. Fabio Henrique Martins Queiroz, Michele Ferreira Moreira, Silmara Scontre, Renata Abrão, Antonio Sergio da Silva, Miguel Ângelo Lellis Moreira, and Marcos dos Santos. Route optimization in home physiotherapy: A traveling salesman problem-based framework for healt...

work page doi:10.26599/ses.2025.9590007 2025
[3]

doi:https://doi.org/10.1016/j.procs.2025.08.107

ISSN 1877-0509. doi:https://doi.org/10.1016/j.procs.2025.08.107. URL https: //www.sciencedirect.com/science/article/pii/S1877050925024184. The 12th International Conference on Information Technology and Quantitative Management (ITQM 2025). Ryan Alshaikh and Akmal Abdelfatah. Optimization techniques in municipal solid waste management: A systematic review....

work page doi:10.1016/j.procs.2025.08.107 2025
[4]

keep trash off the ground

ISSN 2071-1050. doi:10.3390/su16156585. URL https://www.mdpi.com/ 2071-1050/16/15/6585. Shan-Huen Huang and Pei-Chun Lin. Vehicle routing–scheduling for municipal waste collection sys- tem under the “keep trash off the ground” policy.Omega, 55:24–37,

work page doi:10.3390/su16156585 2071
[5]

doi:https://doi.org/10.1016/j.omega.2015.02.004

ISSN 0305-0483. doi:https://doi.org/10.1016/j.omega.2015.02.004. URL https://www.sciencedirect.com/science/article/ pii/S0305048315000353. Mohammad Reza Bonyadi, Zbigniew Michalewicz, and Luigi Barone. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. InProceedings of the IEEE Congress on Evolu...

work page doi:10.1016/j.omega.2015.02.004 2015
[6]

URLhttps://doi.org/10.1109/CEC.2013.6557681

doi:10.1109/CEC.2013.6557681. URLhttps://doi.org/10.1109/CEC.2013.6557681. Mohammad Reza Bonyadi, Zbigniew Michalewicz, Michal Roman Przybylek, and Adam Wierzbicki. Socially in- spired algorithms for the travelling thief problem. In Dirk V . Arnold, editor,Genetic and Evolutionary Com- putation Conference, GECCO ’14, Vancouver, BC, Canada, July 12-16, 201...

work page doi:10.1109/cec.2013.6557681 2013
[7]

, urldate =

doi:10.1145/2576768.2598367. URLhttps://doi.org/10.1145/2576768.2598367. Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, and Frank Neumann. A comprehensive benchmark set and heuristics for the traveling thief problem. In Dirk V . Arnold, editor,Genetic and Evolutionary Computation Conference, GECCO ’14, Vancouver, BC, Cana...

work page doi:10.1145/2576768.2598367 2014
[8]

URLhttps://doi.org/10.1145/2576768.2598249

doi:10.1145/2576768.2598249. URLhttps://doi.org/10.1145/2576768.2598249. Mohamed El Yafrani and Belaïd Ahiod. Population-based vs. single-solution heuristics for the travelling thief problem. In Tobias Friedrich, Frank Neumann, and Andrew M. Sutton, editors,Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 2...

work page doi:10.1145/2576768.2598249 2016
[9]

URLhttps://doi.org/10.1145/2908812.2908847

doi:10.1145/2908812.2908847. URLhttps://doi.org/10.1145/2908812.2908847. Alenrex Maity and Swagatam Das. Efficient hybrid local search heuristics for solving the travelling thief problem.Appl. Soft Comput., 93:106284,

work page doi:10.1145/2908812.2908847
[10]

URL https://doi.org/10.1016/j.asoc

doi:10.1016/J.ASOC.2020.106284. URL https://doi.org/10.1016/j.asoc. 2020.106284. Zitong Zhang, Lei Yang, Peipei Kang, Xiaotian Jia, and Wensheng Zhang. Solving the traveling thief prob- lem based on item selection weight and reverse-order allocation.IEEE Access, 9:54056–54066,

work page doi:10.1016/j.asoc.2020.106284 2020
[11]

IEEE Transactions on Knowledge and Data Engineering 34(12), 5586–5609 (2022)

doi:10.1109/ACCESS.2021.3070204. URLhttps://doi.org/10.1109/ACCESS.2021.3070204. 11 The TTP with Time Windows: Benchmarks and HeuristicsA PREPRINT Thilina Pathirage Don, Aneta Neumann, and Frank Neumann. Weighted-scenario optimisation for the chance constrained travelling thief problem. InIEEE Congress on Evolutionary Computation, CEC 2025, Hangzhou, Chin...

work page doi:10.1109/access.2021.3070204 2021
[12]

URL https://doi.org/10.1109/ CEC65147.2025.11043129

doi:10.1109/CEC65147.2025.11043129. URL https://doi.org/10.1109/ CEC65147.2025.11043129. Hoang Nguyen, Nam Le, Khang Tran, and Ngoc Hoang Luong. Simulated annealing with dynamic programming-based vertex insertion for efficiently solving the traveling thief problem. InProceedings of the 12th International Symposium on Information and Communication Technolo...

work page doi:10.1109/cec65147.2025.11043129 2025
[13]

URLhttps://doi.org/10.1145/3628797.3628990

doi:10.1145/3628797.3628990. URLhttps://doi.org/10.1145/3628797.3628990. Thilina Pathirage Don, Aneta Neumann, and Frank Neumann. The chance constrained travelling thief problem: Problem formulations and algorithms. In Xiaodong Li and Julia Handl, editors,Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Austr...

work page doi:10.1145/3628797.3628990 2024
[14]

URLhttps://doi.org/10.1145/3638529.3654014

doi:10.1145/3638529.3654014. URLhttps://doi.org/10.1145/3638529.3654014. Yi Mei, Xiaodong Li, and Xin Yao. Improving efficiency of heuristics for the large scale traveling thief problem. In Grant Dick, Will N. Browne, Peter A. Whigham, Mengjie Zhang, Lam Thu Bui, Hisao Ishibuchi, Yaochu Jin, Xiaodong Li, Yuhui Shi, Pramod Singh, Kay Chen Tan, and Ke Tang,...

work page doi:10.1145/3638529.3654014 2014
[15]

URL https://doi.org/10.1007/978-3-319-13563-2_53

doi:10.1007/978-3-319-13563-2_53. URL https://doi.org/10.1007/978-3-319-13563-2_53. Yi Mei, Xiaodong Li, Flora D. Salim, and Xin Yao. Heuristic evolution with genetic programming for traveling thief problem. InIEEE Congress on Evolutionary Computation, CEC 2015, Sendai, Japan, May 25-28, 2015, pages 2753–

work page doi:10.1007/978-3-319-13563-2_53 2015
[16]

URLhttps://doi.org/10.1109/CEC.2015.7257230

doi:10.1109/CEC.2015.7257230. URLhttps://doi.org/10.1109/CEC.2015.7257230. Daniel Kneipp S. Vieira, Gustavo L. Soares, João A. Vasconcelos, and Marcus Henrique Soares Mendes. A genetic algorithm for multi-component optimization problems: The case of the travelling thief problem. In Bin Hu and Manuel López-Ibáñez, editors,Evolutionary Computation in Combin...

work page doi:10.1109/cec.2015.7257230 2015
[17]

URL https://doi.org/10.1007/ 978-3-319-55453-2_2

doi:10.1007/978-3-319-55453-2_2. URL https://doi.org/10.1007/ 978-3-319-55453-2_2. Saad T. Alharbi. A Hybrid Genetic Algorithm with Tabu Search for Optimization of the Traveling Thief Problem. International Journal of Advanced Computer Science & Applications, 9(11):276–287, 2018a. ISSN 2158-107X. Adel Nikfarjam, Aneta Neumann, Jakob Bossek, and Frank Neum...

work page doi:10.1007/978-3-319-55453-2_2 2022
[18]

URLhttps://doi.org/10.1145/2739480.2754716

doi:10.1145/2739480.2754716. URLhttps://doi.org/10.1145/2739480.2754716. Markus Wagner, Marius Lindauer, Mustafa Misir, Samadhi Nallaperuma, and Frank Hutter. A case study of algorithm selection for the traveling thief problem.J. Heuristics, 24(3):295–320,

work page doi:10.1145/2739480.2754716
[19]

URL https://doi.org/10.1007/s10732-017-9328-y

doi:10.1007/S10732-017-9328-Y. URL https://doi.org/10.1007/s10732-017-9328-y. Mohamed El Yafrani and Belaïd Ahiod. Efficiently solving the traveling thief problem using hill climbing and simulated annealing.Inf. Sci., 432:231–244,

work page doi:10.1007/s10732-017-9328-y
[20]

URL https://doi.org/10.1016/j

doi:10.1016/J.INS.2017.12.011. URL https://doi.org/10.1016/j. ins.2017.12.011. 12 The TTP with Time Windows: Benchmarks and HeuristicsA PREPRINT Saad T. Alharbi. The design and development of a modified artificial bee colony approach for the traveling thief problem.Int. J. Appl. Evol. Comput., 9(3):32–47, 2018b. doi:10.4018/IJAEC.2018070104. URL https://d...

work page doi:10.1016/j.ins.2017.12.011 2017
[21]

URL https://doi.org/10.1016/j

doi:10.1016/J.COR.2021.105560. URL https://doi.org/10.1016/j. cor.2021.105560. Rogier Hans Wuijts and Dirk Thierens. Investigation of the traveling thief problem. In Anne Auger and Thomas Stützle, editors,Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, Prague, Czech Republic, July 13-17, 2019, pages 329–337. ACM,

work page doi:10.1016/j.cor.2021.105560 2021
[22]

URL https: //doi.org/10.1145/3321707.3321766

doi:10.1145/3321707.3321766. URL https: //doi.org/10.1145/3321707.3321766. Keld Helsgaun. An extension of the lin -kernighan-helsgaun tsp solver for constrained travel- ing salesman and vehicle routing problems. Technical Report Technical Report, Roskilde Uni- versity, Roskilde, Denmark,

work page doi:10.1145/3321707.3321766
[23]

URLhttps://doi.org/10.1287/opre.21.2.498

doi:10.1287/OPRE.21.2.498. URLhttps://doi.org/10.1287/opre.21.2.498. Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, and Chu-Min Li. Combining reinforcement learning with lin- kernighan-helsgaun algorithm for the traveling salesman problem. InThirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applicat...

work page doi:10.1287/opre.21.2.498 2021
[24]

URL https://doi.org/10

doi:10.1609/AAAI.V35I14.17476. URL https://doi.org/10. 1609/aaai.v35i14.17476. Kalyanmoy Deb. An efficient constraint handling method for genetic algorithms.Computer Methods in Applied Mechan- ics and Engineering, 186(2):311–338,

work page doi:10.1609/aaai.v35i14.17476
[25]

doi:https://doi.org/10.1016/S0045-7825(99)00389-8

ISSN 0045-7825. doi:https://doi.org/10.1016/S0045-7825(99)00389-8. URLhttps://www.sciencedirect.com/science/article/pii/S0045782599003898. Xin-Xin Liu, Dong Liu, Qiang Yang, Xiao-Fang Liu, Wei-Jie Yu, and Jun Zhang. Comparative analysis of five local search operators on visiting constrained multiple traveling salesmen problem. InIEEE Symposium Series on C...

work page doi:10.1016/s0045-7825(99)00389-8 2021
[26]

Badour, J

doi:10.1109/SSCI50451.2021.9659963. URLhttps://doi.org/10.1109/SSCI50451.2021.9659963. Yvan Dumas, Jacques Desrosiers, Éric Gélinas, and Marius M. Solomon. An optimal algorithm for the traveling salesman problem with time windows.Oper. Res., 43(2):367–371,

work page doi:10.1109/ssci50451.2021.9659963 2021
[27]

URL https://doi.org/10.1287/opre.43.2.367

doi:10.1287/OPRE.43.2.367. URL https://doi.org/10.1287/opre.43.2.367. Jieyi Bi, Yining Ma, Jianan Zhou, Wen Song, Zhiguang Cao, Yaoxin Wu, and Jie Zhang. Learning to handle complex constraints for vehicle routing problems. In Amir Globersons, Lester Mackey, Danielle Belgrave, Angela Fan, Ulrich Paquet, Jakub M. Tomczak, and Cheng Zhang, editors,Advances i...

work page doi:10.1287/opre.43.2.367 2024
[28]

Xuan Wang, Chunyi Ji, Hanrong Xu, and Kaiyi Guo

URL http://papers.nips.cc/paper_files/paper/2024/hash/ a9d2a5fd12d34250c21b5e4fa8d906b0-Abstract-Conference.html. Xuan Wang, Chunyi Ji, Hanrong Xu, and Kaiyi Guo. Research on dynamic optimization of takeout delivery routes considering food preparation time.Sustainability, 17(6),

work page 2024
[29]

doi:10.3390/su17062771

ISSN 2071-1050. doi:10.3390/su17062771. URL https://www.mdpi.com/2071-1050/17/6/2771. Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, and Chu-Min Li. Reinforced lin-kernighan-helsgaun algorithms for the traveling salesman problems.Knowl. Based Syst., 260:110144,

work page doi:10.3390/su17062771 2071
[30]

URLhttps://doi.org/10.1016/j.knosys.2022.110144

doi:10.1016/J.KNOSYS.2022.110144. URLhttps://doi.org/10.1016/j.knosys.2022.110144. Miha Ravber, Shih-Hsi Liu, Marjan Mernik, and Matej Crepinsek. Maximum number of generations as a stopping criterion considered harmful.Appl. Soft Comput., 128:109478,

work page doi:10.1016/j.knosys.2022.110144 2022
[31]

Maximum number of generations as a stopping criterion considered harmful,

doi:10.1016/J.ASOC.2022.109478. URL https://doi.org/10.1016/j.asoc.2022.109478. 13

work page doi:10.1016/j.asoc.2022.109478 2022

[1] [1]

URLhttps://doi.org/10.3141/2484-08

doi:10.3141/2484-08. URLhttps://doi.org/10.3141/2484-08. Fan Pu, Zihao Li, Yifan Wu, Chaolun Ma, and Ruonan Zhao. Recent advances in disaster emergency response planning: Integrating optimization, machine learning, and simulation.Safety Emergency Science, 1(1):9590007,

work page doi:10.3141/2484-08

[2] [2]

URL https://www.sciopen.com/article/10.26599/SES.2025.9590007

doi:10.26599/SES.2025.9590007. URL https://www.sciopen.com/article/10.26599/SES.2025.9590007. Fabio Henrique Martins Queiroz, Michele Ferreira Moreira, Silmara Scontre, Renata Abrão, Antonio Sergio da Silva, Miguel Ângelo Lellis Moreira, and Marcos dos Santos. Route optimization in home physiotherapy: A traveling salesman problem-based framework for healt...

work page doi:10.26599/ses.2025.9590007 2025

[3] [3]

doi:https://doi.org/10.1016/j.procs.2025.08.107

ISSN 1877-0509. doi:https://doi.org/10.1016/j.procs.2025.08.107. URL https: //www.sciencedirect.com/science/article/pii/S1877050925024184. The 12th International Conference on Information Technology and Quantitative Management (ITQM 2025). Ryan Alshaikh and Akmal Abdelfatah. Optimization techniques in municipal solid waste management: A systematic review....

work page doi:10.1016/j.procs.2025.08.107 2025

[4] [4]

keep trash off the ground

ISSN 2071-1050. doi:10.3390/su16156585. URL https://www.mdpi.com/ 2071-1050/16/15/6585. Shan-Huen Huang and Pei-Chun Lin. Vehicle routing–scheduling for municipal waste collection sys- tem under the “keep trash off the ground” policy.Omega, 55:24–37,

work page doi:10.3390/su16156585 2071

[5] [5]

doi:https://doi.org/10.1016/j.omega.2015.02.004

ISSN 0305-0483. doi:https://doi.org/10.1016/j.omega.2015.02.004. URL https://www.sciencedirect.com/science/article/ pii/S0305048315000353. Mohammad Reza Bonyadi, Zbigniew Michalewicz, and Luigi Barone. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems. InProceedings of the IEEE Congress on Evolu...

work page doi:10.1016/j.omega.2015.02.004 2015

[6] [6]

URLhttps://doi.org/10.1109/CEC.2013.6557681

doi:10.1109/CEC.2013.6557681. URLhttps://doi.org/10.1109/CEC.2013.6557681. Mohammad Reza Bonyadi, Zbigniew Michalewicz, Michal Roman Przybylek, and Adam Wierzbicki. Socially in- spired algorithms for the travelling thief problem. In Dirk V . Arnold, editor,Genetic and Evolutionary Com- putation Conference, GECCO ’14, Vancouver, BC, Canada, July 12-16, 201...

work page doi:10.1109/cec.2013.6557681 2013

[7] [7]

, urldate =

doi:10.1145/2576768.2598367. URLhttps://doi.org/10.1145/2576768.2598367. Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, and Frank Neumann. A comprehensive benchmark set and heuristics for the traveling thief problem. In Dirk V . Arnold, editor,Genetic and Evolutionary Computation Conference, GECCO ’14, Vancouver, BC, Cana...

work page doi:10.1145/2576768.2598367 2014

[8] [8]

URLhttps://doi.org/10.1145/2576768.2598249

doi:10.1145/2576768.2598249. URLhttps://doi.org/10.1145/2576768.2598249. Mohamed El Yafrani and Belaïd Ahiod. Population-based vs. single-solution heuristics for the travelling thief problem. In Tobias Friedrich, Frank Neumann, and Andrew M. Sutton, editors,Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 2...

work page doi:10.1145/2576768.2598249 2016

[9] [9]

URLhttps://doi.org/10.1145/2908812.2908847

doi:10.1145/2908812.2908847. URLhttps://doi.org/10.1145/2908812.2908847. Alenrex Maity and Swagatam Das. Efficient hybrid local search heuristics for solving the travelling thief problem.Appl. Soft Comput., 93:106284,

work page doi:10.1145/2908812.2908847

[10] [10]

URL https://doi.org/10.1016/j.asoc

doi:10.1016/J.ASOC.2020.106284. URL https://doi.org/10.1016/j.asoc. 2020.106284. Zitong Zhang, Lei Yang, Peipei Kang, Xiaotian Jia, and Wensheng Zhang. Solving the traveling thief prob- lem based on item selection weight and reverse-order allocation.IEEE Access, 9:54056–54066,

work page doi:10.1016/j.asoc.2020.106284 2020

[11] [11]

IEEE Transactions on Knowledge and Data Engineering 34(12), 5586–5609 (2022)

doi:10.1109/ACCESS.2021.3070204. URLhttps://doi.org/10.1109/ACCESS.2021.3070204. 11 The TTP with Time Windows: Benchmarks and HeuristicsA PREPRINT Thilina Pathirage Don, Aneta Neumann, and Frank Neumann. Weighted-scenario optimisation for the chance constrained travelling thief problem. InIEEE Congress on Evolutionary Computation, CEC 2025, Hangzhou, Chin...

work page doi:10.1109/access.2021.3070204 2021

[12] [12]

URL https://doi.org/10.1109/ CEC65147.2025.11043129

doi:10.1109/CEC65147.2025.11043129. URL https://doi.org/10.1109/ CEC65147.2025.11043129. Hoang Nguyen, Nam Le, Khang Tran, and Ngoc Hoang Luong. Simulated annealing with dynamic programming-based vertex insertion for efficiently solving the traveling thief problem. InProceedings of the 12th International Symposium on Information and Communication Technolo...

work page doi:10.1109/cec65147.2025.11043129 2025

[13] [13]

URLhttps://doi.org/10.1145/3628797.3628990

doi:10.1145/3628797.3628990. URLhttps://doi.org/10.1145/3628797.3628990. Thilina Pathirage Don, Aneta Neumann, and Frank Neumann. The chance constrained travelling thief problem: Problem formulations and algorithms. In Xiaodong Li and Julia Handl, editors,Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Austr...

work page doi:10.1145/3628797.3628990 2024

[14] [14]

URLhttps://doi.org/10.1145/3638529.3654014

doi:10.1145/3638529.3654014. URLhttps://doi.org/10.1145/3638529.3654014. Yi Mei, Xiaodong Li, and Xin Yao. Improving efficiency of heuristics for the large scale traveling thief problem. In Grant Dick, Will N. Browne, Peter A. Whigham, Mengjie Zhang, Lam Thu Bui, Hisao Ishibuchi, Yaochu Jin, Xiaodong Li, Yuhui Shi, Pramod Singh, Kay Chen Tan, and Ke Tang,...

work page doi:10.1145/3638529.3654014 2014

[15] [15]

URL https://doi.org/10.1007/978-3-319-13563-2_53

doi:10.1007/978-3-319-13563-2_53. URL https://doi.org/10.1007/978-3-319-13563-2_53. Yi Mei, Xiaodong Li, Flora D. Salim, and Xin Yao. Heuristic evolution with genetic programming for traveling thief problem. InIEEE Congress on Evolutionary Computation, CEC 2015, Sendai, Japan, May 25-28, 2015, pages 2753–

work page doi:10.1007/978-3-319-13563-2_53 2015

[16] [16]

URLhttps://doi.org/10.1109/CEC.2015.7257230

doi:10.1109/CEC.2015.7257230. URLhttps://doi.org/10.1109/CEC.2015.7257230. Daniel Kneipp S. Vieira, Gustavo L. Soares, João A. Vasconcelos, and Marcus Henrique Soares Mendes. A genetic algorithm for multi-component optimization problems: The case of the travelling thief problem. In Bin Hu and Manuel López-Ibáñez, editors,Evolutionary Computation in Combin...

work page doi:10.1109/cec.2015.7257230 2015

[17] [17]

URL https://doi.org/10.1007/ 978-3-319-55453-2_2

doi:10.1007/978-3-319-55453-2_2. URL https://doi.org/10.1007/ 978-3-319-55453-2_2. Saad T. Alharbi. A Hybrid Genetic Algorithm with Tabu Search for Optimization of the Traveling Thief Problem. International Journal of Advanced Computer Science & Applications, 9(11):276–287, 2018a. ISSN 2158-107X. Adel Nikfarjam, Aneta Neumann, Jakob Bossek, and Frank Neum...

work page doi:10.1007/978-3-319-55453-2_2 2022

[18] [18]

URLhttps://doi.org/10.1145/2739480.2754716

doi:10.1145/2739480.2754716. URLhttps://doi.org/10.1145/2739480.2754716. Markus Wagner, Marius Lindauer, Mustafa Misir, Samadhi Nallaperuma, and Frank Hutter. A case study of algorithm selection for the traveling thief problem.J. Heuristics, 24(3):295–320,

work page doi:10.1145/2739480.2754716

[19] [19]

URL https://doi.org/10.1007/s10732-017-9328-y

doi:10.1007/S10732-017-9328-Y. URL https://doi.org/10.1007/s10732-017-9328-y. Mohamed El Yafrani and Belaïd Ahiod. Efficiently solving the traveling thief problem using hill climbing and simulated annealing.Inf. Sci., 432:231–244,

work page doi:10.1007/s10732-017-9328-y

[20] [20]

URL https://doi.org/10.1016/j

doi:10.1016/J.INS.2017.12.011. URL https://doi.org/10.1016/j. ins.2017.12.011. 12 The TTP with Time Windows: Benchmarks and HeuristicsA PREPRINT Saad T. Alharbi. The design and development of a modified artificial bee colony approach for the traveling thief problem.Int. J. Appl. Evol. Comput., 9(3):32–47, 2018b. doi:10.4018/IJAEC.2018070104. URL https://d...

work page doi:10.1016/j.ins.2017.12.011 2017

[21] [21]

URL https://doi.org/10.1016/j

doi:10.1016/J.COR.2021.105560. URL https://doi.org/10.1016/j. cor.2021.105560. Rogier Hans Wuijts and Dirk Thierens. Investigation of the traveling thief problem. In Anne Auger and Thomas Stützle, editors,Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, Prague, Czech Republic, July 13-17, 2019, pages 329–337. ACM,

work page doi:10.1016/j.cor.2021.105560 2021

[22] [22]

URL https: //doi.org/10.1145/3321707.3321766

doi:10.1145/3321707.3321766. URL https: //doi.org/10.1145/3321707.3321766. Keld Helsgaun. An extension of the lin -kernighan-helsgaun tsp solver for constrained travel- ing salesman and vehicle routing problems. Technical Report Technical Report, Roskilde Uni- versity, Roskilde, Denmark,

work page doi:10.1145/3321707.3321766

[23] [23]

URLhttps://doi.org/10.1287/opre.21.2.498

doi:10.1287/OPRE.21.2.498. URLhttps://doi.org/10.1287/opre.21.2.498. Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, and Chu-Min Li. Combining reinforcement learning with lin- kernighan-helsgaun algorithm for the traveling salesman problem. InThirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applicat...

work page doi:10.1287/opre.21.2.498 2021

[24] [24]

URL https://doi.org/10

doi:10.1609/AAAI.V35I14.17476. URL https://doi.org/10. 1609/aaai.v35i14.17476. Kalyanmoy Deb. An efficient constraint handling method for genetic algorithms.Computer Methods in Applied Mechan- ics and Engineering, 186(2):311–338,

work page doi:10.1609/aaai.v35i14.17476

[25] [25]

doi:https://doi.org/10.1016/S0045-7825(99)00389-8

ISSN 0045-7825. doi:https://doi.org/10.1016/S0045-7825(99)00389-8. URLhttps://www.sciencedirect.com/science/article/pii/S0045782599003898. Xin-Xin Liu, Dong Liu, Qiang Yang, Xiao-Fang Liu, Wei-Jie Yu, and Jun Zhang. Comparative analysis of five local search operators on visiting constrained multiple traveling salesmen problem. InIEEE Symposium Series on C...

work page doi:10.1016/s0045-7825(99)00389-8 2021

[26] [26]

Badour, J

doi:10.1109/SSCI50451.2021.9659963. URLhttps://doi.org/10.1109/SSCI50451.2021.9659963. Yvan Dumas, Jacques Desrosiers, Éric Gélinas, and Marius M. Solomon. An optimal algorithm for the traveling salesman problem with time windows.Oper. Res., 43(2):367–371,

work page doi:10.1109/ssci50451.2021.9659963 2021

[27] [27]

URL https://doi.org/10.1287/opre.43.2.367

doi:10.1287/OPRE.43.2.367. URL https://doi.org/10.1287/opre.43.2.367. Jieyi Bi, Yining Ma, Jianan Zhou, Wen Song, Zhiguang Cao, Yaoxin Wu, and Jie Zhang. Learning to handle complex constraints for vehicle routing problems. In Amir Globersons, Lester Mackey, Danielle Belgrave, Angela Fan, Ulrich Paquet, Jakub M. Tomczak, and Cheng Zhang, editors,Advances i...

work page doi:10.1287/opre.43.2.367 2024

[28] [28]

Xuan Wang, Chunyi Ji, Hanrong Xu, and Kaiyi Guo

URL http://papers.nips.cc/paper_files/paper/2024/hash/ a9d2a5fd12d34250c21b5e4fa8d906b0-Abstract-Conference.html. Xuan Wang, Chunyi Ji, Hanrong Xu, and Kaiyi Guo. Research on dynamic optimization of takeout delivery routes considering food preparation time.Sustainability, 17(6),

work page 2024

[29] [29]

doi:10.3390/su17062771

ISSN 2071-1050. doi:10.3390/su17062771. URL https://www.mdpi.com/2071-1050/17/6/2771. Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, and Chu-Min Li. Reinforced lin-kernighan-helsgaun algorithms for the traveling salesman problems.Knowl. Based Syst., 260:110144,

work page doi:10.3390/su17062771 2071

[30] [30]

URLhttps://doi.org/10.1016/j.knosys.2022.110144

doi:10.1016/J.KNOSYS.2022.110144. URLhttps://doi.org/10.1016/j.knosys.2022.110144. Miha Ravber, Shih-Hsi Liu, Marjan Mernik, and Matej Crepinsek. Maximum number of generations as a stopping criterion considered harmful.Appl. Soft Comput., 128:109478,

work page doi:10.1016/j.knosys.2022.110144 2022

[31] [31]

Maximum number of generations as a stopping criterion considered harmful,

doi:10.1016/J.ASOC.2022.109478. URL https://doi.org/10.1016/j.asoc.2022.109478. 13

work page doi:10.1016/j.asoc.2022.109478 2022