publication . Other literature type . Conference object . 2019

A Profit Guided Coordination Heuristic for Travelling Thief Problems

Namazi, Majid; Newton, M.A. Hakim; Sattar, Abdul; Sanderson, Conrad;
Open Access
  • Published: 14 May 2019
  • Publisher: Zenodo
Abstract
The travelling thief problem (TTP) is a combination of two interdependent NP-hard components: travelling salesman problem (TSP) and knapsack problem (KP). Existing approaches for TTP typically solve the TSP and KP components in an interleaved fashion, where the solution to one component is held fixed while the other component is changed. This indicates poor coordination between solving the two components and may lead to poor quality TTP solutions. For solving the TSP component, the 2-OPT segment reversing heuristic is often used for modifying the tour. We propose an extended and modified form of the reversing heuristic in order to concurrently consider both the ...
Download fromView all 3 versions
Zenodo
Other literature type . 2019
Provider: Datacite
Zenodo
Other literature type . 2019
Provider: Datacite
ZENODO
Conference object . 2019
Provider: ZENODO
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Other literature type . Conference object . 2019

A Profit Guided Coordination Heuristic for Travelling Thief Problems

Namazi, Majid; Newton, M.A. Hakim; Sattar, Abdul; Sanderson, Conrad;