A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
From MaRDI portal
Publication:2178911
DOI10.1007/s00291-019-00568-7zbMath1437.90034OpenAlexW2991256307MaRDI QIDQ2178911
Publication date: 11 May 2020
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-019-00568-7
mixed integer linear programmingvehicle routing problemmatheuristicmultiple depotsinter-depot routes
Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Estimating the marginal cost to deliver to individual customers ⋮ A memetic algorithm for solving rich waste collection problems ⋮ Integrating micro-depot freight transport in existing public transport services ⋮ An efficient multistart heuristic for the driver and vehicle routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The multi-depot vehicle routing problem with inter-depot routes
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- The periodic vehicle routing problem with intermediate facilities
- A tabu search heuristic for the multi-depot vehicle routing problem
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops
- A unified exact method for solving different classes of vehicle routing problems
- Waste collection vehicle routing problem with time windows
- A memetic algorithm for the multi trip vehicle routing problem
- A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
- Vehicle Routing
- Matheuristics
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Solution of a Large-Scale Traveling-Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
This page was built for publication: A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
