Research Of Cuckoo Search Algorithm For Workshop Vehicle Routing Problems

Assembly line is a basic manufacture mode for factories.Assembly line divides the complex production proceed into simple parts,allowing the work places to do simple and repeated jobs,which improves manufacture speed and avoids mistakes.With the growth of manufacture scale,how to effectively deliver raw materials to work places becomes a problem that must be considered.For products with complex manufacture process like cars,an assembly line is combined with lots of procedures,the raw materials required by each procedure is also different,some procedures may even require multiple types of raw materials.To avoid that the jobs of work places is not blocked by the lack of raw materials,the stocks of work places must be guaranteed with enough raw materials.But some raw materials cannot be stored for a long time out of the storehouse,because there is usually not the conditions for long time storage.If raw materials are provided without limit,the raw materials will pile up and cannot be consumed in time,which may result in the deterioration of raw materials.This paper conducts research on multiple types of the workshop logistics transportation scheduling problem,based on just in time.Mathematical model is constructed based on the conditions of each problem.Algorithms are designed to solve the problems.Computational experiments are conducted to test the efficiency of the proposed algorithms.The main contribution of this paper are as the following:1.An improved cuckoo search algorithm is proposed for workshop vehicle routing problem with one vehicle.According to the practical meaning of the problem,mathematical model is established.An improved cuckoo search algorithm and its implementation is designed to solve the problem.Results of the experiments indicate that the algorithm is able to get the global optimum of the problem instances with a robust performance.2.A chaotic cuckoo search algorithm is proposed for workshop vehicle routing problem with multiple vehicles.The conditions of the problem that infects the algorithm is deeply considered to add chaotic initialization and chaotic disturbance to cuckoo search algorithm to solve the problem.A technique that saves computation results is introduced for local search.Results of the experiments indicate that the algorithm is able to acquire solutions with high quality,with a small gap to the global optimu ms.The comparison between the algorithm without saving computation results and the proposed algorithm indicates that saving computation results is effective for reducing computation time.3.A hybrid genetic cuckoo search algorithm is proposed for workshop vehicle routing problem with multiple assembly lines.The objective of this problem is to minimize the weighted sum of the manufacture period of multiple assembly lines.According to the change of optimization target,the condition for determining the q uality of solutions is designed.This condition is used to instruct the design of the procedures of cuckoo search.Experimental results show that the algorithm is effective for solving this problem.4.A chaotic hybrid cuckoo search with zero distance binding is proposed for workshop vehicle routing problem allowing combination of multiple delivery periods.Based on the workshop logistics transportation scheduling problem with multiple assembly lines,the researched problem allows the vehicles to serve m ultiple manufacture periods of the assembly lines.Compared with the problem that the combination of multiple delivery periods is forbidden,the scale of problem that the algorithm have to deal with grows in double.To cope with this problem,a zero distan ce binding technique is proposed.Computational experiments show that this technique is effective for controlling the computation time of the algorithm.