41 citations · 75 across the 7 of their papers we have counts for
8 papers
Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem
Junhua Wu, Sergey Polyakovskiy, Markus Wagner +1
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 trav…
Exact Approaches for the Travelling Thief Problem
Junhua Wu, Markus Wagner, Sergey Polyakovskiy +1
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 unknow…
Just-in-Time Batch Scheduling Problem with Two-dimensional Bin Packing Constraints
S. Polyakovskiy, A. Makarowsky, R. M'Hallah
This paper introduces and approximately solves a multi-component problem where small rectangular items are produced from large rectangular bins via guillotine cuts. An item is char…
A Hybrid Feasibility Constraints-Guided Search to the Two-Dimensional Bin Packing Problem with Due Dates
S. Polyakovskiy, R. M'Hallah
The two-dimensional non-oriented bin packing problem with due dates packs a set of rectangular items, which may be rotated by 90 degrees, into identical rectangular bins. The bins…
A Fully Polynomial Time Approximation Scheme for Packing While Traveling
Frank Neumann, Sergey Polyakovskiy, Martin Skutella +2
Understanding the interactions between different combinatorial optimisation problems in real-world applications is a challenging task. Recently, the traveling thief problem (TTP),…
The Packing While Traveling Problem
Sergey Polyakovskiy, Frank Neumann
This paper introduces the Packing While Traveling problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights a…