The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Provides a novel hybrid ant colony algorithm combining genetic algorithm with implicit parallel function to make up the shortcomings of common ant colony alogrithm in the vehicle routing problem including slow convergence in the early stages. Introducing the encoding and mutation operation can improve the efficiency of solving the optimal distribution path. The comparative analysis of vehicle routing...
The vehicle routing problem is proved to be a kind of NP problem. Immune genetic algorithm is proposed based on genetic algorithm and the use of the biological and immune system in this paper. A kind of group diversity maintaining strategy based on the density of individual is constructed. An immune operator and a immune memory library are applied to the algorithm. The experimental results of a VRP...
In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW was proposed in detail. Meantime, an improved genetic algorithm (IGA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional genetic algorithm (GA). The novel crossover-operator, swapping operator and inversion...
Vehicle Routing Problem (VRP) is one of critical problems in modern logistics service. Due to small batch and dynamic changes of VRP, an effective and fast algorithm solution of VRP is greatly needed. But in traditional Ant Colony Algorithm, the searching speed is slow, and it is easy to fall into the local optimization when solve this problem. In order to overcome these disadvantages, basing on the...
In order to overcome the convergence deficiency of the basic ACO, an improved ACO based on the direction of the logistics and distribution problem was proposed. The logistics optimization method was used to optimize the path finding in the ACO. The simulation results show that the method of optimization of logistics and distribution path is practical and effective. This study provides a new powerful...
To resolve vehicle routing problem in logistic field, genetic arithmetic and ant colony arithmetic are often employed, and each runs with merit and defect. In the paper, two algorithm thinking are integrated based on each trait. Firstly a rapid and excellent solution arises in anterior genetic operation, and initial information elements derive from the solution, and then ant colony arithmetic starts...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.