Probabilistic diversification and intensification in local search for vehicle routing

From MaRDI portal

Publication:1922635

Jump to:navigation, search

DOI10.1007/BF02430370zbMath0857.90032MaRDI QIDQ1922635

Éric D. Taillard, Yves Rochat

Publication date: 1 September 1996

Published in: Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

vehicle routing local search parallel algorithms probabilistic technique

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Parallel numerical computation (65Y05) Distributed algorithms (68W15)

Related Items

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, 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, A review of vehicle routing with simultaneous pickup and delivery, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows, A metaheuristic based on tabu search for solving a technician routing and scheduling problem, Preprocessing to reduce vehicle capacity for routing problems, Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier, Metaheuristics: A Canadian Perspective, Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems, Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique, A parallel adaptive memory algorithm for the capacitated modular hub location problem, Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework, An Investigation on Compound Neighborhoods for VRPTW, Competition and Cooperation in Pickup and Multiple Delivery Problems, Vehicle routing problems with multiple trips, Multi-coloring and job-scheduling with assignment and incompatibility costs, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, An adaptive memory algorithm for the \(k\)-coloring problem, Vehicle routing problems with multiple trips, AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS, A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST, Ejection chain and filter-and-fan methods in combinatorial optimization, Routing a Heterogeneous Fleet of Vehicles, Parallel Solution Methods for Vehicle Routing Problems, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics, A taboo search heuristic for the optimisation of a multistage component placement system, Ejection chain and filter-and-fan methods in combinatorial optimization, COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM, A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem, Vehicle routing problem with elementary shortest path based column generation, Sequential search and its application to vehicle-routing problems, A survey of local search methods for graph coloring, A first multilevel cooperative algorithm for capacitated multicommodity network design, Path relinking for the vehicle routing problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, An efficient tabu algorithm for the single row facility layout problem, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Waste collection vehicle routing problem with time windows, An adaptive memory programming method for risk logistics operations, A memetic algorithm for the vehicle routing problem with time windows, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, Adaptive memory programming: a unified view of metaheuristics, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, A survey on matheuristics for routing problems, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, Transport clustering and routing as a visual meshing process, A memetic algorithm for the multi trip vehicle routing problem, Chain partitioning as a key element for building vehicle routing problem heuristics, A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm, A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows, Heuristic approaches to vehicle routing with backhauls and time windows, A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems, On line Routing per Mobile Phone A Case on Subsequent Deliveries of Newspapers, Scatter search for the vehicle routing problem with time windows, Memory and Learning in Metaheuristics, A matheuristic for the truck and trailer routing problem, 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, Use of the BATA algorithm and MIS to solve the mail carrier problem, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, Graph colouring approaches for a satellite range scheduling problem, A multi-start local search algorithm for the vehicle routing problem with time windows, Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer, Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm, An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP, Computing the metric dimension of graphs by genetic algorithms, Thirty years of heterogeneous vehicle routing, Adaptive memory programming for the vehicle routing problem with multiple trips, Large neighborhood search for multi-trip vehicle routing, The multi-depot vehicle routing problem with inter-depot routes, A hybrid algorithm for a class of vehicle routing problems, A hybrid data mining GRASP with path-relinking, Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem, An adaptive large neighborhood search for a vehicle routing problem with multiple routes, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading, A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows, A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem, A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows, A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking, Vehicle routing problem with stochastic travel times including soft time windows and service costs, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, Vehicle routing for milk collection with gradual blending: a case arising in Chile, A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Metaheuristics: A bibliography, A multi-space sampling heuristic for the vehicle routing problem with stochastic demands, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic, A hybrid algorithm for the heterogeneous fleet vehicle routing problem, Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities, A hybrid search method for the vehicle routing problem with time windows, Local search with annealing-like restarts to solve the VRPTW, A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network, Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies., Heuristics for a project management problem with incompatibility and assignment costs, A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem., Solving a fuel delivery problem by heuristic and exact approaches., Guidelines for the use of meta-heuristics in combinatorial optimization., Combination of geographical information system and efficient routing algorithms for real life distribution operations., Optimised crossover genetic algorithm for capacitated vehicle routing problem, Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands, A multi-phase constructive heuristic for the vehicle routing problem with multiple trips., A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows, D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., A GA based heuristic for the vehicle routing problem with multiple trips, A neural-tabu search heuristic for the real time vehicle routing problem, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem, Record breaking optimization results using the ruin and recreate principle, Scatter search for the fleet size and mix vehicle routing problem with time windows, Integrated express shipment service network design with customer choice and endogenous delivery time restrictions, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, New benchmark instances for the capacitated vehicle routing problem, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, A time-based pheromone approach for the ant system, Adaptive memory in multistart heuristics for multicommodity network design, A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation, Honey bees mating optimization algorithm for large scale vehicle routing problems, Optimizing departure times in vehicle routes, A TABU search heuristic for the team orienteering problem, Active guided evolution strategies for large-scale vehicle routing problems with time windows, A tabu search algorithm for the open vehicle routing problem, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, Greedy random adaptive memory programming search for the capacitated clustering problem, A heuristic algorithm for the truckload and less-than-truckload problem, A library of local search heuristics for the vehicle routing problem, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, Solving the vehicle routing problem with adaptive memory programming methodology, An adaptive VNS algorithm for vehicle routing problems with intermediate stops, Metaheuristics for a scheduling problem with rejection and tardiness penalties, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Industrial aspects and literature survey: fleet composition and routing, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows, Exact and hybrid methods for the multiperiod field service routing problem, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem, Vehicle routing problem with time windows and a limited number of vehicles., General local search methods, Adaptive granular local search heuristic for a dynamic vehicle routing problem, Planning models for freight transportation, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries, Solving a manpower scheduling problem for airline catering using metaheuristics, Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil, A framework for the description of evolutionary algorithms, On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem, Diversification strategies in local search for a nonbifurcated network loading problem, A sweep-based algorithm for the fleet size and mix vehicle routing problem, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, Multiterminal net assignments by scatter search, Search strategies for the feeder bus network design problem, Proposals for chunking and tabu search, 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, Metaheuristics in combinatorial optimization, Tabu search heuristics for the vehicle routing problem with time windows.

Uses Software

VRP

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1922635&oldid=14352679"