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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Real-time weighting optimization in Chinese Postman Problem


    Contributors:


    Publication date :

    2013-10-01


    Size :

    301083 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Generalized Maximum Benefit Multiple Chinese Postman Problem

    Shafahi, Ali / Haghani, Ali | Elsevier | 2015



    The Chinese Postman Problem with Load-Dependent Costs

    Corberán, Ángel / Erdoğan, Güneş / Laporte, Gilbert et al. | British Library Online Contents | 2018


    Public sector vehicle routing : the Chinese postman problem.

    Stricker, Robert | DSpace@MIT | 1970

    Free access