A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
From MaRDI portal
Publication:2566927
DOI10.1016/j.cor.2004.07.009zbMath1077.90058OpenAlexW1965618732MaRDI QIDQ2566927
Fermín Alfredo Tang Montané, Roberto Diéguez Galvão
Publication date: 29 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.07.009
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search ⋮ 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 perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints ⋮ A hybrid algorithm for a class of vehicle routing problems ⋮ Route planning for a seaplane service: the case of the Greek islands ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ An adaptive large neighborhood search for an E-grocery delivery routing problem ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ Multiobjective vehicle routing problem with fixed delivery and optional collections ⋮ Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries ⋮ Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery ⋮ Convergence of taboo search in continuous global optimization ⋮ Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence ⋮ Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW ⋮ Optimizing two-level reverse distribution networks with hybrid memetic algorithms ⋮ Solving fixed charge transportation problem with truck load constraint using metaheuristics ⋮ A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services ⋮ A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery ⋮ A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs ⋮ One-to-Many-to-One Single Vehicle Pickup and Delivery Problems ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery ⋮ Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries ⋮ A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery ⋮ A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery ⋮ A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ Simulation-based optimisation for stochastic maintenance routing in an offshore wind farm ⋮ Probabilistic time-dependent vehicle routing problem ⋮ A new VRPPD model and a hybrid heuristic solution approach for e-tailing ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Mixed-integer linear optimization for full truckload pickup and delivery ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries ⋮ Single-commodity vehicle routing problem with pickup and delivery service ⋮ GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery ⋮ An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
Uses Software
Cites Work
- Unnamed Item
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- The pickup and delivery problem with time windows
- 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
- k-interchange procedures for local search in a precedence-constrained routing problem
- A new branching strategy for time constrained routing problems with application to backhauling
- The traveling salesman problem with backhauls
- Vehicle routing problems with simultaneous pick-up and delivery service.
- An Exact Method for the Vehicle Routing Problem with Backhauls
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- The General Pickup and Delivery Problem
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up