This study proposes a new loop-wise route representation in which a vehicle route is represented in terms of continuous loop variables and a base route. The proposed loop-wise representation can guarantee a local route connectivity at each node with no constraint function, thereby simplifying the optimization formulation. Based on the proposed loop-wise route representation, optimization formulation is expressed for the traveling salesman problems (TSPs) in the planar graph. The performance of the proposed method is compared with that of genetic algorithm (GA) methods in four different cases of the TSPs. Numerical results show that the proposed method can determine the optimal route for the TSPs with a much higher computational efficiency, compared with the conventional GA methods.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Loop-Wise Route Representation and Its Optimization Formulation for Symmetric Traveling Salesman Problems


    Contributors:
    Kim, Geunu (author) / Jin, Hyunwoo (author) / Kim, Mingi (author) / Jang, Kitae (author) / Jang, In Gwun (author)


    Publication date :

    2023-09-01


    Size :

    2404249 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Orbit Traveling Salesman Problems: New Modeling Formulation via Convexification Approach

    Huang, An-Yi / Li, Heng-Nian / Zhang, Jia-Cheng et al. | AIAA | 2024


    Traveling Salesman Problems with Profits

    Feillet, Dominique | Online Contents | 2005


    Traveling Salesman Problems with Profits

    Feillet, D. / Dejax, P. / Gendreau, M. | British Library Online Contents | 2005


    Bi-Objective Colored Traveling Salesman Problems

    Xu, Xiangping / Li, Jun / Zhou, MengChu | IEEE | 2022


    A heuristic algorithm for traveling salesman problems

    Ashour, Said / Vega, J.F. / Parker, R.G. | Elsevier | 1971