Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
From MaRDI portal
Publication:320995
DOI10.1016/j.ejor.2015.08.040zbMath1346.90123OpenAlexW1853087932MaRDI QIDQ320995
Dominique Feillet, Olivier Naud, Florent Hernandez, Rodolphe Giroudeau
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.08.040
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (16)
A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain ⋮ Multi-trip vehicle routing problem with order release time ⋮ Feeder routing for air-to-air refueling operations ⋮ Tug scheduling for hinterland barge transport: a branch-and-price approach ⋮ A branch-and-price algorithm for a routing problem with inbound and outbound requests ⋮ A two‐tier urban delivery network with robot‐based deliveries ⋮ Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows ⋮ Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows ⋮ Routing in offshore wind farms: a multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat ⋮ The multi-trip container drayage problem with synchronization for efficient empty containers re-usage ⋮ Solving vehicle routing problems with intermediate stops using VRPSolver models ⋮ A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach ⋮ An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows ⋮ An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics ⋮ A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities ⋮ The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
Uses Software
Cites Work
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- A column generation algorithm for the vehicle routing problem with soft time windows
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
This page was built for publication: Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
