Heuristic-based truck scheduling for inland container transportation

Zhang, Ruiyou; Yun, Won Young; Kopfer, Herbert

doi:10.1007/s00291-010-0193-4

Cited by 124 publications

(94 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem described above is similar to the ones studied in Zhang et al (2009) and Zhang et al (2010), although some differences exist. The objective is twofold in this paper (first minimize vehicles, then minimize distance) while respectively only total travelling time and total operation time are minimized in Zhang et al (2009) and Zhang et al (2010).…”

Section: Problem Descriptionsupporting

confidence: 56%

“…Again an RTS algorithm is proposed. It seems that solving this problem is much more complex than solving the problems in Zhang et al (2009) and Zhang et al (2010) where there is no limit on the number of empty container available at the depots.…”

Section: Integrated Approachesmentioning

confidence: 99%

“…A Reactive Tabu Search (RTS) algorithm is proposed to solve the problem. Zhang et al (2010) extend this problem to a multiple depot, multiple terminal problem and solve it by a time window partitioning method. Finally, Zhang et al (2011b) look at the single depot, single terminal problem where the number of empty containers available at the depot is limited.…”

Section: Integrated Approachesmentioning

confidence: 99%

See 2 more Smart Citations

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: Problem Descriptionsupporting

confidence: 56%

Section: Integrated Approachesmentioning

confidence: 99%

Section: Integrated Approachesmentioning

confidence: 99%

See 1 more Smart Citation

Integrated planning of loaded and empty container movements

2012

View full text Add to dashboard Cite

show abstract

“…Second, in this case study routes are performed by two types of trucks carrying one or two containers, respectively, whereas most of the related literature concerns one container per truck (Wang et al 2002;Jula et al 2005;Zhang et al 2011Zhang et al , 2010Braekers et al 2013;Nossack and Pesch 2013). The case more than one container has been dealt with only recently (Vidovic et al 2017;Funke and Kopfer 2016).…”

Section: Introductionmentioning

confidence: 99%

“…First, in most of the related studies containers are supposed to be left at customer locations, and drivers can move to other customers, thereby bypassing packing and unpacking operations (Wang et al 2002;Jula et al 2005;Chung et al 2007;Zhang et al 2010Zhang et al , 2011Vidovic et al 2011;Braekers et al 2013;Nossack and Pesch 2013). Conversely, in this case study trucks move loaded containers to import customers and drivers wait for the empty containers, while unpacking operations are performed.…”

Section: Introductionmentioning

confidence: 99%

A set-covering formulation for a drayage problem with single and double container loads

et al. 2018

View full text Add to dashboard Cite

This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality by a commercial solver, significantly outperforming a previously proposed node-arc formulation. Moreover, the model can be effectively used to evaluate a new distribution policy, which results in an enlarged set of feasible routes and can increase savings w.r.t. the policy currently employed by the carrier.

show abstract

Hinterland Container Transportation Using Mathematical Programming Approach

Göçmen

Erol

2019

Lecture Notes in Management and Industrial Engineering

View full text Add to dashboard Cite

Heuristic-based truck scheduling for inland container transportation

Cited by 124 publications

References 21 publications

Integrated planning of loaded and empty container movements

Integrated planning of loaded and empty container movements

A set-covering formulation for a drayage problem with single and double container loads

Hinterland Container Transportation Using Mathematical Programming Approach

Contact Info

Product

Resources

About