The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
From MaRDI portal
Publication:2884563
DOI10.1287/ijoc.15.4.333.24890zbMath1238.90141OpenAlexW2134946882MaRDI QIDQ2884563
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
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, 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, The mixed capacitated general routing problem under uncertainty, The electric two-echelon vehicle routing problem, 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, The vehicle-routing problem with time windows and driver-specific times, Applying the attribute based hill climber heuristic to the vehicle routing problem, 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 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 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, A general heuristic for vehicle routing problems, Bifactor approximation for location routing with vehicle and facility capacities, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, 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, 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 team orienteering problem with time windows: an LP-based granular variable neighborhood search, The min-cost parallel drone scheduling vehicle routing problem, A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution, Neural networks for local search and crossover in vehicle routing: a possible overkill?, The r‐interdiction selective multi‐depot vehicle routing problem, A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times, 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, Designing granular solution methods for routing problems with time windows, A relax-and-repair heuristic for the swap-body vehicle routing problem, In-depth analysis of granular local search for capacitated vehicle routing, Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems, Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem, A survey of the standard location-routing problem, Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem, Optimised crossover genetic algorithm for capacitated vehicle routing problem, Vehicle routing with arrival time diversification, Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach, D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., Knowledge-guided local search for the vehicle routing problem, Heuristics for vehicle routing problems: sequence or set optimization?, Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, Solving the capacitated location-routing problem. Abstract of Thesis, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, Efficiently solving very large-scale routing problems, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, Minimizing customers' waiting time in a vehicle routing problem with unit demands, A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs, The Split Delivery Vehicle Routing Problem: A Survey, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, The petrol station replenishment problem with time windows, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering, Restricted dynamic programming: a flexible framework for solving realistic VRPs, A cooperative parallel metaheuristic for the capacitated vehicle routing problem, Models, relaxations and exact approaches for the capacitated vehicle routing problem, 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, A tabu search algorithm for the open vehicle routing problem, Path relinking for the vehicle routing problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions, On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, Solving the vehicle routing problem with adaptive memory programming methodology, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A hybrid algorithm for time-dependent vehicle routing problem with time windows, The dynamic dispatch waves problem for same-day delivery, 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, 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, The ALGACEA‐1 method for the capacitated vehicle routing problem, 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, A matheuristic for the generalized order acceptance and scheduling problem, 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, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem, Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem, The multiple traveling salesman problem in presence of drone- and robot-supported packet stations, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Metaheuristics in combinatorial optimization, Data-Driven Robust Resource Allocation with Monotonic Cost Functions
Uses Software
