Please use this identifier to cite or link to this item:
|Title:||Multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation|
|Authors:||Meng, Q. |
Multiple objective analysis
|Citation:||Meng, Q., Lee, D.-H., Cheu, R.L. (2005-09). Multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation. Journal of Transportation Engineering 131 (9) : 699-707. ScholarBank@NUS Repository. https://doi.org/10.1061/(ASCE)0733-947X(2005)131:9(699)|
|Abstract:||This paper proposes a novel vehicle routing and scheduling problem in transporting hazardous materials for networks with multiple time-varying attributes. It actually aims to identify all nondominated time-varying paths with departure times at the origin and waiting times at intermediate nodes along these paths for a given pair of origin and destination, subject to three kinds of practical constraints: Limited operational time period, and service, and waiting time window constraints at a node. Based on the assumption of linear waiting attributes at a node, the proposed problem can be equivalently transformed into a static multiobjective shortest path problem in an acyclic network reconstructed by the space-time network technique. An efficient dynamic programming method is then developed. In addition, two numerical examples and a case study are carried out to demonstrate the methodology proposed in this paper. Journal of Transportation Engineering © ASCE.|
|Source Title:||Journal of Transportation Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 18, 2018
WEB OF SCIENCETM
checked on May 30, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.