Probabilistic diversification and intensification in local search for vehicle routing

From MaRDI portal
Revision as of 15:05, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1922635

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 routinglocal searchparallel algorithmsprobabilistic technique


Mathematics Subject Classification ID

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


Related Items (only showing first 100 items - show all)

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


Uses Software



Cites Work




This page was built for publication: Probabilistic diversification and intensification in local search for vehicle routing

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