Generalised pickup and delivery problem with dynamic time windows (Q973446): Difference between revisions

Summary: This paper considers the general class of vehicle routing problems in which nodes may be visited multiple times by multiple vehicles. The vehicles must pickup a product under continuous production at nodes and deliver it to a central depot. The nodes must be visited within certain time windows which are dependent on product availability at the nodes and the routes taken by vehicles, hence, the term, dynamic time windows. A model formulation is proposed using mixed-integer programming, along with two different performance metrics for tour optimisation: total product delivery at the depot, and another associated with rate of product delivery. The MIPs with non-linear objective functions are solved through a new convergent iterative algorithm in which sequences of parametric mixed-integer linear programmes are solved. The model is applied to a real-world situation that involves scheduling barges for oil pickup from offshore oil platforms. Preliminary computational results are presented.