An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
type: Item
instance of: scholarly article
title: An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
zbMATH Open document ID: 1498.90184
author: Francesco Cavaliere
author: Emilio Bendotti
author: Matteo Fischetti
published in: Mathematical Programming Computation
publication date: 2022-11-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7622736
zbMATH Keywords: capacitated vehicle routing problem
zbMATH Keywords: heuristics
zbMATH Keywords: local search
zbMATH Keywords: set partitioning
zbMATH Keywords: computational analysis
describes a project that uses: Cvrplib
describes a project that uses: LKH3
describes a project that uses: VRPSolver
describes a project that uses: VRP
describes a project that uses: LKH
describes a project that uses: POPMUSIC
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s12532-022-00224-2
OpenAlex ID: W4283782954
cites work: Q4735941
cites work: Chained Lin-Kernighan for large traveling salesman problems
cites work: Efficiently solving very large-scale routing problems
cites work: A Heuristic Method for the Set Covering Problem
cites work: The truck dispatching problem
cites work: The Decomposition Algorithm for Linear Programs
cites work: A new ILP-based refinement heuristic for vehicle routing problems
cites work: Handbook of Heuristics
cites work: A suggested computation for maximal multi-commodity network flows
cites work: An Integer Programming Approach to the Vehicle Scheduling Problem
cites work: Data Structures for Traveling Salesmen
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
cites work: Transforming asymmetric into symmetric traveling salesman problems: Erratum
cites work: Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
cites work: A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
cites work: Optimization by Simulated Annealing
cites work: Optimal Routing under Capacity and Distance Restrictions
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Large-step Markov chains for the TSP incorporating local search heuristics
cites work: A set-covering-based heuristic approach for bin-packing problems
cites work: Improved branch-cut-and-price for capacitated vehicle routing
cites work: A generic exact solver for vehicle routing and related problems
cites work: A review of dynamic vehicle routing problems
cites work: A POPMUSIC matheuristic for the capacitated vehicle routing problem
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: An evolutionary algorithm for polishing mixed integer programming solutions
cites work: Extensions of the Petal Method for Vehicle Routeing
cites work: A hybrid algorithm for a class of vehicle routing problems
cites work: POPMUSIC for the travelling salesman problem
cites work: Vehicle Routing
cites work: New benchmark instances for the capacitated vehicle routing problem
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
DOI: 10.1007/S12532-022-00224-2
description: scientific article; zbMATH DE number 7622736