.png){kind=icon}
Return
The sample average approximation method for empty container repositioning with uncertainties
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.04.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Transportation
Empty container repositioning
Sample average approximation
Scenario decomposition
Progressive hedging
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveOdour impact assessment of a large municipal solid waste landfill under different working phases
OAAI
OAAIShareSaveShareSave
View more