| Allied vehicle routing problem (AVRP) studies the vehicle routing problem base on the allied logistics condition, is part of the Project of Science and Technology Program of the Nation "the research of allied vehicle routing problem" and the Project of Science and Technology Program of Guangdong Province "the research of allied vehicle routing problem with time windows". In this paper, we put emphasis on tabu search algorithms of allied vehicle routing problem with time windows (VRPTW), allied vehicle routing problem with time windows and split deliveries (AVRPTWSD), allied vehicle routing problems with different capacities (AVRPDC) and allied vehicle routing problems with limited capacities of road (AVRPLCR). The main works were as follows:In the chapter 1, the VRP was simply introduced which was most heuristic to the AVRP, about the definition, classification. And the results of the studies about the tabu search algorithms was emphasized, including: the elements of this algorithms , process and parameters.In the chapter 2, the model of the AVRPTW was designed, and the TS was used to compute. The results were closed to the optimizations, and the algorithms had better efficiency.In the chapter 3, the AVRPTWSD had researched by TS. A transformative 2-opt neighborhood , initially answer and the arithmetic of the AVRPTWSD had been constructed. The final results close to the optimistic record in the referrences.In the chapter 4, the TS of AVRPDC was also studied. Initially answer was constructed by simulant got-up arrange,and the neighborhood was constructed by last insert method. The result showed: the model and the use of the TS was effective.In the chapter 5, the AVRPLCR had been created. Initially answer was constructed by client-direct array way. And new neighborhood, the arithmetic of the AVRPLCR had been constructed. The result showed: the excellent answers had been got from the TS arithmetic.In the end of this article, some undeveloped field of the AVRP had been put forward.
|
PDF Full Text Request