This paper presents an algorithm called CSPVRPTW for the Vehicles Routing Problem with Time Windows (VRPTW), which applies the PCP method (Precedence Constraint Posting) used for models of scheduling as a CSP (Constraint Satisfaction Problem). PCP involves the calculation of the shortest path in partial and global form, between pairs of nodes and among all the nodes respectively, in the graph that represents the VRPTW model. In order to apply PCP to VRPTW, the problem is treated as a CSP. The results show that the proposed search algorithm is efficient in the search for the global optimum for some problems.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Search Algorithm for the Constraint Satisfaction Problem of VRPTW




    Publication date :

    2007-09-01


    Size :

    393886 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Flower Pollination Algorithm for Vehicle Routing Problem with Time Windows (VRPTW)

    Pratiwi, Asri Bekti / Rakhmawati, Ismi Yayuk / Winarko, Edi | BASE | 2021

    Free access

    Low cost parallel solutions for the VRPTW optimization problem

    Arbelaitz, O. / Rodriguez, C. / Zamakola, I. | Tema Archive | 2001



    A Communication Scheme for an Experimental Grid in the Resolution of VRPTW Using an Evolutionary Algorithm

    Rodríguez-León, Abelardo / Cruz-Chavez, M A / Rivera-López, Rafael et al. | IEEE | 2010