Generalised pickup and delivery problem with dynamic time windows Online publication date: Sat, 08-May-2010
by N. Chanaka P. Edirisinghe, Melissa R. Bowers, Anurag Agarwal
International Journal of Operational Research (IJOR), Vol. 8, No. 1, 2010
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook