Online traveling salesman problem with deadlines and service flexibility

Xingang Wen (), Yinfeng Xu and Huili Zhang
Additional contact information
Xingang Wen: Xi’an Jiaotong University
Yinfeng Xu: Xi’an Jiaotong University
Huili Zhang: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 3, No 9, 545-562

Abstract: Abstract Considering the customer psychology while waiting to be served, we introduce a more reasonable form of deadlines into online traveling salesman problem (OL-TSP) with service flexibility. The salesman can choose whether to serve or not when a new request arrives. By rejecting the request or missing its deadline, penalties will be generated. The goal is to minimize server’s costs (travel makespan plus the penalties of missed requests). We show that no deterministic or randomized online algorithms can achieve constant competitive ratio for OL-TSP with deadlines and service flexibility on general metric space. While on constrained metric space (such as truncated line segment), we present lower bound, give an algorithm, and analyze the competitive ratio.

Keywords: Online algorithms; Traveling salesman problem; Deadlines; Service flexibility (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9654-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:3:d:10.1007_s10878-013-9654-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9654-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().