Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Label correcting methods to solve multicriteria shortest path problems
Journal of Optimization Theory and Applications
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
A Metaheuristic for the Pickup and Delivery Problem with Time Windows
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Solving a Practical Pickup and Delivery Problem
Transportation Science
Scheduling Transportation of Live Animals to Avoid the Spread of Diseases
Transportation Science
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Operations Research
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Finding skyline paths in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
Computers and Operations Research
| Hi-index | 0.00 |
In the dynamic Pickup and Delivery Problem with Transfers (dPDPT), a set of transportation requests that arrive at arbitrary times must be assigned to a fleet of vehicles. We use two cost metrics that capture both the company's and the customer's viewpoints regarding the quality of an assignment. In most related problems, the rule of thumb is to apply a two-phase local search algorithm to heuristically determine a good requests-to-vehicles assignment. This work proposes a novel solution based on a graph-based formulation of the problem that treats each request independently. Briefly, in this conceptual graph, the goal is to find a shortest path from a node representing the pickup location to that of the delivery location. However, we show that efficient Bellman-Ford or Dijkstra-like algorithms cannot be applied. Still, our method is able to find dPDPT solutions significantly faster than a conventional two-phase local search algorithm, while the quality of the solution is only marginally lower.