A Tabu Search Heuristic for a Full-Load, Multi-Terminal, Vehicle Scheduling Problem with Backhauling and Time Windows

Currie, Robert H.; Salhi, Saı̈d

doi:10.1023/b:jmma.0000038616.99798.f2

Cited by 19 publications

(10 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In their Pickup and Delivery Problem with Time Windows (PDPTW) goods are transported between customer locations, as opposed to our problem definition where all containers either originate or return to the terminal. A full truckload PDPTW is also considered by Currie and Salhi (2003) and Currie and Salhi (2004). The problem studied in these papers also differs from our setting with respect to the definition of customer requests.…”

Section: Introductionmentioning

confidence: 99%

A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals

Caris

Janssens

2010

IJCAET

View full text Add to dashboard Cite

The drayage of containers in the service area of an intermodal barge terminal is modelled as a full truckload pickup and delivery problem with time windows (FTPDPTW). Initial solutions are generated with an insertion heuristic and improved with three local search operators. In a post-optimization phase the three search operators are integrated in a deterministic annealing (DA) framework. The mechanism of the heuristic procedures is demonstrated with a numerical example. A sensitivity analysis indicates that the DA algorithm is robust with respect to variations in threshold value and quality of the initial solution.

show abstract

Section: Introductionmentioning

confidence: 99%

A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals

Caris

Janssens

2010

IJCAET

View full text Add to dashboard Cite

show abstract

“…Currie and Salhi (2004) propose a tabu search heuristic for a FT-PDPTW with heterogeneous products and vehicles where the pickup points of goods to be delivered to customers are not predefined. The objective is to minimize total costs, including a fixed cost per vehicle used.…”

Section: Integrated Approachesmentioning

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

“…Different variants of the tabu search meta-heuristic are proposed to solve the problem. A tabu search heuristic for a FT-PDPTW with heterogeneous products and vehicles where the pickup points of goods to be delivered to customers are not predefined is proposed by Currie and Salhi (2004). The objective is to minimize total costs, including a fixed cost per vehicle used.…”

Section: Related Literaturementioning

confidence: 99%

Optimization of empty container movements in intermodal transport

Braekers¹

2012

4OR-Q J Oper Res

View full text Add to dashboard Cite

A Tabu Search Heuristic for a Full-Load, Multi-Terminal, Vehicle Scheduling Problem with Backhauling and Time Windows

Cited by 19 publications

References 20 publications

A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals

A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals

Integrated planning of loaded and empty container movements

Optimization of empty container movements in intermodal transport

Contact Info

Product

Resources

About