Bus Driver Scheduling Problem using TLBO and JAYA Algorithm | Zendy

B. Atul | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Bus Driver Scheduling Problem using TLBO and JAYA Algorithm

Author(s) -

B. Atul

Publication year - 2016

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/ijca2016910810

Subject(s) - computer science , duty , scheduling (production processes) , algorithm , block (permutation group theory) , constraint (computer aided design) , evolutionary algorithm , mathematical optimization , operations research , artificial intelligence , mathematics , philosophy , geometry , theology

Bus driver scheduling problem is one of most important and complex problem faced by many companies and bus terminals. This paper attempts to solve this problem using paramterless evolutionary algorithms, TLBO and JAYA algorithm. The objective of this paper is to assign the drivers to duty on a particular day and block duty by satisfying the constraints. Algorithms are tested on four randomly generated datasets. In the work solution is obtained with no zero constraint violations. JAYA algorithm gives better results than TLBO algorithm. General Terms Algorithms, Constraint Satisfaction Problems, Scheduling Problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research