Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)

DOI10.1007/S11750-007-0009-0zbMath1121.90001OpenAlexW2082772228WikidataQ115202323 ScholiaQ115202323MaRDI QIDQ2644426

Irina Gribkovskaia, Gerardo Berbeglia, Gilbert Laporte, Jean-François Cordeau

Publication date: 31 August 2007

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-007-0009-0

zbMATH Keywords

vehicle routingdial-a-ride problembackhaulsswapping problemstacker crane

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (only showing first 100 items - show all)

The pickup and delivery problem with time windows and scheduled lines ⋮ A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search ⋮ A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ A scheme for determining vehicle routes based on Arc-based service network design ⋮ Base location and helicopter fleet composition in the oil industry ⋮ The multi-vehicle profitable pickup and delivery problem ⋮ A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ Variable neighborhood search for the dial-a-ride problem ⋮ 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 ⋮ A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem ⋮ A matheuristic for solving inventory sharing problems ⋮ Pickup and delivery problems with autonomous vehicles on rings ⋮ A branch-and-price algorithm for a routing problem with inbound and outbound requests ⋮ Pallet location and job scheduling in a twin-robot system ⋮ Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ Optimal routing of multimodal mobility systems with ride‐sharing ⋮ Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ Planification des tournées dans le domaine de la messagerie rapide ⋮ Approximation algorithms for multi-vehicle stacker crane problems ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ Solving a pickup and delivery routing problem for fourth‐party logistics providers ⋮ New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Optimization of logistics services in hospitals ⋮ Competition and Cooperation in Pickup and Multiple Delivery Problems ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ One-to-Many-to-One Single Vehicle Pickup and Delivery Problems ⋮ A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM ⋮ Unnamed Item ⋮ The continuous and discrete path‐variance problems on trees ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ Minimising average passenger waiting time in personal rapid transit systems ⋮ Request evaluation strategies for carriers in auction-based collaborations ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes ⋮ A new VRPPD model and a hybrid heuristic solution approach for e-tailing ⋮ Extension and Application of a General Pickup and Delivery Model for Evaluating the Impact of Bundling Goods in an Urban Environment ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ The Humanitarian Pickup and Distribution Problem ⋮ Shared resources in collaborative vehicle routing ⋮ The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing ⋮ An exact solution method for the capacitated item-sharing and crowdshipping problem ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ Pickup and delivery problem with incompatibility constraints ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care ⋮ A truck scheduling problem arising in intermodal container transportation ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis ⋮ A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ The bi-objective traveling purchaser problem with deliveries ⋮ 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 ⋮ Synchronization in cross-docking networks: a research classification and framework ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ Heuristics for routes generation in pickup and delivery problem ⋮ A deterministic iterated local search algorithm for the vehicle routing problem with backhauls ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery ⋮ The multiple vehicle pickup and delivery problem with LIFO constraints ⋮ A comparison of column-generation approaches to the synchronized pickup and delivery problem ⋮ The pickup and delivery problem with alternative locations and overlapping time windows ⋮ Transport of skips between recycling centers and treatment facilities ⋮ A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ A practical vehicle routing problem with desynchronized arrivals to depot ⋮ Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex ⋮ Single liner shipping service design ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Survey of quantitative methods in construction ⋮ A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading ⋮ Coordinating technician allocation and maintenance routing for offshore wind farms ⋮ A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping ⋮ The pickup and delivery problem with time windows and handling operations ⋮ Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ A branch-price-and-cut method for a ship routing and scheduling problem with split loads ⋮ Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands ⋮ A time-dependent vessel routing problem with speed optimization ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ Exact algorithms for the double vehicle routing problem with multiple stacks ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost ⋮ Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery ⋮ Routing problems with loading constraints ⋮ A model and two heuristic approaches for a forage Harvester planning problem: a case study ⋮ The ordered capacitated facility location problem ⋮ Deterministic optimizational problems of transportation logistics ⋮ Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals ⋮ A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows ⋮ An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation ⋮ Multi-trip pickup and delivery problem with time windows and synchronization ⋮ A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases

Uses Software

• VRP

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• 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
• A unified heuristic for a large class of vehicle routing problems with backhauls
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
• Reverse logistics: simultaneous design of delivery routes and returns strategies
• An approximation algorithm for the pickup and delivery vehicle routing problem on trees
• General solutions to the single vehicle routing problem with pickups and deliveries
• Self-organizing feature maps for the vehicle routing problem with backhauls
• An efficient implementation of local search algorithms for constrained routing problems
• Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The vehicle routing problem with backhauls
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
• Self-organized formation of topologically correct feature maps
• An O(N log N) planar travelling salesman heuristic based on spacefilling curves
• The pickup and delivery problem with time windows
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• 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
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Variable neighborhood search
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
• Guided local search and its application to the traveling salesman problem
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A new branching strategy for time constrained routing problems with application to backhauling
• The traveling salesman problem with backhauls
• Worst-case analysis of a new heuristic for the travelling salesman problem
• An extension of multiple correspondence analysis for identifying heterogeneous subgroups of respondents
• A multi-start local search heuristic for ship scheduling -- a computational study
• A new tabu search algorithm for the vehicle routing problem with backhauls
• Heuristic approaches to vehicle routing with backhauls and time windows
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• Combinatorially simple pickup and delivery paths
• Drive: Dynamic Routing of Independent Vehicles
• An Exact Method for the Vehicle Routing Problem with Backhauls
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• The preemptive swapping problem on a tree
• Nonpreemptive Ensemble Motion Planning on a Tree
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• Solving a vehicle-routing problem arising in soft-drink distribution
• Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
• Integer Programming Formulation of Traveling Salesman Problems
• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms
• 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
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Savings by Split Delivery Routing
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• Approximate Traveling Salesman Algorithms
• The swapping problem
• Preemptive Ensemble Motion Planning on a Tree
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Set Partitioning: A survey
• An Asymptotic, Probabilistic Analysis of a Routing Problem
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Approximating Capacitated Routing and Delivery Problems
• The Swapping Problem on a Line
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• The Reactive Tabu Search
• An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
• A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• A unified tabu search heuristic for vehicle routing problems with time windows
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• The single‐vehicle routing problem with unrestricted backhauls
• A GRASP for the Vehicle Routing Problem with Time Windows
• The General Pickup and Delivery Problem
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• The vehicle-routing problem with delivery and back-haul options
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Vehicle routing problem with simultaneous deliveries and pickups
• The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
• Computer Solutions of the Traveling Salesman Problem
• An Algorithm for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Recursion and double recursion
• 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
• Étude comparative de divers modèles pour le problème de transport à la demande
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)