Study on Multi Depot Heterogeneous Vehicle Routing Problem with an Improved Variable Neighborhood Search Algorithm

Yuexiang Yang; Yingcheng Xu; Li Wang
December 2013
Information Technology Journal;2013, Vol. 12 Issue 23, p7137
Academic Journal
This study deals with the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows (MDHVRPTW) which is complex and still not resolved well. The objective is to determine the best fleet composition as well as the set of routes that minimize the total cost with known demands. To solve the problem, mathematical model of the MDHVRPTW is constructed and an improved variable neighborhood search algorithm is proposed. In the algorithm, the hybrid operators of insert and exchange are used to achieve the shaking process and the later optimization process is presented to improve the solution space, the best-improvement strategy is adopted which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions. The developed algorithm was tested in benchmark instances. The results obtained are quite competitive with those found in the literature and new improved solutions are reported. And finally the proposed model and algorithm is applied to the large water project in China to solve the allocation of vehicles and routes, it demonstrates that the systematic method is effective and feasible.


Related Articles

  • Heuristic Algorithm for Min-max Vehicle Routing Problems. Chunyu Ren // Journal of Computers;Apr2012, Vol. 7 Issue 4, p923 

    In order to satisfy with the individual and various demand of customer, the present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, new tabu search algorithm is used to get the optimization solution. It applies newly improved insertion...

  • A Hybrid Tabu Search for Multi-Depots Collaborative Vehicle Routing Problem with Simultaneous Pickup and Delivery. Jin Li; Jianghua Zhang // Journal of Convergence Information Technology;Nov2012, Vol. 7 Issue 21, p416 

    Multi-depots collaborative vehicle routing problem with simultaneous pickup and delivery is an new extension of the classical Vehicle Routing Problem (VRP) with multiple collaborative depots, vehicles ' working time constraints, and two objective functions that account for not just for the...

  • Optimization and Simulation of Express's Vehicle Routing in Commercial District Based on Ant Colony Algorithm. Yang Hao-xiong; Liu Tong // Information Technology Journal;2013, Vol. 12 Issue 24, p8462 

    Nowadays, the quantity of express packages is very large and the requirement of timeliness is also increasing in commercial district, so to optimize the vehicle routing for express's delivery in commercial district is the key point to improve the express enterprises' service level and...

  • Research on The Optimal Vehicle Routing of VRPTWPC Based on Ant Colony Algorithm. Zheng-shan Luo; Hai-tao Gu; Ji Ma; Gao Yang // International Journal of Digital Content Technology & its Applic;Apr2013, Vol. 7 Issue 7, p1014 

    The distribution routing optimization problem has been a hot research topic at home and abroad. However, the research mainly focused on the ant colony algorithm solving the vehicle routing problem with time windows (VRPTW) and the vehicle routing problem with precedence constraints (VRPPC), for...

  • Robust Design of Power System Stabilizers Using Adaptive Genetic Algorithms.  // World Academy of Science, Engineering & Technology;Apr2010, Issue 40, p267 

    No abstract available.

  • A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem. Ligang Cui; Lin Wang; Jie Deng; Jinlong Zhang // Mathematical Problems in Engineering;2013, p1 

    The capacitated vehicle routing problem (CVRP) is the most classical vehicle routing problem (VRP); many solution techniques are proposed to find its better answer. In this paper, a new improved quantum evolution algorithm (IQEA) with a mixed local search procedure is proposed for solving CVRPs....

  • Efficient Intelligent Optimized Algorithm for Dynamic Vehicle Routing Problem. Jiangqing Wang; Rongbo Zhu // Journal of Software (1796217X);Nov2011, Vol. 6 Issue 11, p2201 

    In order to solve the dynamic vehicle routing problem (DVRP) containing both dynamic network environment and real-time customer requests, an efficient intelligent optimized algorithm called IOA is proposed in this paper, which takes advantages of both global searching ability of evolutionary...

  • Harmony Search Algorithm for Vehicle Routing Problem with Time Windows. Yassen, Esam Taha; Ayob, Masri; Ahmad Nazri, Mohd Zakree; Ahmad, Zulkifli // Journal of Applied Sciences;2/15/2013, Vol. 13 Issue 4, p633 

    Harmony Search Algorithm (HSA) is a meta-heuristic algorithm inspired by the musical process to solve different optimization problems. It has been successfully applied to solve many combinatorial optimization problems such as university course timetabling and standard vehicle routing problems...

  • An Improved Variable Neighborhood Search Algorithm for Multi Depot Heterogeneous Vehicle Routing Problem based on Hybrid Operators. Yingcheng Xu; Wei Jiang // International Journal of Control & Automation;2014, Vol. 7 Issue 3, p299 

    This paper presents an Imporved Variable Neighborhood Search (IVNS) algorithm to solve Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows (MDHVRPTW). The initial solution is obtained by customer allocation and path planning based on a cost network. The hybrid operators of insert...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics