Please use this identifier to cite or link to this item:
|Title:||A stochastic dynamic traveling salesman problem with hard time windows|
Traveling salesman problem
|Citation:||Chang, T.-S., Wan, Y.-w., OOI, W.T. (2009). A stochastic dynamic traveling salesman problem with hard time windows. European Journal of Operational Research 198 (3) : 748-759. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2008.10.012|
|Abstract:||Just-in-time (JIT) trucking service, i.e., arriving at customers within specified time windows, has become the norm for freight carriers in all stages of supply chains. In this paper, a JIT pickup/delivery problem is formulated as a stochastic dynamic traveling salesman problem with time windows (SDTSPTW). At a customer location, the vehicle either picks up goods for or delivers goods from the depot, but does not provide moving service to transfer goods from one location to another. Such routing problems are NP-hard in deterministic settings, and in our context, complicated further by the stochastic, dynamic nature of the problem. This paper develops an efficient heuristic for the SDTSPTW with hard time windows. The heuristic is shown to be useful both in controlled numerical experiments and in applying to a real-life trucking problem. © 2008 Elsevier B.V. All rights reserved.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 17, 2018
WEB OF SCIENCETM
checked on Oct 10, 2018
checked on Oct 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.