A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases

DOI10.1016/J.EJOR.2011.06.038zbMath1238.90020OpenAlexW2144013501MaRDI QIDQ420868

Harilaos N. Psaraftis

Publication date: 23 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.038

zbMATH Keywords

schedulingroutingpickup and delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (3)

The multi-vehicle profitable pickup and delivery problem ⋮ Heuristics for routes generation in pickup and delivery problem ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem

Cites Work

• General solutions to the single vehicle routing problem with pickups and deliveries
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• k-interchange procedures for local search in a precedence-constrained routing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• A Dynamic Programming Approach to Sequencing Problems
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• 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

This page was built for publication: A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases