Method for planning logistics paths on basis of bisectors of store point groups

Abstract

The invention discloses a method for planning logistics paths on the basis of bisectors of store point groups. The method includes steps of firstly, generating a clockwise initial path and an anticlockwise initial path; secondly, adding all passing points into the two initial paths to form a clockwise distribution path and an anticlockwise distribution path; thirdly, comprehensively considering unloading quantities and the distances of the paths and determining ultimate distribution paths. The method has the advantages that the angle bisectors of passing point groups are generated at first, the deterministic clockwise initial path and the deterministic anticlockwise initial path are obtained, then the passing points are added into the initial distribution paths according to given sequences and modes to obtain the complete distribution paths, and the unloading quantities and the distances of the paths are integrated with one another, so that the ultimate distribution paths can be determined; logistics distribution knowledge is effectively utilized as compared with ordinary optimal search algorithms, space distribution characteristics of stores are sufficiently utilized, accordingly, traveling salesman problem solving can be simplified, complicated search and comparative computation of intelligent optimization algorithms can be omitted, and the method is high in computation efficiency and good in stability.

Description

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine

Login to View More

AI Technical Summary

Benefits of technology

This patented technology allows for efficient computation of paths on an irregularly shaped area called a circle or arc used during transportation planning. It also uses certain techniques like geometric analysis (GPA) to determine which parts should be loaded into each section based upon their location within this zone's interior. By doing these calculations, we can make better decisions about where different materials will go from one part to another. Overall, our method provides technical benefits such as improved accuracy and reliability over traditional methods while reducing computational complexity compared to existing algorithms.

Problems solved by technology

This patented technical problem addressed in this patents relates to finding the best possible energy allocation for vehicles during transportation systems like road networks or railways. Current approaches involve searching roads based on static programming techniques alone without considering factors like environmental conditions or traffic patterns. However these strategic choices may lead to suboptimal routes leading to longer journs due to overlapping segments. Therefore, we propose a more comprehensive approach involving combining different mathematical functions together to optimize resource usage within specific areas.

Images