A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning

被引:29
作者
Ntakolia, Charis [1 ]
Iakovidis, Dimitris K. [1 ]
机构
[1] Univ Thessaly, Sch Sci, Dept Comp Sci & Biomed Informat, Volos, Greece
关键词
Mixed integer non-linear programming; Swarm intelligence algorithm; Path search algorithm; Convergence analysis; Tourist route planning; ORIENTEERING PROBLEM; COLONY ALGORITHM; DESIGN; OPTIMIZATION; NETWORKS;
D O I
10.1016/j.cor.2021.105358
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Personalized tourist route planning (TRP) and navigation are online or real-time applications whose mathematical modeling leads to complex optimization problems. These problems are usually formulated with mathematical programming and can be described as NP hard problems. Moreover, the state-of-the-art (SOA) path search algorithms do not perform efficiently in solving multi-objective optimization (MO) problems making them inappropriate for real-time processing. To address the above limitations and the need for online processing, a swarm intelligence graph-based pathfinding algorithm (SIGPA) for MO route planning was developed. SIGPA generates a population whose individuals move in a greedy approach based on A* algorithm to search the solution space from different directions. It can be used to find an optimal path for every graph-based problem under various objectives. To test SIGPA, a generic MOTRP formulation is proposed. A generic TRP formulation remains a challenge since it has not been studied thoroughly in the literature. To this end, a novel mixed binary quadratic programming model is proposed for generating personalized TRP based on multi-objective criteria and user preferences, supporting, also, electric vehicles or sensitive social groups in outdoor cultural environments. The model targets to optimize the route under various factors that the user can choose, such as travelled distance, smoothness of route without multiple deviations, safety and cultural interest. The proposed model was compared to five SOA models for addressing TRP problems in 120 various scenarios solved with CPLEX solver and SIGPA. SIGPA was also tested in real scenarios with A* algorithm. The results proved the effectiveness of our model in terms of optimality but also the efficiency of SIGPA in terms of computing time. The convergence and the fitness landscape analysis showed that SIGPA achieved quality solutions with stable convergence.
引用
收藏
页数:18
相关论文
共 73 条
  • [1] A mobile and interactive multiobjective urban tourist route planning system
    Ayala, Inmaculada
    Mandow, Lawrence
    Amor, Mercedes
    Fuentes, Lidia
    [J]. JOURNAL OF AMBIENT INTELLIGENCE AND SMART ENVIRONMENTS, 2017, 9 (01) : 129 - 144
  • [2] Barrena E, 2016, SEMA SIMAI SPRING S, V8, P189, DOI 10.1007/978-3-319-32013-7_11
  • [3] A hybrid multi-objective tour route optimization algorithm based on particle swarm optimization and artificial bee colony optimization
    Beed, Romit
    Roy, Arindam
    Sarkar, Sunita
    Bhattacharya, Durba
    [J]. COMPUTATIONAL INTELLIGENCE, 2020, 36 (03) : 884 - 909
  • [4] Bozyigit A, 2017, 2017 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), P502, DOI 10.1109/UBMK.2017.8093444
  • [5] Buttazzo GC, 2011, HARD REAL-TIME COMPUTING SYSTEMS: PREDICTABLE SCHEDULING ALGORITHMS AND APPLICATIONS, THIRD EDITION, P1, DOI 10.1007/978-1-14614-0676-1
  • [6] Planning for tourism routes using social networks
    Cenamor, Isabel
    de la Rosa, Tomas
    Nunez, Sergio
    Borrajo, Daniel
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2017, 69 : 1 - 9
  • [7] Chen YH, 2015, 2015 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), P128, DOI 10.1109/TAAI.2015.7407130
  • [8] Cplex II, 2010, 12 2 US MAN
  • [9] A Multiobjective Evolutionary Algorithm for Personalized Tours in Street Networks
    De Falco, Ivanoe
    Scafuri, Umberto
    Tarantino, Ernesto
    [J]. APPLICATIONS OF EVOLUTIONARY COMPUTATION, EVOAPPLICATIONS 2015, 2015, 9028 : 115 - 127
  • [10] Deb K., 2011, DEB MULTIOBJECTIVE E, V3, P34, DOI [10.1007/978-0- 85729-652-8_1, DOI 10.1007/978-0-85729-652-8_1]