Abstract
In this paper we study a problem that arose while planning the delivery of perishable goods, such as newspapers or foodstuff, in urban areas. The customers require the delivery of several different products within specified time windows. Given a production schedule, facilities for cross docking and a vehicle fleet, the problem is to create a cost effective delivery plan. We propose a heuristic that maintains product availability, and simultaneously, generates an efficient routing schedule. Product availability is maintained through a preflow-push algorithm performed on a time-space facility network, while the routing is guided by simulated annealing. The heuristic was tested on a set of specifically created test instances and on standard 2E-LRP instances by Prodhon.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
