A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls

DOI10.1002/jos.122zbMath1009.90018OpenAlexW2103419797MaRDI QIDQ1607978

Niaz A. Wassan, Ibrahim. H Osman

Publication date: 8 August 2002

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

Full work available at URL: https://doi.org/10.1002/jos.122

zbMATH Keywords

heuristicstabu searchvehicle routinglocal searchmeta-heuristicsvariable neighbourhood searchvehicle routing with back-hauls

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (28)

Optimization of the drayage problem using exact methods ⋮ A unified heuristic for a large class of vehicle routing problems with backhauls ⋮ An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup ⋮ A heuristic method for the vehicle routing problem with mixed deliveries and pickups ⋮ A deterministic iterated local search algorithm for the vehicle routing problem with backhauls ⋮ Multi-ant colony system (MACS) for a vehicle routing problem with backhauls ⋮ Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints ⋮ A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ Multi-trip pickup and delivery problem with time windows and synchronization ⋮ A Lagrangian relaxation-based heuristic for the vehicle routing with full container load ⋮ A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries ⋮ Solution strategies for the vehicle routing problem with backhauls ⋮ Minimizing the maximal ergonomic burden in intra-hospital patient transportation ⋮ A novel two-phase heuristic method for vehicle routing problem with backhauls ⋮ A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries ⋮ A new tabu search algorithm for the vehicle routing problem with backhauls ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ An iterated local search algorithm for the vehicle routing problem with backhauls ⋮ A local search heuristic for the pre- and end-haulage of intermodal container terminals ⋮ An analysis of parameter adaptation in reactive tabu search ⋮ A tabu search heuristic for the truck and trailer routing problem ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem with backhauls
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
• Large-step Markov chains for the TSP incorporating local search heuristics
• Variable neighborhood search
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Metaheuristics: A bibliography
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Heuristic approaches to vehicle routing with backhauls and time windows
• An Exact Method for the Vehicle Routing Problem with Backhauls
• On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
• An Exact Algorithm for the Vehicle Routing Problem with Backhauls
• The Reactive Tabu Search
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• Tabu search variants for the mix fleet vehicle routing problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls