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

DOI10.1016/J.EJOR.2011.06.038MaRDI QIDQ420868zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The multi-commodity pickup-and-delivery traveling salesman problem
• The single-vehicle two-echelon one-commodity pickup and delivery problem
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• One-to-many-to-one single vehicle pickup and delivery problems
• Single-commodity vehicle routing problem with pickup and delivery service

Cites work

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

Cited in

(8)

• The single-vehicle two-echelon one-commodity pickup and delivery problem
• Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
• scientific article; zbMATH DE number 1552334 (Why is no real title available?)
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
• Heuristics for routes generation in pickup and delivery problem
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• The multi-vehicle profitable pickup and delivery problem
• The unit capacity pickup and delivery problem on a one-way loop

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420868)