Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
by
Rothenbächer, Ann-Kathrin
, Irnich, Stefan
, Drexl, Michael
in
branch-and-price-and-cut
/ Heuristic
/ Linear programming
/ Management
/ Methods
/ Time management
/ Tractor trailer combinations
/ Trailers
/ Transportation
/ Transportation economics
/ Transportation terminals
/ truck-and-trailer routing
/ Trucks
/ vehicle routing
/ Windows (intervals)
2018
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
by
Rothenbächer, Ann-Kathrin
, Irnich, Stefan
, Drexl, Michael
in
branch-and-price-and-cut
/ Heuristic
/ Linear programming
/ Management
/ Methods
/ Time management
/ Tractor trailer combinations
/ Trailers
/ Transportation
/ Transportation economics
/ Transportation terminals
/ truck-and-trailer routing
/ Trucks
/ vehicle routing
/ Windows (intervals)
2018
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
by
Rothenbächer, Ann-Kathrin
, Irnich, Stefan
, Drexl, Michael
in
branch-and-price-and-cut
/ Heuristic
/ Linear programming
/ Management
/ Methods
/ Time management
/ Tractor trailer combinations
/ Trailers
/ Transportation
/ Transportation economics
/ Transportation terminals
/ truck-and-trailer routing
/ Trucks
/ vehicle routing
/ Windows (intervals)
2018
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
Journal Article
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
2018
Request Book From Autostore
and Choose the Collection Method
Overview
In this paper, we present a new branch-and-price-and-cut algorithm to solve the truck-and-trailer routing problem with time windows (TTRPTW) and two real-world extensions. In all TTRPTW variants, the fleet consists of one or more trucks that may attach a trailer. Some customers are not accessible with a truck-and-trailer combination, but can however be serviced by one if the trailer is previously detached and parked at a suitable location. In the first extension, the planning horizon comprises two days and customers may be visited either on both days or only once, in which case twice the daily supply must be collected. The second extension incorporates load transfer times depending on the quantity moved from a truck to its trailer. The exact branch-and-price-and-cut algorithm for the standard variant and the two new extensions is based on a set-partitioning formulation in which columns are routes describing the movement of a truck and its associated trailer. Linear relaxations of this formulation are solved by column generation where new routes are generated with a dynamic programming labeling algorithm. The effectiveness of this pricing procedure can be attributed to the adaptation of techniques such as bidirectional labeling, the
ng
-neighborhood, and heuristic pricing using dynamically reduced networks and relaxed dominance. The cutting component of the branch-and-price-and-cut adds violated subset-row inequalities to strengthen the linear relaxation. Computational studies show that our algorithm outperforms existing approaches on TTRP and TTRPTW benchmark instances used in the literature.
The online appendix is available at
https://doi.org/10.1287/trsc.2017.0765
.
Publisher
INFORMS,Institute for Operations Research and the Management Sciences
This website uses cookies to ensure you get the best experience on our website.