AN IMPROVED TS FOR THE OPEN VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS
In this paper, a problem is described and mathematical formulation is established on the basis of open vehicle routing problem with soft time windows. Meanwhile, an improved tabu search algorithm (TS) is proposed to optimize the OVRPSTW. In improved TS static, the initial solutions are obtained at random and then current one is selected from better solutions. Two paths are randomly selected on 2-opt to improve solution, ensuring the optimization between and inside the paths. Tabu lists length is expressed by linear Representation to conduct a dynamic tabu list. Thus, the length and the struction of tabu list change with search process diversifying the search path, to expand the scope of neighborhood search, and to improve global optimization. Simulation experiment proved the feasibility and effectiveness of tabu search algorithm .
TS OVRP window time
GeJinhui XiomgYing WangHongzhen
Department of Mathematics Tonghua Normal University Tonghua, China Department of Computar Science Tonghua Normal UniversityTonghua, China WanTong Pharceutical GroupTonghua,China
国际会议
杭州
英文
382-385
2012-10-28（万方平台首次上网日期，不代表论文的发表时间）