The optimization of the vehicle routing problem (VRP) is the focus of the logistics distribution enterprise. According to the complexity and dynamic nature of the traffic network, a logistics distribution enterprise vehicle routing problem model is built. Aiming at solving the model optimal solution problem that need search the optimal solution or quasi-optimal solution in a complex and huge space and search process will lead to combination explosion if algorithm traverses the whole search space, a simulated annealing algorithm is applied. The algorithm optimizes the number of vehicles and transporting routes, so as to achieve the goal of shortest distance, fewer vehicles and less cost. At the same time, an example is taken to prove the usability and global optimality of the simulated annealing algorithm in the logistics distribution enterprise vehicle routing problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Research on Logistics Distribution Enterprise Vehicle Routing Problem Based on the Simulated Annealing


    Contributors:
    Wang, Yu (author)

    Conference:

    International Conference of Logistics Engineering and Management (ICLEM) 2010 ; 2010 ; Chengdu, China


    Published in:

    ICLEM 2010 ; 3521-3527


    Publication date :

    2010-09-09




    Type of media :

    Conference paper


    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


    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


    Multi-UAV Logistics Planning Problem Based on Improved Genetic Simulated Annealing Algorithm

    Xue, Zhentao / Chen, Jian / Cao, Yuanyang et al. | Springer Verlag | 2023


    Reverse Logistics Network Problem using simulated annealing with and without Priority-algorithm

    Mounir Benaissa / Ilhem Slama / Mohamed Mahjoub Dhiaf | DOAJ | 2018

    Free access