This paper summarizes the research of using open accessibility data for accessible travelling. With the aim of addressing the gap between users’ special needs and complex accessibility barriers in real world, we proposed a personalized accessible travelling framework based on open accessibility data for people with mobility impairments. This research mainly investigates the use of Linked Open D...

The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem that belongs to class of problems known as NP-hard, which an exceptional case travelling salesman (TSP), determines set routes enabling multiple salesmen start at and return home cities (depots). penguins search algorithm (PeSOA) new metaheuristic algorithm. In this paper, we present discrete for solving th...