Secure Travel Planning Using a Heuristic Algorithm

Mahdi, Ali and Esztergár-Kiss, Domokos (2024) Secure Travel Planning Using a Heuristic Algorithm. PERIODICA POLYTECHNICA TRANSPORTATION ENGINEERING. ISSN 0303-7800 (In Press)

Preview

Text PPTR_36997_OF.pdf - Published Version Available under License Creative Commons Attribution. Download (1MB) | Preview

Abstract

Security perception in the urban area has a significant effect on travel behaviour, preferences, and tour planning. The perceptions of security risks can vary depending on factors, such as age, gender, and previous experiences. This study aims to consider security risks when developing travel plans and schedules for various activities. An improved heuristic algorithm, based on the Travelling Salesman Problem with security parameter and flexibility aspects, is proposed. Public transport is considered in three situations: fixed, flexible, and flexible-security situations. The outcomes demonstrate that the flexible situation significantly decreases travel times by 21% compared to the basic (fixed) situation. At the same time, with a slightly increased travel time the security risk can be avoided in the flexible-security situation. Travelers can enjoy a higher quality of travelling and enhanced personal experience by minimizing the journey duration and the impact of security risks on the tour schedule. The proposed method provides significant benefits for transport operators by increasing the efficiency of the transportation system and higher customer satisfaction.

Actions (login required)

Edit Item