An Investigation on Compound Neighborhoods for VRPTW

DOI10.1007/978-3-319-53982-9_1zbMath1360.90121OpenAlexW2588308672MaRDI QIDQ2980168

Rong Qu, Hisao Ishibuchi, Binhui Chen, Ruibin Bai

Publication date: 28 April 2017

Published in: Operations Research and Enterprise Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53982-9_1

zbMATH Keywords

metaheuristicsvehicle routing problem with time windowsvariable neighbourhood searchcompound neighbourhood

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• J-MEANS
• VRP

Cites Work

• Unnamed Item
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• Variable neighbourhood search: methods and applications
• The vehicle routing problem: An overview of exact and approximate algorithms
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Variable neighborhood search
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Variable neighborhood decomposition search
• Tabu search heuristics for the vehicle routing problem with time windows.
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A variable neighborhood search heuristic for periodic routing problems
• A variable neighbourhood search algorithm for the open vehicle routing problem
• Multi-objective vehicle routing problems
• Variable neighborhood search and local branching
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• Lagrangian duality applied to the vehicle routing problem with time windows
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
• A Subpath Ejection Method for the Vehicle Routing Problem
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Computer Solutions of the Traveling Salesman Problem
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: An Investigation on Compound Neighborhoods for VRPTW