Optimal route planning with restrictions for car navigation systems

Manoj Kanta Mainali, Shingo Mabu, Xianneng Li, Kotaro Hirasawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The optimal route search in car navigation systems is often considered to be a route search from the origin to destination. Many algorithms have been proposed to search for the optimal route from the origin to destination. However, in real situations several restrictions may need to be considered in the route search like some intersections must be included in the route while some should be excluded. The conventional optimal route search methods cannot consider such restrictions in the route search. In this paper, we propose a method to find the optimal route considering such restrictions, focusing on the restriction that some intermediate destinations must be visited before reaching the final destination. The proposed method is divided into three steps. In the first step, the optimal traveling times among the origin, intermediate destinations and final destination are calculated. In the second step, the optimal order of visiting intermediate destinations is optimized using RasID-D, a random search method for discrete optimization problems. Finally, in the third step, the optimal route from the origin to destination via intermediate destinations is determined. The paper also discusses the heuristic initialization to increase the efficiency of the optimal search. The proposed method was evaluated using a grid network with randomly generated intermediate intersections. Simulation results showed that the proposed method is more efficient than the genetic algorithm for optimizing the visiting order.

Original languageEnglish
Title of host publicationConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Pages393-397
Number of pages5
DOIs
Publication statusPublished - 2010
Event2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010 - Istanbul
Duration: 2010 Oct 102010 Oct 13

Other

Other2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010
CityIstanbul
Period10/10/1010/10/13

Fingerprint

Navigation systems
Railroad cars
Planning
Genetic algorithms

Keywords

  • RasID-D
  • Road network
  • Route planning

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction

Cite this

Mainali, M. K., Mabu, S., Li, X., & Hirasawa, K. (2010). Optimal route planning with restrictions for car navigation systems. In Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics (pp. 393-397). [5641754] https://doi.org/10.1109/ICSMC.2010.5641754

Optimal route planning with restrictions for car navigation systems. / Mainali, Manoj Kanta; Mabu, Shingo; Li, Xianneng; Hirasawa, Kotaro.

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics. 2010. p. 393-397 5641754.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mainali, MK, Mabu, S, Li, X & Hirasawa, K 2010, Optimal route planning with restrictions for car navigation systems. in Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics., 5641754, pp. 393-397, 2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010, Istanbul, 10/10/10. https://doi.org/10.1109/ICSMC.2010.5641754
Mainali MK, Mabu S, Li X, Hirasawa K. Optimal route planning with restrictions for car navigation systems. In Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics. 2010. p. 393-397. 5641754 https://doi.org/10.1109/ICSMC.2010.5641754
Mainali, Manoj Kanta ; Mabu, Shingo ; Li, Xianneng ; Hirasawa, Kotaro. / Optimal route planning with restrictions for car navigation systems. Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics. 2010. pp. 393-397
@inproceedings{6578586364d3419587b80b7e18dc3461,
title = "Optimal route planning with restrictions for car navigation systems",
abstract = "The optimal route search in car navigation systems is often considered to be a route search from the origin to destination. Many algorithms have been proposed to search for the optimal route from the origin to destination. However, in real situations several restrictions may need to be considered in the route search like some intersections must be included in the route while some should be excluded. The conventional optimal route search methods cannot consider such restrictions in the route search. In this paper, we propose a method to find the optimal route considering such restrictions, focusing on the restriction that some intermediate destinations must be visited before reaching the final destination. The proposed method is divided into three steps. In the first step, the optimal traveling times among the origin, intermediate destinations and final destination are calculated. In the second step, the optimal order of visiting intermediate destinations is optimized using RasID-D, a random search method for discrete optimization problems. Finally, in the third step, the optimal route from the origin to destination via intermediate destinations is determined. The paper also discusses the heuristic initialization to increase the efficiency of the optimal search. The proposed method was evaluated using a grid network with randomly generated intermediate intersections. Simulation results showed that the proposed method is more efficient than the genetic algorithm for optimizing the visiting order.",
keywords = "RasID-D, Road network, Route planning",
author = "Mainali, {Manoj Kanta} and Shingo Mabu and Xianneng Li and Kotaro Hirasawa",
year = "2010",
doi = "10.1109/ICSMC.2010.5641754",
language = "English",
isbn = "9781424465880",
pages = "393--397",
booktitle = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

}

TY - GEN

T1 - Optimal route planning with restrictions for car navigation systems

AU - Mainali, Manoj Kanta

AU - Mabu, Shingo

AU - Li, Xianneng

AU - Hirasawa, Kotaro

PY - 2010

Y1 - 2010

N2 - The optimal route search in car navigation systems is often considered to be a route search from the origin to destination. Many algorithms have been proposed to search for the optimal route from the origin to destination. However, in real situations several restrictions may need to be considered in the route search like some intersections must be included in the route while some should be excluded. The conventional optimal route search methods cannot consider such restrictions in the route search. In this paper, we propose a method to find the optimal route considering such restrictions, focusing on the restriction that some intermediate destinations must be visited before reaching the final destination. The proposed method is divided into three steps. In the first step, the optimal traveling times among the origin, intermediate destinations and final destination are calculated. In the second step, the optimal order of visiting intermediate destinations is optimized using RasID-D, a random search method for discrete optimization problems. Finally, in the third step, the optimal route from the origin to destination via intermediate destinations is determined. The paper also discusses the heuristic initialization to increase the efficiency of the optimal search. The proposed method was evaluated using a grid network with randomly generated intermediate intersections. Simulation results showed that the proposed method is more efficient than the genetic algorithm for optimizing the visiting order.

AB - The optimal route search in car navigation systems is often considered to be a route search from the origin to destination. Many algorithms have been proposed to search for the optimal route from the origin to destination. However, in real situations several restrictions may need to be considered in the route search like some intersections must be included in the route while some should be excluded. The conventional optimal route search methods cannot consider such restrictions in the route search. In this paper, we propose a method to find the optimal route considering such restrictions, focusing on the restriction that some intermediate destinations must be visited before reaching the final destination. The proposed method is divided into three steps. In the first step, the optimal traveling times among the origin, intermediate destinations and final destination are calculated. In the second step, the optimal order of visiting intermediate destinations is optimized using RasID-D, a random search method for discrete optimization problems. Finally, in the third step, the optimal route from the origin to destination via intermediate destinations is determined. The paper also discusses the heuristic initialization to increase the efficiency of the optimal search. The proposed method was evaluated using a grid network with randomly generated intermediate intersections. Simulation results showed that the proposed method is more efficient than the genetic algorithm for optimizing the visiting order.

KW - RasID-D

KW - Road network

KW - Route planning

UR - http://www.scopus.com/inward/record.url?scp=78751535323&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78751535323&partnerID=8YFLogxK

U2 - 10.1109/ICSMC.2010.5641754

DO - 10.1109/ICSMC.2010.5641754

M3 - Conference contribution

AN - SCOPUS:78751535323

SN - 9781424465880

SP - 393

EP - 397

BT - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

ER -