Dijkstra algorithm is a basic algorithm to analyze the vehicle routing problem (VRP) in the terminal distribution of logistics center. According to the actual client demands of service speed and quality, the conceptio...Dijkstra algorithm is a basic algorithm to analyze the vehicle routing problem (VRP) in the terminal distribution of logistics center. According to the actual client demands of service speed and quality, the conceptions of economical distance of delivery and the best routing algorithm were given on the base of the Dijkstra algorithm with consideration of a coefficient of the road hustle degree. Economical distance of delivery is the shortest physical distance between two customers. It is the value of goods delivery in shortest distance when concerning factors such as the road length, the hustle degree, the driveway quantity, and the type of the road. The improved algorithm is being used in the development and application of a distribution path information system in the terminal distribution of logistics center. The simulation and practical case prove that the algorithm is effective and reasonable.展开更多
In recent years, with the rapid development of China's fresh market, cold chain logistics ushered in a new development opportunity. Because of the late start and slow development of cold chain logistics in China, ...In recent years, with the rapid development of China's fresh market, cold chain logistics ushered in a new development opportunity. Because of the late start and slow development of cold chain logistics in China, it is difficult to achieve cross-regional and offseason sales activities, resulting in a situation of high output and small sales volume, which is also an important reason for the high price and poor quality of fresh agricultural products. With the passage of time, the characteristics of cold chain distribution of agricultural products have become an important direction for the future development of logistics industry. In this paper, aiming at the characteristics of agricultural cold chain distribution, the carbon emissions in the process of distribution were quantified as costs and added to the total cost, and an optimization model of agricultural cold chain logistics path with time window considering the minimum total cost as the objective function was constructed. The improved genetic algorithm was used to solve the problem. The simulation results show that the improved genetic algorithm is an effective method to solve the optimization problem of agricultural cold-chain logistics path considering carbon emissions, and has guiding significance for the selection of low-carbon and environmentally friendly distribution routes for agricultural cold-chain logistics distribution enterprises.展开更多
In the large-scale logistics distribution of single logistic center,the method based on traditional genetic algorithm is slow in evolution and easy to fall into the local optimal solution.Addressing at this issue,we p...In the large-scale logistics distribution of single logistic center,the method based on traditional genetic algorithm is slow in evolution and easy to fall into the local optimal solution.Addressing at this issue,we propose a novel approach of exploring hybrid genetic algorithm based large-scale logistic distribution for BBG supermarket.We integrate greedy algorithm and hillclimbing algorithm into genetic algorithm.Greedy algorithm is applied to initialize the population,and then hill-climbing algorithm is used to optimize individuals in each generation after selection,crossover and mutation.Our approach is evaluated on the dataset of BBG Supermarket which is one of the top 10 supermarkets in China.Experimental results show that our method outperforms some other methods in the field.展开更多
Due to the problem complexity, simultaneous solution methods are limited. A hybrid algorithm is emphatically proposed for LRP. First, the customers are classified by clustering analysis with preference-fitting rules. ...Due to the problem complexity, simultaneous solution methods are limited. A hybrid algorithm is emphatically proposed for LRP. First, the customers are classified by clustering analysis with preference-fitting rules. Second, a chaos search (CS) algorithm for the optimal routes of LRP scheduling is presented in this paper. For the ergodicity and randomness of chaotic sequence, this CS architecture makes it possible to search the solution space easily, thus producing optimal solutions without local optimization. A case study using computer simulation showed that the CS system is simple and effective, which achieves significant improvement compared to a recent LRP with nonlinear constrained optimization solution. Lastly the pratical anlysis is presented relationship with regional logistics and its development in Fujian province.展开更多
基金Social Science Fund of Zhejiang Province(No 06CGGL22YBG)
文摘Dijkstra algorithm is a basic algorithm to analyze the vehicle routing problem (VRP) in the terminal distribution of logistics center. According to the actual client demands of service speed and quality, the conceptions of economical distance of delivery and the best routing algorithm were given on the base of the Dijkstra algorithm with consideration of a coefficient of the road hustle degree. Economical distance of delivery is the shortest physical distance between two customers. It is the value of goods delivery in shortest distance when concerning factors such as the road length, the hustle degree, the driveway quantity, and the type of the road. The improved algorithm is being used in the development and application of a distribution path information system in the terminal distribution of logistics center. The simulation and practical case prove that the algorithm is effective and reasonable.
文摘In recent years, with the rapid development of China's fresh market, cold chain logistics ushered in a new development opportunity. Because of the late start and slow development of cold chain logistics in China, it is difficult to achieve cross-regional and offseason sales activities, resulting in a situation of high output and small sales volume, which is also an important reason for the high price and poor quality of fresh agricultural products. With the passage of time, the characteristics of cold chain distribution of agricultural products have become an important direction for the future development of logistics industry. In this paper, aiming at the characteristics of agricultural cold chain distribution, the carbon emissions in the process of distribution were quantified as costs and added to the total cost, and an optimization model of agricultural cold chain logistics path with time window considering the minimum total cost as the objective function was constructed. The improved genetic algorithm was used to solve the problem. The simulation results show that the improved genetic algorithm is an effective method to solve the optimization problem of agricultural cold-chain logistics path considering carbon emissions, and has guiding significance for the selection of low-carbon and environmentally friendly distribution routes for agricultural cold-chain logistics distribution enterprises.
基金This project was funded by the National Natural Science Foundation of China(41871320,61872139)the Provincial and Municipal Joint Fund of Hunan Provincial Natural Science Foundation of China(2018JJ4052)+2 种基金Hunan Provincial Natural Science Foundation of China(2017JJ2081)the Key Project of Hunan Provincial Education Department(19A172)the Scientific Research Fund of Hunan Provincial Education Department(18K060).
文摘In the large-scale logistics distribution of single logistic center,the method based on traditional genetic algorithm is slow in evolution and easy to fall into the local optimal solution.Addressing at this issue,we propose a novel approach of exploring hybrid genetic algorithm based large-scale logistic distribution for BBG supermarket.We integrate greedy algorithm and hillclimbing algorithm into genetic algorithm.Greedy algorithm is applied to initialize the population,and then hill-climbing algorithm is used to optimize individuals in each generation after selection,crossover and mutation.Our approach is evaluated on the dataset of BBG Supermarket which is one of the top 10 supermarkets in China.Experimental results show that our method outperforms some other methods in the field.
文摘Due to the problem complexity, simultaneous solution methods are limited. A hybrid algorithm is emphatically proposed for LRP. First, the customers are classified by clustering analysis with preference-fitting rules. Second, a chaos search (CS) algorithm for the optimal routes of LRP scheduling is presented in this paper. For the ergodicity and randomness of chaotic sequence, this CS architecture makes it possible to search the solution space easily, thus producing optimal solutions without local optimization. A case study using computer simulation showed that the CS system is simple and effective, which achieves significant improvement compared to a recent LRP with nonlinear constrained optimization solution. Lastly the pratical anlysis is presented relationship with regional logistics and its development in Fujian province.
