A simulated annealing heuristic for the truck and trailer routing problem with time windows

Shih Wei Lin; Vincent F. Yu; Chung-Cheng Lu

doi:10.1016/j.eswa.2011.05.075

A simulated annealing heuristic for the truck and trailer routing problem with time windows

Shih Wei Lin, Vincent F. Yu^*, Chung-Cheng Lu

^*Corresponding author for this work

Department of Transportation and Logistics Management

Research output: Contribution to journal › Article › peer-review

105 Scopus citations

Abstract

European firms have been using a combination of trucks and trailers in the delivery/collection of food products for years. Thus, some previous studies had been devoted to improving the efficiency of the resulting truck and trailer routing problem (TTRP). Since time window constraints are present in many real-world routing applications, in this study, we introduce the truck and trailer routing problem with time windows (TTRPTW) to bring the TTRP model closer to the reality. A simulated annealing (SA) heuristic is proposed for solving the TTRPTW. Two computational experiments are conducted to test the performance of the proposed SA heuristic. The results indicate that the proposed SA heuristic is capable of consistently producing quality solutions to the TTRPTW within a reasonable time.

Original language	English
Pages (from-to)	15244-15252
Number of pages	9
Journal	Expert Systems with Applications
Volume	38
Issue number	12
DOIs	https://doi.org/10.1016/j.eswa.2011.05.075
State	Published - 1 Nov 2011

Keywords

Simulated annealing
Time window
Truck and trailer routing problem
Vehicle routing problem

Access to Document

10.1016/j.eswa.2011.05.075

Cite this

@article{85174d199ce84647865e14d85045fa0c,

title = "A simulated annealing heuristic for the truck and trailer routing problem with time windows",

abstract = "European firms have been using a combination of trucks and trailers in the delivery/collection of food products for years. Thus, some previous studies had been devoted to improving the efficiency of the resulting truck and trailer routing problem (TTRP). Since time window constraints are present in many real-world routing applications, in this study, we introduce the truck and trailer routing problem with time windows (TTRPTW) to bring the TTRP model closer to the reality. A simulated annealing (SA) heuristic is proposed for solving the TTRPTW. Two computational experiments are conducted to test the performance of the proposed SA heuristic. The results indicate that the proposed SA heuristic is capable of consistently producing quality solutions to the TTRPTW within a reasonable time.",

keywords = "Simulated annealing, Time window, Truck and trailer routing problem, Vehicle routing problem",

author = "Lin, {Shih Wei} and Yu, {Vincent F.} and Chung-Cheng Lu",

year = "2011",

month = nov,

day = "1",

doi = "10.1016/j.eswa.2011.05.075",

language = "English",

volume = "38",

pages = "15244--15252",

journal = "Expert Systems with Applications",

issn = "0957-4174",

publisher = "Elsevier Limited",

number = "12",

}

TY - JOUR

T1 - A simulated annealing heuristic for the truck and trailer routing problem with time windows

AU - Lin, Shih Wei

AU - Yu, Vincent F.

AU - Lu, Chung-Cheng

PY - 2011/11/1

Y1 - 2011/11/1

N2 - European firms have been using a combination of trucks and trailers in the delivery/collection of food products for years. Thus, some previous studies had been devoted to improving the efficiency of the resulting truck and trailer routing problem (TTRP). Since time window constraints are present in many real-world routing applications, in this study, we introduce the truck and trailer routing problem with time windows (TTRPTW) to bring the TTRP model closer to the reality. A simulated annealing (SA) heuristic is proposed for solving the TTRPTW. Two computational experiments are conducted to test the performance of the proposed SA heuristic. The results indicate that the proposed SA heuristic is capable of consistently producing quality solutions to the TTRPTW within a reasonable time.

AB - European firms have been using a combination of trucks and trailers in the delivery/collection of food products for years. Thus, some previous studies had been devoted to improving the efficiency of the resulting truck and trailer routing problem (TTRP). Since time window constraints are present in many real-world routing applications, in this study, we introduce the truck and trailer routing problem with time windows (TTRPTW) to bring the TTRP model closer to the reality. A simulated annealing (SA) heuristic is proposed for solving the TTRPTW. Two computational experiments are conducted to test the performance of the proposed SA heuristic. The results indicate that the proposed SA heuristic is capable of consistently producing quality solutions to the TTRPTW within a reasonable time.

KW - Simulated annealing

KW - Time window

KW - Truck and trailer routing problem

KW - Vehicle routing problem

UR - http://www.scopus.com/inward/record.url?scp=80052022585&partnerID=8YFLogxK

U2 - 10.1016/j.eswa.2011.05.075

DO - 10.1016/j.eswa.2011.05.075

M3 - Article

AN - SCOPUS:80052022585

SN - 0957-4174

VL - 38

SP - 15244

EP - 15252

JO - Expert Systems with Applications

JF - Expert Systems with Applications

IS - 12

ER -

A simulated annealing heuristic for the truck and trailer routing problem with time windows

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this