Capacitated vehicle routing problem (CVRP) is an important combinatorial optimization problem. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high computational complexity. A tabu search was developed to solve the problem. The paper designs a tabu search algorithm for a kind of CVRP with soft time windows based on natural number coding studies the influence of parameters on search effect and achieves very good results in the instance. The results obtained show that the proposed algorithm is a feasible and effective method for this kind of problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Application of Tabu Search in Physical Distribution Capacitated Vehicle Routing Optimization Problem


    Contributors:
    Zeng, Yong (author) / Yin, Xuri (author)

    Conference:

    First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China



    Publication date :

    2007-07-09




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    The Application of Tabu Search in Physical Distribution Capacitated Vehicle Routing Optimization Problem

    Zeng, Y. / Yin, X. / China Communications and Transportation Association; Transportation & Development Institute (American Society of Civil Engineers) | British Library Conference Proceedings | 2007



    A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem

    Escobar, John Willmer / Linfati, Rodrigo / Baldoquin, Maria G. et al. | Elsevier | 2014


    A tabu search-based heuristic for a new capacitated cyclic inventory routing problem

    Seifbarghy, Mehdi / Samadi, Zahra | BASE | 2014

    Free access