Abstract
The issue of human resource planning for public transport (drivers) is a combinatorial optimization problem. It is desirable to compromise between the quality of the solutions and the calculation time, which determines the heuristic procedures that can effectively and efficiently lead to solutions as close as possible to other types of real-time computing. The effort of using mathematical computational algorithms and the lack of generality of heuristic methods have led to the finding of programming methods that combine optimization models with heuristic procedures. The planning problem for public transport drivers can be solved initially by setting out more specific actions, with the application of specific calculation algorithms covering all the workings of the bulk transport medium on the route considered at minimum cost. Many times, even in short paths, optimization is required by using computational algorithms.
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: 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.
