A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
type: Item
instance of: scholarly article
title: A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
author: Sinaide Nunes Bezerra
author: M. J. F. Souza
author: Sérgio Ricardo de Souza
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634067
zbMATH Keywords: multi-depot vehicle routing problem with time windows
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: neighborhood
zbMATH Keywords: local search
describes a project that uses: METSlib
describes a project that uses: MDVRPTW
describes a project that uses: irace
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106016
OpenAlex ID: W4294904133
cites work: An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
cites work: A GVNS algorithm for solving the multi-depot vehicle routing problem
cites work: Q4532229
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
cites work: Variable neighbourhood search: methods and applications
cites work: Variable neighborhood search: basics and variants
cites work: An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
cites work: Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
cites work: An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
cites work: Multi-depot vehicle routing problem with time windows under shared depot resources
cites work: Variable neighborhood search
cites work: High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
cites work: A general heuristic for vehicle routing problems
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A hybrid heuristic algorithm for the open-pit-mining operational planning problem
cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
cites work: New measures of proximity for the assignment algorithms in the MDVRPTW
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
cites work: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
cites work: Implicit depot assignments and rotations in vehicle routing heuristics
DOI: 10.1016/J.COR.2022.106016
Recommended article: A new variable neighborhood search algorithm for the multi depot heterogeneous vehicle routing problem with time windows
Recommended article: An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints
Recommended article: Q4827942
Recommended article: Variable neighborhood search for vehicle routing problem with multiple time windows
Recommended article: Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows
Recommended article: Variable neighborhood descent for solving the vehicle routing problem with time windows
Recommended article: Variable neighbourhood search for close–open vehicle routing problem with time windows
description: scientific article; zbMATH DE number 7634067