Conference
Evolutionary computation plus dynamic programming for the Bi-objective travelling thief problem
| العنوان: | Evolutionary computation plus dynamic programming for the Bi-objective travelling thief problem |
|---|---|
| المؤلفون: | J Wu, M Wagner, Sergey Polyakovskiy, F Neumann |
| سنة النشر: | 2018 |
| مصطلحات موضوعية: | Operations research, Bi-objective optimisation, Genetic algorithms, Dynamic programming, Travelling thief problem, Multi-component problem, Hybrid approach, 4901 Applied mathematics, 4602 Artificial intelligence |
| الوصف: | This research proposes a novel indicator-based hybrid evolutionary approach that combines approximate and exact algorithms. We apply it to a new bi-criteria formulation of the travelling thief problem, which is known to the Evolutionary Computation community as a benchmark multi-component optimisation problem that interconnects two classical NP-hard problems: the travelling salesman problem and the 0-1 knapsack problem. Our approach employs the exact dynamic programming algorithm for the underlying packing while travelling problem as a subroutine within a bi-objective evolutionary algorithm. This design takes advantage of the data extracted from Pareto fronts generated by the dynamic program to achieve better solutions. Furthermore, we develop a number of novel indicators and selection mechanisms to strengthen synergy of the two algorithmic components of our approach. The results of computational experiments show that the approach is capable to outperform the state-of-the-art results for the single-objective case of the problem. |
| نوع الوثيقة: | conference object |
| اللغة: | unknown |
| Relation: | http://hdl.handle.net/10536/DRO/DU:30112243 |
| الاتاحة: | http://hdl.handle.net/10536/DRO/DU:30112243 https://figshare.com/articles/conference_contribution/Evolutionary_computation_plus_dynamic_programming_for_the_Bi-objective_travelling_thief_problem/20797057 |
| Rights: | All Rights Reserved |
| رقم الانضمام: | edsbas.E1233FE7 |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |