Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleAn integer L-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times
dc.contributor.authorTeng, S.Y.
dc.contributor.authorOng, H.L.
dc.contributor.authorHuang, H.C.
dc.identifier.citationTeng, S.Y., Ong, H.L., Huang, H.C. (2004-06). An integer L-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times. Asia-Pacific Journal of Operational Research 21 (2) : 241-257. ScholarBank@NUS Repository.
dc.description.abstractThe time-constrained traveling salesman problem (TCTSP) is a variant of the classical traveling salesman problem, where only a subset of the customers can be visited due to the time limit constraint. In this paper, we consider the TCTSP with stochastic travel and service times. Given the normal working hours T and a tolerance time ΔT, the total travel and service times of a route can exceed T as long as it is within T + ΔT, though a penalty proportional to the amount in excess of T will be imposed. The problem consists of optimally selecting and sequencing a subset of customers to visit in the presence of random travel and service times to maximize the expected profit while satisfying the time limit constraint. We formulate the problem as a two-stage stochastic program with recourse, and propose an integer L-shaped solution method for solving it. Computational results show that the algorithm can solve problems with moderate size to optimality within reasonable time.
dc.subjectBenders' decomposition
dc.subjectInteger L-shaped method
dc.subjectStochastic program with recourse
dc.subjectTime-constrained traveling salesman problem
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.sourcetitleAsia-Pacific Journal of Operational Research
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.