Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
From MaRDI portal
Publication:2367016
Cites work
- A Lagrangean relaxation heuristic for vehicle routing
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Bounds and Heuristics for Capacitated Routing Problems
- Computer Solutions of the Traveling Salesman Problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Future paths for integer programming and links to artificial intelligence
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- scientific article; zbMATH DE number 4085396 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- Implementation techniques for the vehicle routing problem
- Optimal Routing under Capacity and Distance Restrictions
- Optimization by simulated annealing
- Parallel Savings Based Heuristics for the Delivery Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- The savings algorithm for the vehicle routing problem
Cited in
(only showing first 100 items - show all)- A local search heuristic for the pre- and end-haulage of intermodal container terminals
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- Approximative solutions to the bicriterion vehicle routing problem with time windows
- A genetic algorithm for service level based vehicle scheduling
- General local search methods
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- Genetic algorithms and tabu search: Hybrids for optimization
- Using tabu search for solving a dynamic multi-terminal truck dispatching problem
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Integrating purchasing and routing in a propane gas supply chain.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
- Heuristic solutions to multi-depot location-routing problems
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- Search strategies for the feeder bus network design problem
- A two-phase tabu search approach to the location routing problem
- Use of the BATA algorithm and MIS to solve the mail carrier problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- Managing platelet supply through improved routing of blood collection vehicles
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
- A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run
- A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost
- Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis
- Multi-trip pickup and delivery problem with time windows and synchronization
- The late acceptance hill-climbing heuristic
- Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- Solving fixed charge transportation problem with truck load constraint using metaheuristics
- Heuristic algorithms for the single allocation p-hub center problem with routing considerations
- Ant colony optimization with clustering for solving the dynamic location routing problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A heuristic algorithm for the truckload and less-than-truckload problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- Extensions to the generalised assignment heuristic for vehicle routing
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A visual interactive approach to vehicle routing
- A genetic algorithm for the vehicle routing problem
- Tabu search heuristics for the vehicle routing problem with time windows.
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Routing problems: A bibliography
- The simulated trading heuristic for solving vehicle routing problems
- A tabu search heuristic for the multi-depot vehicle routing problem
- A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Focused simulated annealing search: An application to job shop scheduling
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Tabu search for graph partitioning
- A tabu search algorithm for frequency assignment
- Metaheuristics: A bibliography
- Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control
- A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems
- Location of facility based on simulated annealing and ``ZKW algorithms
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
- An evolutionary approach for the target search problem in uncertain environment
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
- Using cost change estimates in a local search heuristic for the pollution routing problem
- A user's guide to tabu search
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- A heuristic for the routing and carrier selection problem
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- An improved ant colony optimization for vehicle routing problem
- Dynamic vehicle routing using genetic algorithms
- Designing multi-period supply chain network considering risk and emission: a multi-objective approach
- Integrating multi-product production and distribution in newspaper logistics
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Heuristics for the lexicographic Max-ordering vehicle routing problem
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
- Sequential search and its application to vehicle-routing problems
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- Fast and high precision algorithms for optimization in large-scale genomic 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
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- Heuristic approaches to vehicle routing with backhauls and time windows
- A scatter search heuristic for the capacitated clustering problem
- Scatter search for the vehicle routing problem with time windows
- A tabu search heuristic for the truck and trailer routing problem
- Fast local search algorithms for the handicapped persons transportation problem
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- The mixed capacitated general routing problem under uncertainty
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- Route optimization cold chain logistic distribution using greedy search method
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
- An investigation on compound neighborhoods for VRPTW
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Hybrid simulated annealing with memory: an evolution-based diversification approach
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
This page was built for publication: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367016)
