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