A unified tabu search heuristic for vehicle routing problems with time windows

From MaRDI portal
Publication:4658480


DOI10.1057/palgrave.jors.2601163zbMath1181.90034MaRDI QIDQ4658480

Gilbert Laporte, Jean-François Cordeau, Anne Mercier

Publication date: 16 March 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601163


90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research


Related Items

Transport clustering and routing as a visual meshing process, Recyclable waste collection planning -- a case study, Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism, DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic, An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows, Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite, Metaheuristics in combinatorial optimization, A unified heuristic for a large class of vehicle routing problems with backhauls, A comparison of five heuristics for the multiple depot vehicle scheduling problem, The multi-depot vehicle routing problem with inter-depot routes, Applying the attribute based hill climber heuristic to the vehicle routing problem, A goal programming approach to vehicle routing problems with soft time windows, Scheduling periodic customer visits for a traveling salesperson, 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, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Comparing backhauling strategies in vehicle routing using ant colony optimization, A neural-tabu search heuristic for the real time vehicle routing problem, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, A hybrid method based on linear programming and tabu search for routing of logging trucks, A tabu search heuristic for ship routing and scheduling with flexible cargo quantities, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, Local search with annealing-like restarts to solve the VRPTW, Active guided evolution strategies for large-scale vehicle routing problems with time windows, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Tabu search heuristics for the vehicle routing problem with time windows., Routing relatively few customers per route, 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, A multi-start local search algorithm for the vehicle routing problem with time windows, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, A multi-start local search heuristic for ship scheduling -- a computational study, The single vehicle routing problem with deliveries and selective pickups, Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows, The dial-a-ride problem: Models and algorithms, A tabu search approach for the livestock collection problem, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Vehicle routing problem with elementary shortest path based column generation, Sequential search and its application to vehicle-routing problems, Path relinking for the vehicle routing problem, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Scatter search for the vehicle routing problem with time windows, Arc routing in a node routing environment, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, A tabu search procedure for coordinating production, inventory and distribution routing problems, The Period Vehicle Routing Problem and its Extensions, Parallel Solution Methods for Vehicle Routing Problems, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, One-to-Many-to-One Single Vehicle Pickup and Delivery Problems, From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods