首页/论文/2004.12045

arXiv 2004.120452020-04cs.NE

The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms

Ragav Sachdeva, Frank Neumann, Markus Wagner

备注：: Accepted for publication and presentation at ICONIP 2020, https://iconip2020.apnns.org/

英文摘要：

Many real-world optimisation problems involve dynamic and stochastic components. While problems with multiple interacting components are omnipresent in inherently dynamic domains like supply-chain optimisation and logistics, most research on dynamic problems focuses on single-component problems. With this article, we define a number of scenarios based on the Travelling Thief Problem to enable research on the effect of dynamic changes to sub-components. Our investigations of 72 scenarios and seven algorithms show that -- depending on the instance, the magnitude of the change, and the algorithms in the portfolio -- it is preferable to either restart the optimisation from scratch or to continue with the previously valid solutions.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

机会约束旅行窃贼问题的加权场景优化

Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem

本研究提出使用有限数量的加权场景来刻画机会约束旅行窃贼问题，通过整合并适配经典TTP的进化算法与启发式程序，在满足背包约束的概率条件下最大化期望收益，并分析了算法性能及不确定性对解质量的影响。

2025-05-01cs.NE

Exact Approaches for the Travelling Thief Problem

Many evolutionary and constructive heuristic approaches have been introduced in order to solve the Traveling Thief Problem (TTP). However, the accuracy of such approaches is unknown due to their inability to find global optima. In this paper, we propose three exact algorithms and a hybrid approach to the TTP. We compare these with state-of-the-art approaches to gather a comprehensive overview on the accuracy of heuristic methods for solving small TTP instances.

2017-08-01cs.DScs.NE

Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem

Recently different evolutionary computation approaches have been developed that generate sets of high quality diverse solutions for a given optimisation problem. Many studies have considered diversity 1) as a mean to explore niches in behavioural space (quality diversity) or 2) to increase the structural differences of solutions (evolutionary diversity optimisation). In this study, we introduce a co-evolutionary algorithm to simultaneously explore the two spaces for the multi-component traveling thief problem. The results show the capability of the co-evolutionary algorithm to achieve signific…

2022-07-28cs.NE

Dynamic Multi-objective Optimization of the Travelling Thief Problem

Investigation of detailed and complex optimisation problem formulations that reflect realistic scenarios is a burgeoning field of research. A growing body of work exists for the Travelling Thief Problem, including multi-objective formulations and comparisons of exact and approximate methods to solve it. However, as many realistic scenarios are non-static in time, dynamic formulations have yet to be considered for the TTP. Definition of dynamics within three areas of the TTP problem are addressed; in the city locations, availability map and item values. Based on the elucidation of solution cons…

2020-02-07cs.NE

Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem

Mohammed V University of Rabat（拉巴特穆罕默德五世大学）；Faculty of Science（理学院）；LRIT（LRIT实验室）；CNRST（国家科学技术研究中心）

Real-world problems are very difficult to optimize. However, many researchers have been solving benchmark problems that have been extensively investigated for the last decades even if they have very few direct applications. The Traveling Thief Problem (TTP) is a NP-hard optimization problem that aims to provide a more realistic model. TTP targets particularly routing problem under packing/loading constraints which can be found in supply chain management and transportation. In this paper, TTP is presented and formulated mathematically. A combined local search algorithm is proposed and compared …

2016-03-23cs.AIcs.DScs.NE

Evolutionary Diversity Optimisation for The Traveling Thief Problem

There has been a growing interest in the evolutionary computation community to compute a diverse set of high-quality solutions for a given optimisation problem. This can provide the practitioners with invaluable information about the solution space and robustness against imperfect modelling and minor problems' changes. It also enables the decision-makers to involve their interests and choose between various solutions. In this study, we investigate for the first time a prominent multi-component optimisation problem, namely the Traveling Thief Problem (TTP), in the context of evolutionary divers…

2022-04-06cs.NE

更多相关论文收起更多论文

驾驶、装载、飞行：带无人机的旅行窃贼问题

Drive, Pack, Fly: The Travelling Thief Problem with Drone

