A Tabu Search Heuristic for the Vehicle Routing Problem
From MaRDI portal
Publication:4834331
Recommendations
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- scientific article; zbMATH DE number 2209651
- A tabu search algorithm for the vehicle routing problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Tabu search heuristics for the vehicle routing problem with time windows.
Cited in
(only showing first 100 items - show all)- An efficient heuristic for reliability design optimization problems
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- A tabu search heuristic and adaptive memory procedure for political districting
- A tabu search algorithm for the open vehicle routing problem
- Routing problems with loading constraints
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- New heuristics for the vehicle routing problem
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Bike sharing systems: solving the static rebalancing problem
- A hybrid heuristic for an inventory routing problem
- A tabu search heuristic for the truck and trailer routing problem
- A TABU search heuristic for the team orienteering problem
- A new tabu search algorithm for the vehicle routing problem with backhauls
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Parallel solution methods for vehicle routing problems
- Recent models and algorithms for one-to-one pickup and delivery problems
- From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
- Probabilistic diversification and intensification in local search for vehicle routing
- Metaheuristics: A bibliography
- A tabu search heuristic for the multi-depot vehicle routing problem
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Designing and reporting on computational experiments with heuristic methods
- A guided local search heuristic for the capacitated arc routing problem
- Managing platelet supply through improved routing of blood collection vehicles
- The periodic vehicle routing problem with intermediate facilities
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- Location of hubs in a competitive environment
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- A new ILP-based refinement heuristic for vehicle routing problems
- A library of local search heuristics for the vehicle routing problem
- Tabu search embedded simulated annealing for the shortest route cut and fill problem
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- A threshold accepting approach to the Open Vehicle Routing problem
- The undirected capacitated arc routing problem with profits
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A genetic algorithm for the vehicle routing problem
- Heuristic solutions to multi-depot location-routing problems
- Solving transportation problems with nonlinear side constraints with tabu search
- A tabu search approach for the livestock collection problem
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods
- The dial-a-ride problem: Models and algorithms
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- Extensions to the generalised assignment heuristic for vehicle routing
- The multi-depot vehicle routing problem with inter-depot routes
- Routing problems: A bibliography
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A solution method for a two-layer sustainable supply chain distribution model
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Heuristic algorithms for the multi-depot ring-star problem
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- The period vehicle routing problem and its extensions
- A heuristic algorithm for the truckload and less-than-truckload problem
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- The granular tabu search and its application to the vehicle-routing problem
- Vehicle routing with dynamic travel times: a queueing approach
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- Planning models for freight transportation
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- The multi-compartment vehicle routing problem with flexible compartment sizes
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- The vehicle-routing problem with time windows and driver-specific times
- A variable neighbourhood search algorithm for the open vehicle routing problem
- An evolutionary algorithm for the vehicle routing problem with route balancing
- A tabu search method for the truck and trailer routing problem
- Adaptive memory programming for the vehicle routing problem with multiple trips
- scientific article; zbMATH DE number 1054962 (Why is no real title available?)
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- Minimum cost VRP with time-dependent speed data and congestion charge
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Heuristics for the lexicographic Max-ordering vehicle routing problem
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Integrating purchasing and routing in a propane gas supply chain.
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
- Adaptive memory programming: a unified view of metaheuristics
This page was built for publication: A Tabu Search Heuristic for the Vehicle Routing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834331)