Conference paper Open Access

# A Profit Guided Coordination Heuristic for Travelling Thief Problems

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

### DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<identifier identifierType="DOI">10.5281/zenodo.3346238</identifier>
<creators>
<creator>
<creatorName>Namazi, Majid</creatorName>
<givenName>Majid</givenName>
<familyName>Namazi</familyName>
</creator>
<creator>
<creatorName>Newton, M.A. Hakim</creatorName>
<givenName>M.A. Hakim</givenName>
<familyName>Newton</familyName>
</creator>
<creator>
<creatorName>Sattar, Abdul</creatorName>
<givenName>Abdul</givenName>
<familyName>Sattar</familyName>
</creator>
<creator>
<familyName>Sanderson</familyName>
</creator>
</creators>
<titles>
<title>A Profit Guided Coordination Heuristic for Travelling Thief Problems</title>
</titles>
<publisher>Zenodo</publisher>
<publicationYear>2019</publicationYear>
<dates>
<date dateType="Issued">2019-05-14</date>
</dates>
<resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
<alternateIdentifiers>
<alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/3346238</alternateIdentifier>
</alternateIdentifiers>
<relatedIdentifiers>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.3346237</relatedIdentifier>
</relatedIdentifiers>
<rightsList>
<rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
</rightsList>
<descriptions>
<description descriptionType="Abstract">&lt;p&gt;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 TSP and KP components. Items deemed as less profitable and picked in cities earlier in the reversed segment are replaced by items that tend to be equally or more profitable and not picked in the later cities. Comparative evaluations on a broad range of benchmark TTP instances indicate that the proposed approach outperforms existing state-of-the-art TTP solvers.&lt;/p&gt;

&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description>
</descriptions>
</resource>

18
18
views