Nirma University（尼尔玛大学）；Indian Institute of Management Bangalore（印度管理学院班加罗尔分校）

针对收集作业中车辆负载影响效率的问题，提出带无人机的旅行窃贼问题（TTP-D），构建混合整数线性规划，开发元启发式算法与基于注意力的DRL策略，提出学习者初始化混合求解器，实验表明其在基准集上性能接近基线且计算成本更低，还揭示租赁比率是利润主要驱动因素。

2026-08-18cs.AIcs.NEmath.OC

贪心方法在旅行中处理确定性和随机性约束下的装箱问题

Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints

本文提出针对旅行中装箱问题的贪心方法，通过定制奖励函数和超启发式框架提升求解效果，并在确定性和随机性约束下验证了改进方法的优越性。

2026-04-15cs.NE

On the Use of Quality Diversity Algorithms for The Traveling Thief Problem

In real-world optimisation, it is common to face several sub-problems interacting and forming the main problem. There is an inter-dependency between the sub-problems, making it impossible to solve such a problem by focusing on only one component. The traveling thief problem~(TTP) belongs to this category and is formed by the integration of the traveling salesperson problem~(TSP) and the knapsack problem~(KP). In this paper, we investigate the inter-dependency of the TSP and the KP by means of quality diversity~(QD) approaches. QD algorithms provide a powerful tool not only to obtain high-quali…

2023-01-04cs.NE

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics

Several important optimization problems in the area of vehicle routing can be seen as a variant of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the traveling thief problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows …

2020-02-04cs.NE

Evolving Diverse Sets of Tours for the Travelling Salesperson Problem

Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this area of research by examining evolutionary diversity optimisation approaches for the classical Traveling Salesperson Problem (TSP). We study the impact of using different diversity measures for a given set of tours and the ability of evolutionary algorithms to obtain a diverse set of high quality solutions when adopting these measures. Our studies show that a large variety of diverse high quality tours can be achieved …

2021-10-01cs.NE

Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem

The performance of base-line Evolutionary Algorithms (EAs) on combinatorial problems has been studied rigorously. From the theoretical viewpoint, the literature extensively investigates the linear problems, while the theoretical analysis of the non-linear problems is still far behind. In this paper, variations of the Packing While Travelling (PWT) -- also known as the non-linear knapsack problem -- are studied as an attempt to analyse the behaviour of EAs on non-linear problems from theoretical perspective. We investigate PWT for two cities and $n$ items with correlated weights and profits, us…

2019-07-01cs.NE

Decentralised Multi-Demic Evolutionary Approach to the Dynamic Multi-Agent Travelling Salesman Problem

The Travelling Salesman and its variations are some of the most well known NP hard optimisation problems. This paper looks to use both centralised and decentralised implementations of Evolutionary Algorithms (EA) to solve a dynamic variant of the Multi-Agent Travelling Salesman Problem (MATSP). The problem is dynamic, requiring an on-line solution, whereby tasks are completed during simulation with new tasks added and completed ones removed. The problem is allocating an active set of tasks to a set of agents whilst simultaneously planning the route for each agent. The allocation and routing ar…

2019-06-13cs.MAcs.NE

针对旅行商问题的EAX算法多任务处理研究

Insights from Multi-tasking the EAX Algorithm for the Travelling Salesperson Problem

Nanyang Technological University（南洋理工大学）

本文提出结合进化多任务与EAX的MT-EAX算法，经三种缩放方法对比实验，证实其在TSP求解中可节省大量计算量，且早期搜索阶段性能显著优于标准EAX。

2026-08-14cs.NE

基于进化算法的双层优化问题的参数化复杂性分析

A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms

