Abstract
We describe a variant of the traditional vehicle routing problem (VRP) associated with the pickup and dropping of employees of large organisations. The human factors involved result in a number of additional constraints to the VRP which are specific to this kind of situation. We have developed a heuristic algorithm which solves this type of VRP effectively. The adaptability of the algorithm is demonstrated through a real problem of a large public sector organisation in the city of Bangalore in India involving the daily transportation of about 12 000 employees from and to 410 pickup points in and around the city. The use of our heuristic method has indicated a savings of about 1400 km per day out of the daily coverage of 14 000 km by a fleet of 75 buses. Additional advantages include a reduction in the number of buses and drivers required per shift, improved seat utilisation and better fuel management.
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.
