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.
The PDPTW (Pickup and delivery problem with Time Windows) is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. In this paper, we present an approach based on genetic algorithm, aggregation method and minimum values for optimization of the dynamic multi-pickup and delivery problem with...
Aiming at the problem of intelligent path guidance in the parking lot, an improved Particle Swarm Optimization Algorithm(PSO) is proposed in this paper to find the optimal path. In order to overcome the shortcomings that standard PSO traps into local optima easily and improve the convergence speed of algorithm, the concept of GA and Multi-thread Technology are introduced. The experiment results show...
Nowadays real-time traffic signal control is a crucial issue with potential benefits in the fields of traffic control, environmental pollution, and energy utilization. In the literature, few related studies have been done with dynamic evolutionary algorithms. In this paper, we proposed a strategy using Collaborative Evolutionary-Swarm Optimization (CESO), which is able to track time-varying optimal...
The objective of this paper is to find solution to the dynamic vehicle traffic routing which substantially differs from the classical vehicle routing problem in the sense of constraints and area of application. Dynamic vehicle routing address the problem of finding the least time consumable path considering change in traffic condition dynamically in our day to day traffic. Due to the complex nature...
The artificial bee colony algorithm (ABC) with three loading heuristics for the two-dimensional loading capacitated vehicle routing problem (2L-CVRP) is presented in the paper. The 2L-CVRP is a combination of two well-known NP-hard problems, the capacitated vehicle routing problem, and the two-dimensional bin packing problem. It is very difficult to get a good performance solution in practice for...
In this paper, the vehicle routing problem with fuzzy demands is studied, and a chance constrain programming model under the conditions of fuzzy information is built. Then, an improved tabu search algorithm is proposed for finding the vehicle routing with the lowest total mileage. In the selection of initial solution, a roulette heuristic algorithm is adopted to reduce the search range. The results...
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.