Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments

DOI10.1002/net.21526zbMath1338.90049OpenAlexW1990485562MaRDI QIDQ2811328

Michael Drexl

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1210.pdf

zbMATH Keywords

vehicle routingsynchronizationbranch-and-cuttransshipmenttrailer

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (9)

Daily aircraft routing for amphibious ready groups ⋮ Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows ⋮ Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person ⋮ Column generation for vehicle routing problems with multiple synchronization constraints ⋮ The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches ⋮ Solving the truck and trailer routing problem based on a simulated annealing heuristic ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension ⋮ Vehicle routing with transportable resources: using carpooling and walking for on-site services ⋮ A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning

Cites Work

• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• The vehicle routing problem. Latest advances and new challenges.
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• A mixed-integer model for solving ordering problems with side constraints
• Solving real-life vehicle routing problems efficiently using tabu search
• A new mixed integer linear model for a rich vehicle routing problem with docking constraints
• Formulations and valid inequalities for the heterogeneous vehicle routing problem
• Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post
• A tabu search heuristic for the truck and trailer routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A tabu search method for the truck and trailer routing problem

This page was built for publication: Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments