Recent Models and Algorithms for One-to-One Pickup and Delivery Problems

DOI10.1007/978-0-387-77778-8_15zbMath1187.90024OpenAlexW1847516220MaRDI QIDQ3564363

Stefan Ropke, Gilbert Laporte, Jean-François Cordeau

Publication date: 2 June 2010

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.5983

zbMATH Keywords

column generationtabu searchbranch-and-cutdial-a-ridepickup and deliveryone-to-one

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items

A scheme for determining vehicle routes based on Arc-based service network design, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, A comparison of column-generation approaches to the synchronized pickup and delivery problem, Exact algorithms for the double vehicle routing problem with multiple stacks, The vessel swap-body routing problem, A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips, A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows, A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs, Planification des tournées dans le domaine de la messagerie rapide, Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands, A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases, A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system, Verification of Correctness of Parallel Algorithms in Practice, Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system, Moving products between location pairs: cross-docking versus direct-shipping, An efficient column-generation-based algorithm for solving a pickup-and-delivery problem, An exact solution framework for a broad class of vehicle routing problems, The pickup and delivery traveling salesman problem with first-in-first-out loading, 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, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Pickup and delivery problem with incompatibility constraints, The paired many-to-many pickup and delivery problem: an application, Designing vehicle routes for a mix of different request types, under time windows and loading constraints, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• A general heuristic for vehicle routing problems
• An empirical study on the benefit of split loads with the pickup and delivery problem
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The pickup and delivery problem with time windows
• A method for solving ship routing problems with inventory constraints
• Modelling path flows for a combined ship routing and inventory management problem
• A transportation problem formulation for the MAC airlift planning problem
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Variable neighborhood search
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• A grouping genetic algorithm for the pickup and delivery problem with time windows
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• The precedence-constrained asymmetric traveling salesman polytope
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A computer assistant for vehicle dispatching with learning capabilities
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Reachability cuts for the vehicle routing problem with time windows
• A multi-start local search heuristic for ship scheduling -- a computational study
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• The dial-a-ride problem: Models and algorithms
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The Vehicle Routing Problem
• Drive: Dynamic Routing of Independent Vehicles
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• 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
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems
• Optimal Routing under Capacity and Distance Restrictions
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• TSPLIB—A Traveling Salesman Problem Library
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• Parallel iterative search methods for vehicle routing problems
• Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• A Method for Solving Traveling-Salesman Problems
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading