Optimization through simulation of waterway transportation investments Ching-Jung Ting ; Schonfeld, Paul
Publication details: Transportation Research Record, 1998Description: nr 1620, s. 11-6Subject(s): Bibl.nr: VTI P8167:1620 VTI P8169:1998Location: Abstract: The cost of tow delays is a serious problem in a waterway network. One way to reduce the delay cost is to increase capacity at waterway locks. Planners must determine how much additional capacity to provide at particular lock sites and when to implement the capacity expansion projects. Answers for such project sizing and timing problems are difficult to obtain analytically. The use of a new approach for optimizing through simulation, called simultaneous perturbation stochastic approximation (SPSA), is investigated. This approach, which seeks optimal values for all decision variables after each pair of simulation runs, is quite promising for optimizing large problems relatively fast. A small numerical example tests how this simulation and optimization algorithm may be used to optimize lock capacities and implementation times.| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Statens väg- och transportforskningsinstitut | Available | |||||||||||||||||
| Statens väg- och transportforskningsinstitut | Available |
The cost of tow delays is a serious problem in a waterway network. One way to reduce the delay cost is to increase capacity at waterway locks. Planners must determine how much additional capacity to provide at particular lock sites and when to implement the capacity expansion projects. Answers for such project sizing and timing problems are difficult to obtain analytically. The use of a new approach for optimizing through simulation, called simultaneous perturbation stochastic approximation (SPSA), is investigated. This approach, which seeks optimal values for all decision variables after each pair of simulation runs, is quite promising for optimizing large problems relatively fast. A small numerical example tests how this simulation and optimization algorithm may be used to optimize lock capacities and implementation times.