Vehicle routing problems with simultaneous pick-up and delivery service.

DOI10.1007/BF03398667zbMath1278.90419MaRDI QIDQ2467847

Fermín Alfredo Tang Montané, Roberto Diéguez Galvão

Publication date: 29 January 2008

Published in: Opsearch (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

Route optimization cold chain logistic distribution using greedy search method ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery ⋮ Unnamed Item ⋮ One-to-Many-to-One Single Vehicle Pickup and Delivery Problems ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries ⋮ A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries ⋮ A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Uses Software

• VRP

Cites Work

• 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
• An Exact Method for the Vehicle Routing Problem with Backhauls
• 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
• Computer Solutions of the Traveling Salesman Problem