Parallel iterative search methods for vehicle routing problems
From MaRDI portal
Publication:4291474
DOI10.1002/net.3230230804zbMath0804.90045OpenAlexW2052614107MaRDI QIDQ4291474
Publication date: 9 May 1994
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230804
Related Items
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company, 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, Vehicle routing problems with multiple trips, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Vehicle routing problems with multiple trips, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, 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, Use of the BATA algorithm and MIS to solve the mail carrier problem, A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, A comparison of five heuristics for the multiple depot vehicle scheduling problem, A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints, Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm, A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem, An improved ant colony optimization for vehicle routing problem, Simulated annealing heuristic for the general share-a-ride 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, Adaptive memory programming for the vehicle routing problem with multiple trips, Large neighborhood search for multi-trip vehicle routing, Dynamic vehicle routing using genetic algorithms, The service allocation problem at the Gioia Tauro maritime terminal, A memetic algorithm for the travelling salesperson problem with hotel selection, Large-scale vehicle routing problems: quantum annealing, tunings and results, A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline, An efficient implementation of a static move descriptor-based local search heuristic, 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, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, 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, A monarch butterfly optimization for the dynamic vehicle routing problem, A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector, A general heuristic for vehicle routing problems, General solutions to the single vehicle routing problem with pickups and deliveries, Designing delivery districts for the vehicle routing problem with stochastic demands, The simulated trading heuristic for solving vehicle routing problems, An efficient variable neighborhood search heuristic for very large scale 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, DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic, Parallel local search, Probabilistic diversification and intensification in local search for vehicle routing, 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, The close-open mixed vehicle routing problem, Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem, Improvement heuristics for the vehicle routing problem based on simulated annealing, Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem, A survey of the standard location-routing problem, Decomposition techniques with mixed integer programming and heuristics for home healthcare planning, Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem, A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem., Optimised crossover genetic algorithm for capacitated vehicle routing problem, D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, A neural-tabu search heuristic for the real time vehicle routing problem, Local search heuristics for the probabilistic dial-a-ride problem, A tabu search heuristic for the generalized minimum spanning tree problem, Heuristics for the lexicographic Max-ordering vehicle routing problem, A comparison of algorithms for finding an efficient theme park tour, 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, 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, POPMUSIC for the travelling salesman problem, New benchmark instances for the capacitated vehicle routing problem, The single vehicle routing problem with deliveries and selective pickups, A tabu search approach for the livestock collection problem, A study on the effect of the asymmetry on real capacitated vehicle routing problems, A survey of very large-scale neighborhood search techniques, Honey bees mating optimization algorithm for large scale vehicle routing problems, Active guided evolution strategies for large-scale vehicle routing problems with time windows, A comparison of problem decomposition techniques for the FAP, Sequential search and its application to vehicle-routing problems, A tabu search algorithm for the open vehicle routing problem, Path relinking for the vehicle routing problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, A heuristic algorithm for the truckload and less-than-truckload problem, Dynamic transportation of patients in hospitals, A library of local search heuristics for the vehicle routing problem, Solving the vehicle routing problem with adaptive memory programming methodology, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, A memetic algorithm for the multi trip vehicle routing problem, A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, Extensions to the generalised assignment heuristic for vehicle routing, Parallel processing for difficult combinatorial optimization problems, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, Planning models for freight transportation, Combination of local search and CLP in the vehicle-fleet scheduling problem, 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, A tabu search heuristic for the truck and trailer routing problem, Fast local search algorithms for the handicapped persons transportation problem, A sweep-based algorithm for the fleet size and mix vehicle routing problem, Ant colony system for a dynamic vehicle routing problem, The periodic vehicle routing problem with intermediate facilities, A visual interactive approach to vehicle routing, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, A genetic algorithm for the vehicle routing problem
Cites Work
