| dc.description.abstract | Nowadays, in the competitive global marketplace with sustainable and substantial growth in
the railway industry, the company expanded the activities of the company based on its most
experienced employees and made it more and more complicated. Therefore, the
transportation of goods and passengers involves significant costs and property depreciation.
This problem has been researched for many years to find a method that can solve it and
support decision-making to reduce the overall cost of the company and optimize customer
demand. The Locomotive Scheduling Problem with Maintenance Constraints (LSPM)
applies mathematical modeling and heuristic search to appropriately schedule locomotives
towing carriages in order to achieve the goal of the lowest total cost. By using a case study of
the railway industry in Vietnam, with various types of locomotives, proposes research
framework with two methods to archive the solution, the first purpose is to use the formula
Linear programming mixed-integer to solve the scheduling problem, the second stage uses
the heuristic solution approach Two-stage mathematical method by MATLAB software
programming for large-scale applications. The results pointed out that the proposed model in
this study helps the company improve the scheduling process of the locomotive with a
suitable route | en_US |
