Hapsari, Indri and Surjandari, Isti and Komarudin, Komarudin (2018) Solving Multi Objectives Team Orienteering Problem with Time Windows using Multi Integer Linear Programming. In: International Conference on Industrial Revolution for Polytechnic Education (ICIRPE), 3-5 Desember 2018, Politeknik Negeri Malang.
Preview |
PDF
Paper Indri UI-Poltekma.pdf Download (470kB) | Preview |
Abstract
This study solves tourist trip planning using team orienteering problem with time windows with more than one objective. In MO-TOPTW, besides maximum score, there is minimum time that must be achieved to make sure tourist get effective and efficient routing. Score represent priority to visit the destinations, while time consist of visiting time and traveling time between destinations. Number of routing is determined and the goal is giving the tourist the best routing that fulfill all the constraints. The constraints are time windows and tourist’s budget time. Modification of mathematical programming will be done. We used small case to compare between heuristic procedure to develop the route with optimization. Optimization is implemented using Multi Integer Linear Programming using Lingo. The global optimum of optimization method gives better result than heuristic, with total score higher as 12% and total time lower 7.3%. Because this is NP-hard problem, the running time is 45 minutes 24 seconds, very long time for tourist to wait the result. Further research must be done to faster the process with preserving the best result.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Orienteering Problem, Time Window, Linear Programming, Multi Objective, tourist trip, schedulin |
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Faculty of Engineering > Department of Industrial Engineering |
| Depositing User: | Indri Hapsari 203009 |
| Date Deposited: | 22 Jul 2019 04:45 |
| Last Modified: | 10 May 2021 05:54 |
| URI: | http://repository.ubaya.ac.id/id/eprint/35155 |
Actions (login required)
 |
View Item |
