Abstract
This paper addresses a real-life logistic problem arising in the hospital complex of Tours (France). The two-level vehicle routing problem has time windows, a heterogeneous fleet, and multi-depot, multi-commodity and split deliveries. The first level concerns the routing problem for a fleet of vehicles serving several hospital units that delivers medicines, clean linen, meals, various supplies, patient files and picks up waste and dirty linen. The second level concerns the problem of routing employees between buildings within a large hospital unit. Both levels are interconnected. In addition, decisions about sizing and planning the teams of drivers and warehouse employees have to be made. Two metaheuristic algorithms are proposed to solve the entire problem: a genetic algorithm and a tabu search. The algorithms are tested on 100 instances, randomly generated on the basis of real-life instances.
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.
