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

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

Cited in

(only showing first 100 items - show all)

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

Describes a project that uses

Uses Software

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)