Related references
Note: Only part of the references are listed.A unified 3D space-based navigation model for seamless navigation in indoor and outdoor
Jinjin Yan et al.
INTERNATIONAL JOURNAL OF DIGITAL EARTH (2021)
Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem
Raad Salman et al.
OPERATIONS RESEARCH LETTERS (2020)
Indoor positioning and wayfinding systems: a survey
Jayakanth Kunhoth et al.
HUMAN-CENTRIC COMPUTING AND INFORMATION SCIENCES (2020)
Multiple traveling salesman problem with drones: Mathematical model and heuristic approach
Patchara Kitjacharoenchai et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2019)
The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem
Urszula Boryczka et al.
EXPERT SYSTEMS WITH APPLICATIONS (2019)
Top-Bounded Spaces Formed by the Built Environment for Navigation Systems
Jinjin Yan et al.
ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION (2019)
An artificial bee colony algorithm with a Modified Choice Function for the traveling salesman problem
Shin Siang Choong et al.
SWARM AND EVOLUTIONARY COMPUTATION (2019)
A novel path planning algorithm for visually impaired people
Durgesh Nandini et al.
JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES (2019)
A generic space definition framework to support seamless indoor/outdoor navigation systems
Jinjin Yan et al.
TRANSACTIONS IN GIS (2019)
A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem
Mir Mohammad Alipour et al.
NEURAL COMPUTING & APPLICATIONS (2018)
A comparison of route-choice navigation across air pollution exposure, CO2 emission and traditional travel cost factors
M. S. Alam et al.
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT (2018)
An artificial bee colony-based multi-objective route planning algorithm for use in pedestrian navigation at night
Zhixiang Fang et al.
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE (2017)
An integer programming approach for the time-dependent traveling salesman problem with time windows
Agustin Montero et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
David R. Morrison et al.
DISCRETE OPTIMIZATION (2016)
Efficient many-to-many path planning and the Traveling Salesman Problem on road networks
Joerg Roth
INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED AND INTELLIGENT ENGINEERING SYSTEMS (2016)
The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization
Manuel Lopez-Ibanez et al.
APPLIED SOFT COMPUTING (2013)
A comparative analysis of several asymmetric traveling salesman problem formulations
Temel Oncan et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
Finding shortest paths on real road networks: the case for A*
W. Zeng et al.
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE (2009)
Developing landmark-based pedestrian-navigation systems
Alexandra Millonig et al.
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2007)
The multiple traveling salesman problem: an overview of formulations and solution procedures
T Bektas
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2006)
Branch and bound algorithms for the multidimensional assignment problem
EL Pasiliao et al.
OPTIMIZATION METHODS & SOFTWARE (2005)
Approximation algorithms for the traveling salesman problem
J Monnot et al.
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2003)
Share Paper
