A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries

DOI10.1007/s10878-007-9090-4zbMath1145.90327OpenAlexW1996693860MaRDI QIDQ927194

Niaz A. Wassan, Gábor Nagy, A. Hameed Wassan

Publication date: 4 June 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9090-4

zbMATH Keywords

Vehicle routingHeuristicPickups and deliveriesReactive tabu search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit ⋮ Route planning for a seaplane service: the case of the Greek islands ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ Minimizing the maximal ergonomic burden in intra-hospital patient transportation ⋮ Best routes selection in multimodal networks using multi-objective genetic algorithm ⋮ A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority ⋮ A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries ⋮ Shipper collaboration in forward and reverse logistics ⋮ Memory and Learning in Metaheuristics

Uses Software

• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• The traveling salesman problem with delivery and backhauls
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
• A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
• Heuristic approaches to vehicle routing with backhauls and time windows
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• A reactive tabu search for the vehicle routing problem
• Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
• The Reactive Tabu Search
• A guide to vehicle routing heuristics
• Tabu search variants for the mix fleet vehicle routing problem
• The pickup delivery location problem on networks
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Vehicle routing problem with simultaneous deliveries and pickups
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up

This page was built for publication: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries