In this study, based on real-time constraint, an optimization method is proposed for solving the problem of the optimal tour. For that, we will construct a graph containing the real-time state of traffic. The collected data will be used to predict the future state traffic and to give an optimized cost of the tour. This optimization is tested in different sizes of the road networks. The results show that the proposed method is efficient and effective in solving the Chinese Postman Problem in real-time.
Real-time weighting optimization in Chinese Postman Problem
2013-10-01
301083 byte
Conference paper
Electronic Resource
English
Generalized Maximum Benefit Multiple Chinese Postman Problem
Online Contents | 2015
|Generalized Maximum Benefit Multiple Chinese Postman Problem
Elsevier | 2015
|Public sector vehicle routing : the Chinese-postman problem
TIBKAT | 1970
|The Chinese Postman Problem with Load-Dependent Costs
British Library Online Contents | 2018
|