Cross-docking is a warehousing strategy that involves moving of products from pickup nodes to delivery nodes through cross-dock in a short amount of time. This study proposed a simulated annealing heuristic (SA) to solve the vehicle routing problem with cross-docking introduced by Lee et al. (2006). The objective of the problem is to determine the number of vehicles and the best vehicle routes that minimize the sum of the operational cost of vehicles and transportation cost. Computation results show that SA can obtain better results in terms of objective function value at a slightly longer computational time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Simulated Annealing Heuristic for the Vehicle Routing Problem with Cross-docking


    Additional title:

    EcoProduction


    Contributors:


    Publication date :

    2014-06-11


    Size :

    10 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    A Simulated Annealing Heuristic for the Green Vehicle Routing Problem

    Yasin, Moch / Yu, Vincent F. | Springer Verlag | 2013


    A Simulated Annealing Heuristic for the Heterogeneous Fleet Pollution Routing Problem

    Yu, Vincent F. / Redi, A. A. N. Perwira / Jewpanya, Parida et al. | Springer Verlag | 2018


    Simulated annealing heuristic for lot-sizing problem

    Han, L. / Wang, F. / Feng, Y. | British Library Online Contents | 1999


    A fast simulated annealing heuristic for the multi-depot two-echelon vehicle routing problem with delivery options

    Yu, Vincent F. / Lin, Shih-Wei / Zhou, Lin et al. | Taylor & Francis Verlag | 2024


    Simulated annealing metaheuristic for the Double Vehicle Routing Problem with Multiple Stacks

    Chagas, Jonatas B. C. / Silveira, Ulisses E. F. / Benedito, Marcelo P. L. et al. | IEEE | 2016