近年来，双层优化问题在组合优化领域得到了越来越多的关注。通过本文，我们开始对双层优化问题的进化算法进行运行时分析。我们研究两个NP-难问题，广义最小生成树问题（GMST），和广义旅行商问题（GTSP）的参数化复杂性的背景下。对于广义最小生成树问题，我们分析了Hu和Raidl（2012）提出的两种方法，这些方法通过选择可能解的表示来区分彼此的簇的数量。我们的研究结果表明，一个（1+1）EA工作的跨越节点表示是不是一个固定参数的进化算法的问题，而全球结构表示，使解决问题的固定参数的时间。我们提出了硬的情况下，每种方法，并表明这两种方法是高度互补的证明，他们解决对方的硬的情况下非常有效。对于广义旅行商问题，我们分析了问题实例中的聚类数。我们的结果表明，（1+1）EA工作与全球结构表示是一个固定参数的进化算法的问题。

2014-01-09cs.NE

进化获取对称旅行商问题实例的性质分析

Property analysis of symmetric travelling salesman problem instances acquired through evolution

我们展示了如何进化算法可以成功地用于发展一组难以解决对称旅行推销员问题的两个变种的林-Kernighan算法的实例。然后，我们分析这些集合中的实例，以指导我们推迟关于对称旅行推销员问题的结构特性的两个变体的效率的一般知识。

2005-02-28cs.AIcs.NE

Generating Instances with Performance Differences for More Than Just Two Algorithms

In recent years, Evolutionary Algorithms (EAs) have frequently been adopted to evolve instances for optimization problems that pose difficulties for one algorithm while being rather easy for a competitor and vice versa. Typically, this is achieved by either minimizing or maximizing the performance difference or ratio which serves as the fitness function. Repeating this process is useful to gain insights into strengths/weaknesses of certain algorithms or to build a set of instances with strong performance differences as a foundation for automatic per-instance algorithm selection or configuratio…

2021-04-29cs.NE

Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization

Multi-objective orienteering problems (MO-OPs) are classical multi-objective routing problems and have received a lot of attention in the past decades. This study seeks to solve MO-OPs through a problem-decomposition framework, that is, a MO-OP is decomposed into a multi-objective knapsack problem (MOKP) and a travelling salesman problem (TSP). The MOKP and TSP are then solved by a multi-objective evolutionary algorithm (MOEA) and a deep reinforcement learning (DRL) method, respectively. While the MOEA module is for selecting cities, the DRL module is for planning a Hamiltonian path for these …

2022-06-21cs.NE

通过进化算法更好地训练指针网络

Pointer Networks Trained Better via Evolutionary Algorithms

针对指针网络（PtrNet）求解组合优化问题时解质量欠佳的问题，本文提出用进化算法（EA）训练PtrNet，在TSP问题上优于8种SOTA方法，最高提升30.21%的解质量，并首次实现1000维TSP的同维度PtrNet求解。

2024-03-11cs.NE

基于邻域的遗传算法在药物设计中的应用

An Evolutionary Approach to Drug-Design Using a Novel Neighbourhood Based Genetic Algorithm

目前的工作提供了一种新的方法来发展的配体结构，代表可能的药物对接到靶蛋白的活性位点。该结构表示为树，其中每个非空节点表示一个功能组。假设靶蛋白的活性位点构型与必需残基的位置是已知的。在本文中，配体与蛋白质靶标的相互作用能被最小化。此外，树的大小是难以获得的，并且对于不同的活动站点，它将是不同的。为了克服这一困难，我们采用了一种可变树尺寸的构型来设计配体。优化是使用一种新的基于邻域的遗传算法（NBGA），它使用动态邻域拓扑结构。为了得到可变的树大小，设计了上述算法的可变长度版本。为了评价算法的优劣，将其应用于著名的旅行商问题（TSP）。

2012-05-03cs.CEcs.NE

Comparing the Digital Annealer with Classical Evolutionary Algorithm

Fujitsu Research of Europe Ltd.（富士通欧洲研究有限公司）

In more recent years, there has been increasing research interest in exploiting the use of application specific hardware for solving optimisation problems. Examples of solvers that use specialised hardware are IBM's Quantum System One and D-wave's Quantum Annealer (QA) and Fujitsu's Digital Annealer (DA). These solvers have been developed to optimise problems faster than traditional meta-heuristics implemented on general purpose machines. Previous research has shown that these solvers (can optimise many problems much quicker than exact solvers such as GUROBI and CPLEX. Such conclusions have no…

2022-11-10cs.AIcs.NE