The Vehicle Routing Problem Based on the Immune Algorithm
The Vehicle Routing Problem has been a popular research topic in logistics (Physical distribution)which is of much practical value. This thesis puts forward the method of solving vehicle routing probleM by the immune algorithm. In the solution procedure, this thesis creates a new encoded model which can increase the operational efficiency of the algorithM presented by decreasing the encoding length. Through the design of immune memory data and the accelerating or restraining mechanism of the density between the antibodies, this algorithm enables the multiformity of the solution, avoids convergence to partial optimal solution and at the same time effectively avoids the optima solution in the process of evolution. The experimental result shows that this algorithm is one effective algorithm solving the problem of vehicle routing which makes it possible to get the optimal solution fast.
Vehicle Routing Problem Immune Algorithm Antigen Antibody Mutation
XU Jiangang Fan Jianhua
Tianjin University of Finance & Economics TJUFE Tianjin, China Tianjin University of Technology TJUT Tianjin, China
国际会议
Second International Symposium on Information Science and Engineering(第二届信息科学与工程国际会议)
上海
英文
509-513
2009-12-26（万方平台首次上网日期，不代表论文的发表时间）