Content deleted Content added
Ira Leviton (talk | contribs) m Fixed a reference. Please see Category:CS1 errors: dates. |
Citation bot (talk | contribs) Altered journal. Add: authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 44/205 |
||
Line 4:
== Complex ==
Most transportation systems use software to manage the crew scheduling process. Crew scheduling becomes more and more complex as you add variables to the problem. These variables can be as simple as 1 ___location, 1 skill requirement, 1 shift of work and 1 set roster of people. In the Transportation industries, such as Rail or mainly Air Travel, these variables become very complex. In Air Travel for instance, there are numerous rules or "constraints" that are introduced. These mainly deal with legalities relating to work shifts and time, and a crew member's qualifications for working on a particular aircraft. Add numerous locations to the equation and Collective Bargaining and Federal labor laws and these become new considerations for the problem solving method. Fuel is also a major consideration as aircraft and other vehicles require a lot of costly fuel to operate. Finding the most efficient route and staffing it with properly qualified personnel is a critical financial consideration. The same applies to rail travel. Crew scheduling involves assigning complementary crews for each scheduled trip based on the timetable for the next day or a short period.<ref>Pang, S., & Chen, M. C. (2023). Optimize railway crew scheduling by using modified bacterial foraging algorithm. ''Computers & Industrial Engineering'', ''180'', 109218.</ref> In rail transportation, crew scheduling involves generating crew duties for conductors and train operators.<ref>{{Cite journal |
The problem is computationally difficult and there are competing mathematical methods of solving the problem. Although not easy to describe in one sentence, the goal is essentially the same for any method of attacking the problem:
| |||