Network analysis & logistics

Relative reachability on transportation networks




Source code


Dynamic pickup and delivery problem


The pickup and delivery is a well-known problem in logistics and transportation scenarios. A transportation request is defined as picking up an object (e.g., package, person, etc.) from one location and delivering it at another. Given a set of customer requests, a company offering such services constructs a collection of trajectories that will be followed by its vehicle fleet to pickup and deliver the objects. However, during the service hours, new ad-hoc requests arrive at arbitrary timestamps and thus, the company needs to update the existing vehicle trajectories in order to satisfy the new customers. Under this setup, Prof. Bouros introduced dynamic Pickup and Delivery with Transfers, modeled as a dynamic shortest path problem with two optimization criteria that capture the company’s and the customers’ viewpoint.

  • Panagiotis Bouros, Dimitris Sacharidis, Theodore Dalamagas and Timos Sellis:
    Dynamic Pickup and Delivery with Transfers
    Proceedings of the 12th International Symposium on Spatial and Temporal Databases (SSTD), Minneapolis, Minnesota, USA, August 24-26, 2011
  • Panagiotis Bouros:
    Evaluating Queries over Route Collections
    Doctorate dissertation, School of Electrical and Computer Engineering, National Technical University of Athens, Greece, 2011