2. The Team (L.E.V.A.X) – SS14-4G Supervisor ▫Dr. Loo Poh Kok Members ▫Mark Chua Zhi Wei (4643367) ▫Pang Ching Yeow (4406412) ▫Abdullah Ismail Bin Omar Sanat (4402364) ▫Ang Jun Qin (4402376)

3. Introduction (1) Problem Objectives Target Stakeholders Development Methodology Project Schedules Development Tools Construction Phase of RUP

4. Introduction (2) Testing Interface / Process Flows Lift Algorithms Features System Requirements Learning Points Demo Q & A

5. The Problem No standardized means to simulate human traffic in a building model No standardized lift algorithm No practical method to test algorithms

6. Objectives Client-based desktop application Cross-platform Allows flexible input from user Create realistic building models Create realistic human traffic model based on time of day Provide a quick and deterministic way to overcome the efficiency problem

7. Target Stakeholders Building Management Building Designers Lift Manufacturers Engineers

8. Development methodology Rational-unified process

9. Project Schedules 2 rd January, 2015 ▫GUI Design, Implementation and Testing 5 th January, 2015 ▫Lift Algorithm brainstorm and planning 12 th January, 2015 ▫Algorithm implementation 16 th February, 2015 ▫Testing and completion of 3 algorithms 21 st February, 2015 ▫Testing and completion of last algorithm

10. Development Tools/Software IDE ▫QT Creator Development Language ▫C++ Data I/O ▫XML Version Control ▫GitHub System Design ▫Visual Paradigm

11. Construction Phase of RUP

12. Construction Phase 1 Not user friendly In-efficient use of space Feedbacks from peers

13. Construction Phase 2 Streamline user input Clearer instructions Reset/Save feature Partitioning

14. Construction Phase 3 (Final) Customizable Inputs 3 Step Simulation Approach Print feature Clearly defined Partitioning 1 Step installation process

15. Testing Test after each milestone (new version) Create test cases Analyze result Rectify result Repeat

16. Interface / Process Flows

24. Lift Algorithms Nearest Car (NC) Fixed Sectoring Common Sector System (FSO) Fixed Sectoring Priority Timed System (FS4) Dynamic Sectoring System (DS)

25. Nearest Car (NC) Lift serve passengers with the highest FS If call is in the same direction as lift ▫FS = (N+2) – d If call is in the different direction as lift ▫FS = (N+1) – d If lift is moving away from call ▫FS = 1 where n = (number of floors – 1) d = distance between lifts and call

26. Fixed Sectoring Common Sector System (FSO) 10 floors with 2 lifts Lift 1 serve floor 1 to 5 Lift 2 serve floor 6 to 10 and floor 1

27. Fixed Sectoring Priority Timed System (FS4) 10 floors with 2 lifts Lift 1 serve floor 1 to 5 Lift 2 serve floor 6 to 10 and floor 1 With priority ▫Priority increases proportionally to waiting time

28. Dynamic Sectoring System (DS) 10 floors with 2 lifts Sector = 5 Lift 1 and 2 will serve its current floor and +- 2

29. Features Runs almost instantaneously! Generate traffic flow according to time Suggest the best algorithm for the building and traffic model View the average user wait time and average user travel time Allows you to get an overview of the lift idle time ▫Calculate power consumption

30. System Requirements Requirements Operating System Windows XP SP3, Windows Vista Windows 7, Windows 8, Windows 8.1 and Mac OS X 10.8 and above CPU2 GHz Intel Core 2 Duo or above Memory 1 GB or more Hard drive100 MB of free space Internet Connection None

31. Learning Points Tight deadline ▫Not meeting a deadline causes delay to certain expectation Adapt to new IDE ▫New software takes time to learn Minutes taking ▫Keeping track of our activity Discipline ▫Keeping track of own progress on blogs

32. Demo

33. Q&A