Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 83, Issue -, Pages 28-44Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2017.01.020
Keywords
Truck and trailer; Vehicle routing; Column generation; Large neighborhood search; Branch-and-price
Categories
Funding
- Austrian Science Fund (FWF) [T514-N13]
- Austrian Science Fund (FWF) [T514] Funding Source: Austrian Science Fund (FWF)
Ask authors/readers for more resources
Motivated by a situation faced by infrastructure service providers operating in urban areas with accessibility restrictions, we study the truck and trailer routing problem with time windows (TTRPTW). In this problem the vehicle fleet consists of trucks and trailers which may be decoupled. A set of customers has to be served and some of the customers can only be accessed by the truck without the trailer. This gives rise to the planning of truck-and-trailer routes containing truck-only subroutes, in addition to truck-only routes and truck-and-trailer routes without subroutes. We propose a branch-and-price algorithm for the TTRPTW, using problem specific enhancements in the pricing scheme and alternative lower bound computations. We also tailor an adaptive large neighborhood search algorithm to the TTRPTW in order to obtain good initial columns. When compared to existing metaheuristic algorithms we obtain highly competitive results. Some instances with up to 100 customers are solved to optimality with the proposed branch-and-price algorithm. (C) 2017 The Authors. Published by Elsevier Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available