Abstract
We consider several heuristic algorithms for scheduling maintenance of locomotives in the depot consisting of three observation ditches. Here six algorithms for scheduling maintenance of locomotives in the depot for some cases are presented. These algorithms give the opportunity to set the priority of service requirements by various permutations. We carried out computer experiments to calculate the absolute error in comparison with the method of iteration giving the absolute minimum of the objective function. As a result, the proposed algorithms provide scheduling for less computer time with small errors compared to standard optimizers as IBM IlogCplex.
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: DEStech Transactions on Computer 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.
