Abstract
A computer program has been developed which will take as input a list of bus trips to which vehicles are to be allocated, and will produce a schedule covering these trips. At intermediate stages of the solution process infeasible schedules are produced using fewer vehicles than would be necessary for a feasible schedule. Inspection of these schedules by management shows where revision of trip times would lead to a reduction in the number of vehicles required, and the computer will continue towards a feasible solution, incorporating any revisions made by management. The method is heuristic, the objectives being first to minimise vehicles, and second, to minimise empty mileage. The solution is optimal, or near optimal, and successful applications are described.
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.
