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

Authors:
Shih-Wei Lin;Vincent F. Yu;Chung-Cheng Lu
Affiliations:
Department of Information Management, Chang Gung University, 259 Wen-Hwa, 1st Road, Kwei-Shan, Taoyuan 333, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, 43, Section 4, Keelung Road, Taipei 106, Taiwan;Graduate Institute of Information and Logistics Management, National Taipei University of Technology, 1, Section 3, Chung-Hsiao E. Road, Taipei 106, Taiwan
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 18
Cited 2

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
Solving real-life vehicle routing problems efficiently using tabu search

Annals of Operations Research - Special issue on Tabu search
A solution to the facility layout problem using simulated annealing

Computers in Industry - Special issue: ASI'96: life cycle approaches to production systems: management, control and supervision
A Heuristic for the Vehicle Routing Problem with Time Windows

Journal of Heuristics
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

INFORMS Journal on Computing
Designing optimal aviation baggage screening strategies using simulated annealing

Computers and Operations Research
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

Journal of Heuristics
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

Computers and Operations Research
Simulated annealing heuristics for the dynamic facility layout problem

Computers and Operations Research
Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

Journal of Heuristics
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows

Transportation Science
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science
Solving the truck and trailer routing problem based on a simulated annealing heuristic

Computers and Operations Research
Short Communication: A note on the truck and trailer routing problem

Expert Systems with Applications: An International Journal
A tabu search heuristic for the truck and trailer routing problem

Computers and Operations Research

Truck and trailer routing-Problems, heuristics and computational experience

Computers and Operations Research
Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

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.