Industrial Project (236504) Transportation task planning algorithms ClickSoftware Project Requirements Students: Noam Lavie, Ori Shalev Supervisors: Israel Beniaminy, Simon Arazi

Introduction The operation of a modern transportation systems is extremely complex and it requires coordination between many factors: –Regulator –Time table –Facilities: stations, platforms, ticketing self service kiosks, vending machines –Network: railways, electricity supply, signaling, communication –Vehicles –People: drivers, call center, ticketing, passenger agents, maintenance, control room In this project we are focusing on train drivers and there working arrangement. There are many possible working arrangement, but some are better then others. The optimal arrangement covers the required service level (time table) with the minimal cost (headcount)

Our Objective To developed and test working arrangement algorithms for train drivers. The algorithm receives the train schedule (time table), and output a working arrangement for the drivers. The algorithm should find a valid working arrangement with the minimal headcount.

Time Table Explanation Service ID: 1Y11LB, from Edinburgh to Fort Williams (Scotland) This service is not active on Sunday, active Mon-Sat ( = Sunday 0, Monday 1, Tuesday 1, Wednesday 1, Thursday 1, Friday 1, Saturday 1) Departure from Edinburgh 04:50 arrival to Fort Williams 09:45. Service duration is 5 hours and 4 minutes. Total distance is about 250 Km. Train ID Days Run Route Origin Route Destination Start TimeDuration End Time Route Distance 1B01LA FRTWLMEDINBUR19:005:150: B01LB FRTWLMEDINBUR19:505:000: Y11LB EDINBURFRTWLM4:505:049:

Service 1Y11LB Details Explanation The travel between 2 consecutive station is a Leg (there are no stops within the leg). Leg start is the departure time from the station, leg duration is the travel time to the next stop. Leg 1745A ends in 8:40, the next leg (1746A) starts at 8:45, it means that the train stops 5 minutes in RANNOCH station. Leg IDFrom LocationTo Location Leg Start Leg DurationLeg EndLeg Distance 1739AEDINBURWESTRTN4:501:065: AWESTRTNDALMUIR5:570:066: ADALMUIRARCHRAT6:051:027: AARCHRATARDLUI7:080:147: AARDLUICRNLRCH7:220:207: ACRNLRCHBOORCHY7:450:288: ABOORCHYRANNOCH8:150:258: ARANNOCHFRTWLM8:451:099:

Scope schedule anonymous drivers to all legs (no fallouts). The idea is to build a predefined valid working days (diagram), the collection of all working days (diagrams) should cover the whole time table. The goal – cover the time table with the minimal number of drivers (diagrams) The diagrams should be aligned with the following guidance: –The driver starts his working day at a certain station, he must be there at least 10 minutes before the train arrival (leg start) –The working day should not include more than 12 hours and not more than 250 Km driving –It is preferred if the driver starts and ends his working day at the same station –The driver must have at least 1 hour break during the day, at least 30 consecutive minutes –A driver can take a ride as a passenger with a train, or take a taxi to the next station or walk to the next station

Example – Diagram ID GQ01007 ONGLGQHL 5:180:105:28 TAXIGLGQHLDALMUIR5:330:255:58 RELDALMUIR 6:040:006:04 DRIVE LEGDALMUIRARCHRAT6:051:027:071Y11LB DRIVE LEGARCHRATARDLUI7:080:147:221Y11LB DRIVE LEGARDLUICRNLRCH7:220:207:421Y11LB DRIVE LEGCRNLRCHBOORCHY7:450:288:131Y11LB DRIVE LEGBOORCHYRANNOCH8:150:258:401Y11LB RELRANNOCH 8:400:008:40 PASSENGERRANNOCHBOORCHY8:420:189:001Y42LA PASSENGERBOORCHYCRNLRCH9:020:289:301Y42LA DRIVE LEGCRNLRCHARDLUI9:360:159:511Y22LW DRIVE LEGARDLUIARCHRAT9:520:1310:051Y22LW DRIVE LEGARCHRATDMBRTNC10:070:5110:581Y22LW DRIVE LEGDMBRTNCDALMUIR10:590:0811:071Y22LW RESTDALMUIR 11:080:5011:58 DRIVE LEGDALMUIRHYNDLND12:060:0812:142H56LA DRIVE LEGHYNDLNDPTCK12:150:0112:162H56LA DRIVE LEGPTCKCHRNGXG12:170:0412:212H56LA DRIVE LEGCHRNGXGGLGQLL12:220:0212:242H56LA WALKGLGQLLGLGQHL12:240:1012:34 NOTEGLGQHL 12:340:0012:34 OFFGLGQHL 14:190:0014:19

Schedule – the diagrams cover the time table In this example Driver 1 takes the train from DALMUIR to BOORCHY (Diagram ID GQQ0107C) and Driver 2 completes the journey (Diagram ID FW0951C) Diagram ID Activity IDType From Location To LocationStartDurationEndTrain ID GQ0107C 4471LEGDALMUIRARCHRAT6:051:027:071Y11LB GQ0107C 4472LEGARCHRATARDLUI7:080:147:221Y11LB GQ0107C 4473LEGARDLUICRNLRCH7:220:207:421Y11LB GQ0107C 4474LEGCRNLRCHBOORCHY7:450:288:131Y11LB FW0951C 4475LEGBOORCHYRANNOCH8:150:258:401Y11LB FW0951C 4293LEGRANNOCHFRTWLM8:451:099:541Y11LB

Train graph

Methodology There are quite a few methods that may be applied in our project, we will take the first weeks to study the subject a bit and for choosing one algorithm to implement. evaluate the results: For this we will use a set of problem: –some very simple, so that we can verify that the correct solution is found –some more complex, so that we may not even be able to determine the optimal solution but we can compare between different solutions. –Hopefully we will be provided with problem instances that also have a human- created solution, so that we can determine whether our solution is as good as the human one.

Milestones effortDue Date Decide what algorithm to use to solve the problem 2 weeksApril 12 Implement the algorithm 2 weeksApril 26 Examine the algorithm on a small problem, check solution validity of quality. Data structure and data storage (import a real life large scale problem). 3 weeksMay 10 Examine the algorithm on a large scale problem. 3 weeksMay 31 Delivery, conclusions and project summary 1 weekJune 7

Development Environment Probably python or c++

Risks The selected algorithm may not be able to provide a good solution. The selected algorithm will have poor performance when solving a large scale problem.

Deliverables A working algorithm. A list of valid and optimal diagrams.