Please use this identifier to cite or link to this item:
|Title:||The sample average approximation method for empty container repositioning with uncertainties||Authors:||Long, Y.
|Keywords:||Empty container repositioning
Sample average approximation
|Issue Date:||1-Oct-2012||Citation:||Long, Y., Lee, L.H., Chew, E.P. (2012-10-01). The sample average approximation method for empty container repositioning with uncertainties. European Journal of Operational Research 222 (1) : 65-75. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2012.04.018||Abstract:||One of the challenges faced by liner operators today is to effectively operate empty containers in order to meet demand and to reduce inefficiency in an uncertain environment. To incorporate uncertainties in the operations model, we formulate a two-stage stochastic programming model with random demand, supply, ship weight capacity, and ship space capacity. The objective of this model is to minimize the expected operational cost for Empty Container Repositioning (ECR). To solve the stochastic programs with a prohibitively large number of scenarios, the Sample Average Approximation (SAA) method is applied to approximate the expected cost function. To solve the SAA problem, we consider applying the scenario aggregation by combining the approximate solution of the individual scenario problem. Two heuristic algorithms based on the progressive hedging strategy are applied to solve the SAA problem. Numerical experiments are provided to show the good performance of the scenario-based method for the ECR problem with uncertainties. © 2012 Elsevier B.V. All rights reserved.||Source Title:||European Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/63371||ISSN:||03772217||DOI:||10.1016/j.ejor.2012.04.018|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.