Authors:
Omid Gholami
1
;
Yuri N. Sotskov
2
and
Frank Werner
3
Affiliations:
1
Islamic Azad Univeristy, Iran, Islamic Republic of
;
2
National Academy of Sciences of Belarus, Belarus
;
3
Otto-von-Guericke-University, Germany
Keyword(s):
Job-shop, Train Scheduling, Regular Criteria.
Related
Ontology
Subjects/Areas/Topics:
Application Domains
;
Artificial Intelligence
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Logistics, Traffic and Transportation
;
Optimization Issues
;
Planning and Scheduling
;
Simulation and Modeling
;
Symbolic Systems
Abstract:
A train scheduling problem in a single-track railway is studied using a mixed graph model for a job-shop with appropriate criteria. There are several performance evaluations for a train schedule. Optimizing a train schedule subtends minimizing total tardiness of the trains, minimizing the sum of train transit times, minimizing the makespan for a train schedule, etc. Since the corresponding job-shop problems with the above three criteria are NP-hard, several heuristic algorithms have been developed using different priorities based on the release times of the jobs, the job due-dates and the job completion times. Experiments on a computer were used for evaluating the quality and efficiency of the heuristic algorithms developed for appropriate job-shop problems. The release times, due-dates and completion times of the jobs have been used as input parameters (priorities) in the computer simulation to see the effect of them on the quality of the schedules with different objective functions
. The efficiency of the developed heuristics was demonstrated via a simulation on a set of randomly generated instances of small and medium sizes. The computational results showed that one heuristic algorithm outperformed the other algorithms tested for two of the three objective functions under consideration.
(More)