A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes

DOI10.1007/S00291-019-00568-7MaRDI QIDQ2178911zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

inter-depot routesmatheuristicmixed integer linear programmingmultiple depotsvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Linear programming (90C05) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The multi-depot vehicle routing problem with inter-depot routes
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• The Multi-Depot Routing Allocation Problem
• Mathematical formulations and improvements for the multi-depot open vehicle routing problem
• An improved formulation for the multi-depot open vehicle routing problem

Cites work

• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
• A memetic algorithm for the multi trip vehicle routing problem
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A tabu search heuristic for the multi-depot vehicle routing problem
• A unified exact method for solving different classes of vehicle routing problems
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 3883903 (Why is no real title available?)
• scientific article; zbMATH DE number 1749224 (Why is no real title available?)
• Matheuristics
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• The multi-depot vehicle routing problem with inter-depot routes
• The periodic vehicle routing problem with intermediate facilities
• Vehicle Routing
• Waste collection vehicle routing problem with time windows

Cited in

(7)

• Mathematical formulations and improvements for the multi-depot open vehicle routing problem
• An efficient multistart heuristic for the driver and vehicle routing problem
• A survey on matheuristics for routing problems
• 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
• The multi-depot vehicle routing problem with inter-depot routes

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178911)