کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4959007 1445465 2017 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
ترجمه فارسی عنوان
جستجوی شعبه و قیمت و انطباق محله بزرگ برای مشکل کامیون و تریلر با پنجره های زمان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی


- We develop a branch-and-price algorithm for the truck and trailer routing problem with time windows.
- We provide the first optimal solutions to several benchmark instances with 50 and 100 customers.
- We propose an efficient adaptive large neighborhood search algorithm.

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 83, July 2017, Pages 28-44
نویسندگان
, ,