Empty container management in a port with long-run average criterion

Li, Jingan; Liu, Ke; Leung, Stephen C. H.; Lai, Kin Keung

doi:10.1016/j.mcm.2003.12.005

Cited by 116 publications

(71 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Only do the ECR take place when the surplus and deficit ports exist in the same period t. As the supply/demand empty containers in surplus/deficit ports are limit, the number of dispatching ones to the deficit ports must be subject to (4) and (5), where (4) describes the outbound empty containers for each surplus port in each t should be less than its available ones, (5) explains the inbound empty containers from all surplus ports to some deficit port in each t should be larger than its inventory of previous period minus net demand empty containers, and | | represents the corresponding absolute value.…”

Section: The Constraints Conditionsmentioning

confidence: 99%

“…So we should reduce the times of handling and transshipment of empty containers as possible as. Table 4 describes the running time of f 1 and f 4 . It can easily observe that f 1 has good time performance than f 4 in different T. The computational times are the key points.…”

Section: Analysis On Each Cost In Whole Operational Costmentioning

confidence: 99%

“…They mainly include twofold: firstly it is the inventory-based control mechanisms for empty containers management [4,11,12]. Secondly it adopts the dynamic network programming methods to solve this problem [13][14][15].…”

Section: Introductionmentioning

confidence: 99%

“…Crainic et al [3] consider the factor of long-term leasing containers for attacking the dynamic random ECR. To reduce the number of ECR, Li et al [4] study the transportation between ports. Song and Dong [5] deal with the problem of joint cargo routing and ECR at the operational level for a shipping network with multiple service routes, multiple deployed vessels, and multiple regular voyages.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Multiple Periods Minimal Cost Programming Optimization Model for Empty Containers Repositioning with Stock Level

Lü¹,

Zhang²,

Wang³

et al. 2016

IJHIT

View full text Add to dashboard Cite

show abstract

Section: The Constraints Conditionsmentioning

confidence: 99%

Section: Analysis On Each Cost In Whole Operational Costmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multiple Periods Minimal Cost Programming Optimization Model for Empty Containers Repositioning with Stock Level

Lü¹,

Zhang²,

Wang³

et al. 2016

IJHIT

View full text Add to dashboard Cite

show abstract

“…Thus, for example, Li et al (2004) showed that there exists an optimal (U, D) policy for the management of empty containers in a port with stochastic demand. If there are fewer than U containers they are imported up to U but if there are more than D they are exported down to D. They also used multi-ports applications.…”

Section: Literature Reviewmentioning

confidence: 99%

A decision-making model to design a sustainable container depot logistic network: the case of the port of Valencia

2015

View full text Add to dashboard Cite

Abstract. In this paper, the design of a maritime container depot logistic network in a hinterland is studied. Containers are a basic tool in multimodal product transportation and all related operations have an impact on the environment due to different externalities such as noise, atmospheric and visual pollution. A three objective optimization model is used to minimize the total network cost, the environmental impact generated by the road transport operations associated with the depots (TI) and the environmental impact generated by the setting up and maintenance of the depots (FI). To determine the environmental impacts of each depot, Fuzzy Analytic Hierarchy Process (F-AHP) is used in both cases. In addition, a fuzzy multiobjective optimization approach has been used to solve the problem. The application case study is based on the Port of Valencia (Spain).

show abstract

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

Song

Carter

2008

Naval Research Logistics

View full text Add to dashboard Cite

This article considers the empty vehicle redistribution problem in a hub-and-spoke transportation system, with random demands and stochastic transportation times. An event-driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two-depot systems, a dynamic decomposition procedure is presented which produces a nearoptimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold-type control policy is not usually optimal in such systems. The results are illustrated through small-scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types.

show abstract

Empty container management in a port with long-run average criterion

Cited by 116 publications

References 22 publications

Multiple Periods Minimal Cost Programming Optimization Model for Empty Containers Repositioning with Stock Level

Multiple Periods Minimal Cost Programming Optimization Model for Empty Containers Repositioning with Stock Level

A decision-making model to design a sustainable container depot logistic network: the case of the port of Valencia

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

Contact Info

Product

Resources

About