Improved Genetic Algorithm of Vehicle Routing Problems with Time Window for Military Logistic Distribution

2011 ◽  
Vol 135-136 ◽  
pp. 585-591
Author(s):  
Zhi Gang Zhang ◽  
Yan Cheng Gong

By changing the constrain conditions of delivery time windows and vehicle capacities to objective function, A vehicle scheduling model was built up based on minimum length of total transportation distance, which included penalty function terms of time window and vehicle capacity constrains, and the model characteristics and application prospects was analyzed. A improved Genetic Algorithm program was put forward to solve the model, in which a chromosome coding suitable to describe delivery routes was designed, a suitable-degree function was proposed, and a reproduction operator, a crossover operator and a mutation operator were constructed. An example was given to demonstrate feasibility of the algorithm. The study indicates that the Algorithm has higher algorithm efficiency and can effectively solve vehicle scheduling problems of military distribution centers.

2012 ◽  
Vol 178-181 ◽  
pp. 1790-1796 ◽  
Author(s):  
Ying Wu ◽  
Zi Bo Meng ◽  
Min Peng

In this paper, we research the problem of transportation routing for fresh food. We analyzed the limit of soft and hard time windows in transportation and formed the time window with fuzzy appointment based on customer satisfaction. The optimization of transportation routes mathematical model was structured. The improved genetic algorithm has been applied to matlab progam. This progam has found the optimal solution in the model. We used a case to prove the feasibility of the model and the algorithm. It has twelve customers and one DC need to transport services. The mathematical model is to simulate the transport of fresh food within realistic.The transportation routing is designed to improve customer satisfaction and reduce transportation costs.


2018 ◽  
Vol 48 (3) ◽  
pp. 151-156
Author(s):  
S. WU ◽  
C. CHEN

In order to solve the shortcomings of the traditional genetic algorithm in solving the problem of logistics distribution path, a modified genetic algorithm is proposed to solve the Vehicle Routing Problem with Time Windows (VRPTW) under the condition of vehicle load and time window. In the crossover process, the best genes can be preserved to reduce the inferior individuals resulting from the crossover, thus improving the convergence speed of the algorithm. A mutation operation is designed to ensure the population diversity of the algorithm, reduce the generation of infeasible solutions, and improve the global search ability of the algorithm. The algorithm is implemented on Matlab 2016a. The example shows that the improved genetic algorithm reduces the transportation cost by about 10% compared with the traditional genetic algorithm and can jump out of the local convergence and obtain the optimal solution, thus providing a more reasonable vehicle route.


2013 ◽  
Vol 409-410 ◽  
pp. 1307-1310
Author(s):  
Xiao Rong Zhou ◽  
Meng Tian Song ◽  
Yu Ling Zhang

This paper based on the genetic algorithm,introduced part search process and respectively established the mathematical scheduling model of full loads vehicle optimal scheduling with soft time windows and of non-full loads on the basis of the long distance logistics transportation situation of some companys distribution center in Shenzhen. Then programmed to achieve the scheduling of multi-vehicle touting and selection, and conducted example analysis.


2020 ◽  
Vol 12 (19) ◽  
pp. 7934
Author(s):  
Anqi Zhu ◽  
Bei Bian ◽  
Yiping Jiang ◽  
Jiaxiang Hu

Agriproducts have the characteristics of short lifespan and quality decay due to the maturity factor. With the development of e-commerce, high timelines and quality have become a new pursuit for agriproduct online retailing. To satisfy the new demands of customers, reducing the time from receiving orders to distribution and improving agriproduct quality are significantly needed advancements. In this study, we focus on the joint optimization of the fulfillment of online tomato orders that integrates picking and distribution simultaneously within the context of the farm-to-door model. A tomato maturity model with a firmness indicator is proposed firstly. Then, we incorporate the tomato maturity model function into the integrated picking and distribution schedule and formulate a multiple-vehicle routing problem with time windows. Next, to solve the model, an improved genetic algorithm (the sweep-adaptive genetic algorithm, S-AGA) is addressed. Finally, we prove the validity of the proposed model and the superiority of S-AGA with different numerical experiments. The results show that significant improvements are obtained in the overall tomato supply chain efficiency and quality. For instance, tomato quality and customer satisfaction increased by 5% when considering the joint optimization, and the order processing speed increased over 90% compared with traditional GA. This study could provide scientific tomato picking and distribution scheduling to satisfy the multiple requirements of consumers and improve agricultural and logistics sustainability.


1998 ◽  
Vol 111 (3) ◽  
pp. 479-494 ◽  
Author(s):  
Guy Desaulniers ◽  
June Lavigne ◽  
François Soumis

Sign in / Sign up

Export Citation Format

Share Document