Abstract
This paper describes the real-life application of a personnel service shuttle routing problem. The problem in question is a type of vehicle routing problem with special constraints. To solve the problem, a mathematical model was developed, which aims to minimize the total travel time of employees, including the walking times to the shuttle-stops and the times spent on the shuttles. These times were added in the model by considering the times between the designated stops, the times each shuttle spends on each stop and the total travel times of the shuttles from the starting points to the destination point. The goal programming model was coded and solved using the commercial solver IBM ILOG CPLEX Optimization Studio. The actual times between the shuttle bus stops and the employee walking times were calculated according to the real-life data provided by the company. The walking times of the employees to the bus stops were also regulated via the inclusion of some set covering constraints in the model. When the numerical results from the model were compared to the current practice of the company, it has been observed that the savings in total travel time were quite significant.
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.
