How much is location information worth?

LAUR Repository

Show simple item record

dc.contributor.author Srour, F. Jordan
dc.contributor.author Zuidwijk, Rob
dc.date.accessioned 2018-01-08T12:07:40Z
dc.date.available 2018-01-08T12:07:40Z
dc.date.issued 2018-01-08
dc.identifier.uri http://hdl.handle.net/10725/6880 en_US
dc.description.abstract In this paper we derive the worst-case ratio of an online algorithm for the Traveling Salesman Problem (TSP) with two disclosure dates. This problem, a variant of the online TSP with release dates, is characterized by the disclosure of a job's location at one point in time followed by the disclosure of that job's release date at a later point in time. We present an online algorithm for this problem restricted to the positive real number line. We then derive the worst-case ratio of our algorithm and show that it is best-possible in two contexts - the first, one in which the amount of time between the disclosure events and release time are fixed and equal for all jobs; and a second in which the time between disclosure events varies for each job. We conclude that the value of advanced information can be attributed to the location information alone - yielding an optimal solution in favorable instances. en_US
dc.language.iso en en_US
dc.publisher Erasmus Research Institute of Management, Erasmus University en_US
dc.title How much is location information worth? en_US
dc.type Conference Paper / Proceeding en_US
dc.title.subtitle a competitive analysis of the online traveling salesman problem with two disclosure dates en_US
dc.author.school SOB en_US
dc.author.idnumber 201204645 en_US
dc.author.department Department of Information Technology and Operations Management (ITOM) en_US
dc.description.embargo N/A en_US
dc.description.physdesc 23 p.: ill. en_US
dc.publication.place Rotterdam en_US
dc.keywords Traveling Salesman en_US
dc.keywords Advanced information en_US
dc.keywords Competitive ratio en_US
dc.keywords Worst-case ratio en_US
dc.keywords Online routing en_US
dc.description.bibliographiccitations Includes bibliographical references en_US
dc.identifier.ctation Srour, F. J., & Zuidwijk, R. A. (2008). How much is location information worth? a competitive analysis of the online traveling salesman problem with two disclosure dates. en_US
dc.author.email jordan.srour@lau.edu.lb en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1303922 en_US
dc.orcid.id https://orcid.org/0000-0001-7623-723X en_US
dc.publication.date 2008 en_US
dc.author.affiliation Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account