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.
In this paper, we propose a new intersection-based geographical routing protocol, called delay tolerant routing protocol (DTRP) that adapts to the changes in the local topology within city environments. DTRP is based on an effective selection of road intersections through which a packet must pass to reach the gateway to the Internet. The selection, in such delay tolerant VANETs, is made in a way that...
The single vehicle pickup and delivery problem with time window (1-PDPTW) is an important class of vehicle routing problem. This problem aims to find a shortest route for a single vehicle to deliver objects from origin to destination, subject to load limit and time window of delivery. This study develops an ant colony optimization (ACO) method for the 1-PDPTW. Specifically, the constraints of time...
Starting with the introduction of product self-organization configuration design and configuration unit, the problem of solving initial configuration unit based on probability is described by using mathematic model of solving the problem in Fault Diagnose. Accordingly, fitness function is constructed for Genetic Algorithm on the basis of likelihood function. Meantime, vehicle leaf-spring is taken...
In order to solve the problem of slow convergence speed of adaptive genetic algorithm (AGA) in the early stage of evolution, an improved adaptive genetic algorithm (IAGA) was presented. With the introduction of an indicator evaluating the degree of population diversity, the new algorithm can adaptively adjust the probabilities of crossover. Furthermore, the IAGA was applied to vehicle routing problem...
The vehicle routing problem (VRP) is a very important combinatorial optimization and nonlinear programming problem in the fields of transportation, distribution and logistics. In this paper, a particle swarm optimization (PSO) algorithm with crossover for VRP is proposed. The PSO algorithm combined with the crossover operation of genetic algorithm (GA) can avoid being trapped in local optimum due...
A specialized genetic algorithm is proposed in this paper for path planning of vehicles based on time-dependent optimization criterion. A variable signal encoding scheme is adopted to represent the path and a particular fitness function is investigated for time-dependent shortest path planning. Domain heuristic knowledge based crossover, mutation and deletion operators are also specifically designed...
We study the stochastic vehicle routing problem with soft time windows (SVRPSTW). Vehicles with limited capacity are routed from the central depot to a set of geographically dispersed customers with unknown demands, predefined presence probability and time windows. The late arrival at the customer is allowed by adding a penalty to the objective value. A mathematical model is developed to describe...
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.