Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22097
Title: Heuristics for joint decisions in production, transportation, and order quantity
Authors: Yung, KL 
Tang, J
Ip, AWH 
Wang, D
Keywords: Supply chain management
Production/distribution coordination
Lagrange relaxation
Decomposition
Issue Date: 2006
Publisher: INFORMS
Source: Transportation science, 2006, v. 40, no. 1, p. 99-116 How to cite?
Journal: Transportation science 
Abstract: In the reliable network design problem (RNDP) the main sources of uncertainty are variable demand and route choice. The objective is to maximize network total travel time reliability (TTR), which is defined as the probability that the network total travel time will be less than a threshold. A framework is presented for a stochastic network model with Poisson-distributed demand and uncertain route choice. The travelers are assumed to choose their routes to minimize their perceived expected travel cost following the probit stochastic user equilibrium condition. An analytical method is presented for approximation of the first and second moments of the total travel time. These moments are then fitted with a log-normal distribution. Then the design problem is tackled in which the analytical derivative of the TTR is derived with the sensitivity analysis of the equilibrated path choice probability. This derivative is then supplied to a gradient-based optimization algorithm to solve the RNDP. The algorithm is tested with a small network example.
URI: http://hdl.handle.net/10397/22097
ISSN: 0041-1655
DOI: 10.1287/trsc.1040.0111
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
0
Last month
Citations as of Oct 18, 2017

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Oct 18, 2017

Page view(s)

51
Last Week
3
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



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