Authors: Lilit Mazmanyan; Dan Trietsch
Addresses: College of Engineering, American University of Armenia, Yerevan, Armenia ' College of Engineering, American University of Armenia, Yerevan, Armenia
Abstract: We address the stochastic traveling salesperson problem (TSP) with distances measured by travel time. As a by-product, we obtain comparable results for the shortest route problem. We study how to select the best path and due date to minimise fundamental safe scheduling objectives. Model 1 requires minimising the due date subject to a service level constraint. Model 2 addresses a weighted trade-off between the due date and the expected tardiness. In alternate formulations, the due date is given and we maximise the service level for Model 1, or minimise the expected tardiness for Model 2. We show that Alternate 1 is equivalent to Model 1, but Alternate 2 is different to Model 2. For normal and lognormal travel times, we proceed by solving few deterministic TSP derived instances. This approach provides optimal solutions for some models. For all other models, it becomes an effective heuristic with tight performance guarantee certificates.
Keywords: travelling salesman problem; TSP; shortest route; stochastic scheduling; safe scheduling; lognormal scheduling; safety time.
International Journal of Planning and Scheduling, 2014 Vol.2 No.1, pp.53 - 76
Available online: 02 Jan 2015 *Full-text access for editors Access for subscribers Free access Comment on this article