The granular tabu search and its application to the vehicle-routing problem

DOI10.1287/IJOC.15.4.333.24890zbMATH Open1238.90141OpenAlexW2134946882MaRDI QIDQ2884563FDOQ2884563

Authors: Paolo Toth, Daniele Vigo 

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.15.4.333.24890

Recommendations

• Tabu Search for Vehicle Routing Problems (VRPs)
• scientific article; zbMATH DE number 2209651
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A tabu search algorithm for the vehicle routing problem
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A reactive tabu search for the vehicle routing problem
• An iterated tabu search for the multi-compartment vehicle routing problem
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem

zbMATH Keywords

heuristic algorithmscapacitated vehicle-routing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cited In (only showing first 100 items - show all)

• The mixed capacitated general routing problem under uncertainty
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• Implicit depot assignments and rotations in vehicle routing heuristics
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• Sequential search and its application to vehicle-routing problems
• Applying the attribute based hill climber heuristic to the vehicle routing problem
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• A tabu search algorithm for the open vehicle routing problem
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
• Solving the vehicle routing problem with adaptive memory programming methodology
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• A general heuristic for vehicle routing problems
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem
• The r‐interdiction selective multi‐depot vehicle routing problem
• Optimised crossover genetic algorithm for capacitated vehicle routing problem
• The dynamic dispatch waves problem for same-day delivery
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• Path relinking for the vehicle routing problem
• The split delivery vehicle routing problem: A survey
• A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
• The petrol station replenishment problem with time windows
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
• The vehicle-routing problem with time windows and driver-specific times
• A note on the time travel approach for handling time windows in vehicle routing problems
• A large neighbourhood based heuristic for two-echelon routing problems
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Routing and scheduling field service operation by P-graph
• Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
• A tabu search algorithm for the multi-period inspector scheduling problem
• A memetic algorithm for the multi trip vehicle routing problem
• A unified solution framework for multi-attribute vehicle routing problems
• A simple and effective evolutionary algorithm for the capacitated location-routing problem
• Metaheuristics in combinatorial optimization
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• A comparative study of task assignment and path planning methods for multi-UGV missions
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
• Approximative solutions to the bicriterion vehicle routing problem with time windows
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• The electric two-echelon vehicle routing problem
• Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering
• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
• Solving the capacitated location-routing problem. Abstract of Thesis
• A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times
• Restricted dynamic programming: a flexible framework for solving realistic VRPs
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• An integer linear programming local search for capacitated vehicle routing problems
• An iterated local search algorithm for the vehicle routing problem with backhauls
• Very large-scale vehicle routing: new test problems, algorithms, and results
• In-depth analysis of granular local search for capacitated vehicle routing
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
• Data-driven robust resource allocation with monotonic cost functions
• The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
• Heuristics for vehicle routing problems: sequence or set optimization?
• Knowledge-guided local search for the vehicle routing problem
• An iterated tabu search for the multi-compartment vehicle routing problem
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
• Efficiently solving very large-scale routing problems
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
• The min-cost parallel drone scheduling vehicle routing problem
• Minimizing customers' waiting time in a vehicle routing problem with unit demands
• Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
• The ALGACEA‐1 method for the capacitated vehicle routing problem
• A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group
• A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
• Neural networks for local search and crossover in vehicle routing: a possible overkill?
• Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
• Determination of the candidate arc set for the asymmetric traveling salesman problem
• Applying an intensification strategy on vehicle routing problem
• An efficient implementation of a static move descriptor-based local search heuristic
• A survey of the standard location-routing problem
• The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
• Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach
• A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection
• A hybrid algorithm for time-dependent vehicle routing problem with time windows
• A hybrid genetic algorithm for the Hamiltonian p‐median problem
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
• Bifactor approximation for location routing with vehicle and facility capacities
• Routing electric vehicles with a single recharge per route
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• A new ant colony optimization algorithm to solve the periodic capacitated arc routing problem with continuous moves

Uses Software

• VRP

This page was built for publication: The granular tabu search and its application to the vehicle-routing problem

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