A heuristic solution for the empty container substitution problem

Chang, Hwan; Jula, Hossein; Chassiakos, Anastasios; Ioannou, Pétros

doi:10.1016/j.tre.2007.07.001

Cited by 59 publications

(30 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides empty container demand and supply, repositioning empty containers in order to be able to satisfy empty container demand in future periods may be considered. Container allocation models are described among others in Chang et al (2008);Chu (1995); Crainic et al (1993); Di Francesco et al (2006); Jula et al (2003) and Olivo et al (2005). For a detailed review of these and other empty container allocation models the reader is referred to Braekers et al (2011).…”

Section: Empty Container Allocation Modelsmentioning

confidence: 99%

Integrated planning of loaded and empty container movements

2012

View full text Add to dashboard Cite

Efficiently planning drayage operations is an important task for transportation companies since these operations constitute a large part of the cost of an intermodal transport. In this paper a full truckload vehicle routing problem for transporting loaded and empty containers in drayage operations is studied. For empty container transports either the origin or the destination is not predefined. The problem is formulated as an asymmetric multiple vehicle Travelling Salesman Problem with Time Windows (am-TSPTW). Two solution approaches are proposed: a sequential and an integrated approach. For both approaches, a single and a two-phase deterministic annealing algorithm are presented. Results show that the proposed algorithms are able to find good quality solutions in a small amount of computation time. The integrated approach clearly outperforms the sequential one and the results confirm the advantage of using a two-phase algorithm for vehicle routing problems with hierarchical objectives. Finally, it is shown that the proposed integrated solution method improves previous results on a similar problem.

show abstract

Section: Empty Container Allocation Modelsmentioning

confidence: 99%

Integrated planning of loaded and empty container movements

2012

View full text Add to dashboard Cite

show abstract

“…For example, a request of two containers of type a may be fulfilled by a single container of type b but not vice versa. According to Chang et al (2008), a lack of well defined substitution rules prevents container substitution to be common practice.…”

Section: Container Substitutionmentioning

confidence: 99%

“…(Jula et al, 2003) More simulations of the dynamic model including street turns and inland depots are performed by Jula et al (2006). Chang et al (2006Chang et al ( , 2008 and Ioannou et al (2006) continue the work of Jula et al (2003Jula et al ( , 2006. The authors propose mathematical models for the static deterministic two-commodity and multicommodity allocation problem with container substitution.…”

Section: Regional Container Allocation Modelsmentioning

confidence: 99%

“…A branch-and-bound based algorithm is considered. To reduce computation times, Ioannou et al (2006) and Chang et al (2008) propose an approximation method which forces fractional variables to become integers. Comparing simulation results with those from Jula et al (2003) shows that allowing for container substitution may result in a reduction of costs from empty container movements.…”

Section: Regional Container Allocation Modelsmentioning

confidence: 99%

See 1 more Smart Citation

Optimization of empty container movements in intermodal transport

Braekers¹

2012

4OR-Q J Oper Res

View full text Add to dashboard Cite

“…Nevertheless, due to a lack of cargo tra c demand uctuations and cargo ow distributions among ports in their experiments, there are evident aws in ship-slot allocations among calling ports. More recently, Chang et al (2008) studied a heuristic method to provide an optimal solution to reduce the cost of empty container interchange. Using the available data, they tested the effectiveness of computational time and solution quality.…”

Section: Literature Reviewmentioning

confidence: 99%

Designing Container Shipping Network Under Changing Demand and Freight Rates

Chao

Zeng

2010

Transport

View full text Add to dashboard Cite

Abstract. is paper focuses on the optimization of container shipping network and its operations under changing cargo demand and freight rates. e problem is formulated as a mixed integer non-linear programming problem (MINP) with an objective of maximizing the average unit ship-slot pro t at three stages using analytical methodology.e issues such as empty container repositioning, ship-slot allocating, ship sizing, and container con guration are simultaneously considered based on a series of the matrices of demand for a year. To solve the model, a bi-level genetic algorithm based method is proposed. Finally, numerical experiments are provided to illustrate the validity of the proposed model and algorithms. e obtained results show that the suggested model can provide a more realistic solution to the issues on the basis of changing demand and freight rates and arrange a more e ective approach to the optimization of container shipping network structures and operations than does the model based on the average demand.

show abstract

A heuristic solution for the empty container substitution problem

Cited by 59 publications

References 9 publications

Integrated planning of loaded and empty container movements

Integrated planning of loaded and empty container movements

Optimization of empty container movements in intermodal transport

Designing Container Shipping Network Under Changing Demand and Freight Rates

Contact Info

Product

Resources

About