Parallel iterative search methods for vehicle routing problems
From MaRDI portal
Recommendations
- Solving variants of the vehicle routing problem with a simple parallel iterated tabu search
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- scientific article; zbMATH DE number 1054962
- Parallel solution methods for vehicle routing problems
- A parallel algorithm for the vehicle routing problem with time window constraints
Cites work
Cited in
(only showing first 100 items - show all)- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls
- Solving a manpower scheduling problem for airline catering using metaheuristics
- Parallel processing for difficult combinatorial optimization problems
- Planning models for freight transportation
- Combination of local search and CLP in the vehicle-fleet scheduling problem
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- The periodic vehicle routing problem with intermediate facilities
- Use of the BATA algorithm and MIS to solve the mail carrier problem
- Large-scale vehicle routing problems: quantum annealing, tunings and results
- An efficient implementation of a static move descriptor-based local search heuristic
- A monarch butterfly optimization for the dynamic vehicle routing problem
- A survey of the standard location-routing problem
- Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
- A comparison of algorithms for finding an efficient theme park tour
- New benchmark instances for the capacitated vehicle routing problem
- A study on the effect of the asymmetry on real capacitated vehicle routing problems
- 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
- 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
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Routing problems: A bibliography
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- The simulated trading heuristic for solving vehicle routing problems
- A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- Metaheuristics: A bibliography
- Parallel local search
- Probabilistic diversification and intensification in local search for vehicle routing
- The close-open mixed vehicle routing problem
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- POPMUSIC for the travelling salesman problem
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- Deep infeasibility exploration method for vehicle routing problems
- Dynamic transportation of patients in hospitals
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- An improved ant colony optimization for vehicle routing problem
- Dynamic vehicle routing using genetic algorithms
- 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
- Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
- The single vehicle routing problem with deliveries and selective pickups
- A tabu search approach for the livestock collection problem
- Sequential search and its application to vehicle-routing 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
- A memetic algorithm for the multi trip vehicle routing problem
- A tabu search heuristic for the truck and trailer routing problem
- Fast local search algorithms for the handicapped persons transportation problem
- Ant colony system for a dynamic vehicle routing problem
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- Visual attractiveness in vehicle routing via bi-objective optimization
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- The k-dissimilar vehicle routing problem
- An ant colony system for responsive dynamic vehicle routing
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- Large neighborhood search for multi-trip vehicle routing
- A memetic algorithm for the travelling salesperson problem with hotel selection
- 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
- A hybrid large neighborhood search for dynamic vehicle routing problem with time deadline
- A tabu search procedure for coordinating production, inventory and distribution routing problems
- Parallel solution methods for vehicle routing problems
- An integer linear programming local search for capacitated vehicle routing problems
- Recent models and algorithms for one-to-one pickup and delivery problems
- scientific article; zbMATH DE number 4049386 (Why is no real title available?)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- On an iterative procedure for solving a routing problem with constraints
- Simulated annealing heuristic for the general share-a-ride problem
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
- Solving the vessel routing and scheduling problem at a Canadian maritime transportation company
- Vehicle routing problems with multiple trips
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Vehicle routing problems with multiple trips
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
- Adaptive memory programming: a unified view of metaheuristics
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- On the shortest path problem with negative cost cycles
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
- Safe and secure vehicle routing: a survey on minimization of risk exposure
- “Make no little plans”: Impactful research to solve the next generation of transportation problems
- Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems
- Lower and upper bounds for the m-peripatetic vehicle routing problem
- Local search heuristics for the probabilistic dial-a-ride problem
This page was built for publication: Parallel iterative search methods for vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291474)
