A DECISION SUPPORT SYSTEM BASED ON OPTIMIZATION METHODS FOR OPTIMIZING DUHOK UNIVERSITY TRAFFIC PROBLEM

SAGVAN ALI  SALEH; SERWAN ALI  MOHAMMAD; RAFID SALIH  SARHAN; RAWAN RASHAD  KAMAL; HUDA MAWLOUD  AHMED; AHLAM YOUSIF  YOUNIS; KAHRAMAN KHODEDA  MIRZA

doi:10.26682/csjuod.2023.26.2.34

SAGVAN ALI SALEH *Dept. of Electrical and Computer Engineering, University of Duhok, Kurdistan Region–Iraq
SERWAN ALI MOHAMMAD *Dept. of Electrical and Computer Engineering, University of Duhok, Kurdistan Region–Iraq
RAFID SALIH SARHAN *Dept. of Electrical and Computer Engineering, University of Duhok, Kurdistan Region–Iraq
RAWAN RASHAD KAMAL **Student in Electrical and Computer Engineering, University of Duhok, Kurdistan Region–Iraq
HUDA MAWLOUD AHMED **Student in Electrical and Computer Engineering, University of Duhok, Kurdistan Region–Iraq
AHLAM YOUSIF YOUNIS **Student in Electrical and Computer Engineering, University of Duhok, Kurdistan Region–Iraq
KAHRAMAN KHODEDA MIRZA **Student in Electrical and Computer Engineering, University of Duhok, Kurdistan Region–Iraq

DOI: https://doi.org/10.26682/csjuod.2023.26.2.34

Keywords: Travelling Salesman Problem, greedy method, Artificial Bee Colony metaheuristic.

Abstract

Combinatorial optimization problems have previously proven to be significant and appealing for both basic research and practical applications. In this work, a real-life problem at Duhok University is considered, named as Duhok University Traffic Problem. Traffic bottlenecks, difficulties in moving, transportation cost in terms of time and financial and other problems in Duhok University are addressed as a series problems. In this paper a decision support system based on optimization methods are proposed in order to optimize a public transportation network to reduce the impact of the considered problem. The authors are first simulated the problem as a well-known optimization problem named as travelling salesman problem. Second, the problem is represented mathematically by introducing a mathematical programming model. Third and last, a decision support system based on three optimization methods are proposed in order to help in solving the considered problem, which are: greedy method, local search method, and artificial bee colony method. Computational results showed that, all the three proposed algorithms optimized and enhanced the transportation network in Duhok University, where Artificial Bee Colony presented high quality improvement by 36.48% and outperformed both, the greedy algorithm (13.81%) and the local search algorithms (31.45%).

Downloads

Download data is not yet available.

References

Aarts, E. and J. K. Lenstra (2018). Local Search in Combinatorial Optimization, Princeton University Press.
Blokdyk, G. (2018). Artificial Bee Colony Algorithm: Creating Value, CreateSpace Independent Publishing Platform.
Cruz, C., et al. (2010). Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), Springer.
Dao, S. D., et al. (2016). An effective genetic algorithm for large-scale traveling salesman problems. Proceedings of the World Congress on Engineering and Computer Science.
Hifi, M., et al. (2014). A fast large neighborhood search for disjunctively constrained knapsack problems. Combinatorial Optimization: Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers 3, Springer.
Hifi, M., et al. (2015). "A hybrid guided neighborhood search for the disjunctively constrained knapsack problem." 2(1): 1068969.
Huan, H. X., et al. (2013). "Solving the traveling salesman problem with ant colony optimization: A revisit and new efficient algorithms." 2(3-4).
Ilin, V., et al. (2022). "A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for travelling salesman problem."
Qamar, M. S., et al. (2021). "Improvement of traveling salesman problem solution using hybrid algorithm based on best-worst ant system and particle swarm optimization." 11(11): 4780.
Zhao, P. and D. Xu (2019). Hybrid algorithm for solving traveling salesman problem. IOP Conference Series: Materials Science and Engineering, IOP Publishing.