In-depth analysis of granular local search for capacitated vehicle routing

DOI10.1016/J.DAM.2022.12.019MaRDI QIDQ2686133zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 24 February 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2022.12.019

zbMATH Keywords

granular local searchroutingstatistical analysis

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Operations research and management science (90Bxx) Mathematical programming (90Cxx)

Recommendations

• The granular tabu search and its application to the vehicle-routing problem
• Testing local search move operators on the vehicle routing problem with split deliveries and time windows
• An integer linear programming local search for capacitated vehicle routing problems
• Knowledge-guided local search for the vehicle routing problem
• Designing granular solution methods for routing problems with time windows

Cites work

• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• A hybrid algorithm for a class of vehicle routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A note on performance profiles for benchmarking software
• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• An efficient implementation of a static move descriptor-based local search heuristic
• An efficient implementation of local search algorithms for constrained routing problems
• Benchmarking optimization software with performance profiles.
• Computer Solutions of the Traveling Salesman Problem
• Designing granular solution methods for routing problems with time windows
• Fast local search algorithms for the handicapped persons transportation problem
• First vs. best improvement: an empirical study
• scientific article; zbMATH DE number 1082108 (Why is no real title available?)
• Knowledge-guided local search for the vehicle routing problem
• New benchmark instances for the capacitated vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Sequential search and its application to vehicle-routing problems
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Statistical Analysis of Computational Tests of Algorithms and Heuristics
• The granular tabu search and its application to the vehicle-routing problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Vehicle Routing
• Very large-scale vehicle routing: new test problems, algorithms, and results

Cited in

(5)

• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• Designing granular solution methods for routing problems with time windows
• Rule-based design of a granular tabu search for the multi-depot vehicle routing problem
• First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim
• Solving heterogeneous vehicle routing problems using decomposition and set covering

Describes a project that uses

Uses Software

• VRP

This page was built for publication: In-depth analysis of granular local search for capacitated vehicle routing

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