A Tabu Search Heuristic for the Vehicle Routing Problem
From MaRDI portal
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)- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- 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 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 penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Heuristic algorithms for the multi-depot ring-star problem
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- Planning models for freight transportation
- Location of hubs in a competitive environment
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- A tabu search algorithm for the vehicle routing problem
- Using the tabu search method for the distribution of supplies in a hospital
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- Genetic algorithms and tabu search: Hybrids for optimization
- A TSSP+1 decomposition strategy for the vehicle routing problem
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Integrating purchasing and routing in a propane gas supply chain.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- The periodic vehicle routing problem with intermediate facilities
- Heuristic solutions to multi-depot location-routing problems
- Search strategies for the feeder bus network design problem
- An adaptive large neighborhood search for relocating vehicles in electric carsharing services
- Managing platelet supply through improved routing of blood collection vehicles
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- An iterated tabu search for the multi-compartment vehicle routing problem
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
- A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost
- Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- Resource constrained routing and scheduling: review and research prospects
- Designing granular solution methods for routing problems with time windows
- From theory to practice: maximizing revenues for on-line dial-a-ride
- Vehicle routing with arrival time diversification
- 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
- Ant colony optimization with clustering for solving the dynamic location routing problem
- Scheduling in-house transport vehicles to feed parts to automotive assembly lines
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- A TABU search heuristic for the team orienteering problem
- A heuristic algorithm for the truckload and less-than-truckload problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A dynamic vehicle routing problem with time-dependent travel times
- Vehicle routing and appointment scheduling with team assignment for home services
- Extensions to the generalised assignment heuristic for vehicle routing
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A tabu search heuristic and adaptive memory procedure for political districting
- 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 guided local search heuristic for the capacitated arc routing problem
- Solving transportation problems with nonlinear side constraints with tabu search
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Routing problems: A bibliography
- Common due-date determination and sequencing using tabu search
- 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
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Tabu search for graph partitioning
- Metaheuristics: A bibliography
- Designing and reporting on computational experiments with heuristic methods
- Probabilistic diversification and intensification in local search for vehicle routing
- The close-open mixed vehicle routing problem
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- Self-imposed time windows in vehicle routing problems
- A hybrid algorithm for time-dependent vehicle routing problem with time windows
- Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks
- An infeasible space exploring matheuristic for the production routing problem
- A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- Fairness in ambulance routing for post disaster management
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
- Multiple k-opt evaluation multiple k-opt moves with GPU high performance local search to large-scale traveling salesman problems
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Scheduling the replenishment of just-in-time supermarkets in assembly plants
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A queueing framework for routing problems with time-dependent travel times
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- An evolutionary algorithm for the vehicle routing problem with route balancing
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Vehicle routing with dynamic travel times: a queueing approach
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)