One-to-Many-to-One Single Vehicle Pickup and Delivery Problems

DOI10.1007/978-0-387-77778-8_16zbMath1187.90051OpenAlexW117190991MaRDI QIDQ3564364

Gilbert Laporte, Irina Gribkovskaia

Publication date: 2 June 2010

Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_16

zbMATH Keywords

reverse logisticsgeneral solutionslassobackhaulstransshipmentclustered traveling salesman problemselective pickupspickups and deliveriescapacitated customersdouble-path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping, Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs, An efficient column-generation-based algorithm for solving a pickup-and-delivery problem, 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

Cites Work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• Reverse logistics: simultaneous design of delivery routes and returns strategies
• General solutions to the single vehicle routing problem 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
• Variable neighborhood search
• The traveling salesman problem with backhauls
• Worst-case analysis of a new heuristic for the travelling salesman problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Vehicle routing problems with simultaneous pick-up and delivery service.
• The single vehicle routing problem with deliveries and selective pickups
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Solving a vehicle-routing problem arising in soft-drink distribution
• A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms
• Approximate Traveling Salesman Algorithms
• The swapping problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• A unified tabu search heuristic for vehicle routing problems with time windows
• The single‐vehicle routing problem with unrestricted backhauls
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
• The Pickup And Delivery Problem With Time Windows And Transshipment