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 t...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2017-08
Main Authors: Wu, Junhua, Wagner, Markus, Polyakovskiy, Sergey, Neumann, Frank
Format: Article
Language:English
Subjects:
Algorithms
Heuristic methods
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Wu, Junhua
Wagner, Markus
Polyakovskiy, Sergey
Neumann, Frank
description 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.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2075891830</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2075891830</sourcerecordid><originalsourceid>FETCH-proquest_journals_20758918303</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwdK1ITC5RcCwoKMpPTM5ILVZIyy9SKMlIVQgpSixLzcnJzEtXCMnITE1TCCjKT8pJzeVhYE1LzClO5YXS3AzKbq4hzh66QBMKS1OLS-Kz8kuL8oBS8UYG5qYWloYWxgbGxKkCAH3MMyg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2075891830</pqid></control><display><type>article</type><title>Exact Approaches for the Travelling Thief Problem</title><source>Publicly Available Content Database</source><creator>Wu, Junhua ; Wagner, Markus ; Polyakovskiy, Sergey ; Neumann, Frank</creator><creatorcontrib>Wu, Junhua ; Wagner, Markus ; Polyakovskiy, Sergey ; Neumann, Frank</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Heuristic methods</subject><ispartof>arXiv.org, 2017-08</ispartof><rights>2017. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2075891830?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25732,36991,44569</link.rule.ids></links><search><creatorcontrib>Wu, Junhua</creatorcontrib><creatorcontrib>Wagner, Markus</creatorcontrib><creatorcontrib>Polyakovskiy, Sergey</creatorcontrib><creatorcontrib>Neumann, Frank</creatorcontrib><title>Exact Approaches for the Travelling Thief Problem</title><title>arXiv.org</title><description>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.</description><subject>Algorithms</subject><subject>Heuristic methods</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwdK1ITC5RcCwoKMpPTM5ILVZIyy9SKMlIVQgpSixLzcnJzEtXCMnITE1TCCjKT8pJzeVhYE1LzClO5YXS3AzKbq4hzh66QBMKS1OLS-Kz8kuL8oBS8UYG5qYWloYWxgbGxKkCAH3MMyg</recordid><startdate>20170801</startdate><enddate>20170801</enddate><creator>Wu, Junhua</creator><creator>Wagner, Markus</creator><creator>Polyakovskiy, Sergey</creator><creator>Neumann, Frank</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20170801</creationdate><title>Exact Approaches for the Travelling Thief Problem</title><author>Wu, Junhua ; Wagner, Markus ; Polyakovskiy, Sergey ; Neumann, Frank</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20758918303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Heuristic methods</topic><toplevel>online_resources</toplevel><creatorcontrib>Wu, Junhua</creatorcontrib><creatorcontrib>Wagner, Markus</creatorcontrib><creatorcontrib>Polyakovskiy, Sergey</creatorcontrib><creatorcontrib>Neumann, Frank</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wu, Junhua</au><au>Wagner, Markus</au><au>Polyakovskiy, Sergey</au><au>Neumann, Frank</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Exact Approaches for the Travelling Thief Problem</atitle><jtitle>arXiv.org</jtitle><date>2017-08-01</date><risdate>2017</risdate><eissn>2331-8422</eissn><abstract>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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2017-08
issn 2331-8422
language eng
recordid cdi_proquest_journals_2075891830
source Publicly Available Content Database
subjects Algorithms
Heuristic methods
title Exact Approaches for the Travelling Thief Problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T23%3A47%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Exact%20Approaches%20for%20the%20Travelling%20Thief%20Problem&rft.jtitle=arXiv.org&rft.au=Wu,%20Junhua&rft.date=2017-08-01&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2075891830%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20758918303%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2075891830&rft_id=info:pmid/&rfr_iscdi=true