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 Ant Colony System (ACS) is a variant of Ant colony optimization algorithm. It is very famous with Traveling Salesman Problem. The parameters of ACS in tour construction, global and local updating pheromone direct effort to get the best result of this but they are often manually setting up. Beside, building the heuristic function to decide a choice next node on tour is potential research approach...
In order to minimize the length of time required for emergency relief distribution, the decision-maker always considers damaged road network restoration as a strategy. Focusing on the interrelationship between relief distribution and road network restoration, we provide a transparent and feasible solution for solving optimized road network emergency restoration scheduling for relief distribution....
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...
This paper models a vehicle routing problem applied in Singapore transportation situation. It is close to the classical vehicle routing problem with time windows, but with two special characteristics. Firstly, the routes are designed for vehicles to serve the customers in a practical map modeled with a set of roads and junctions. Secondly, in order to manage the traffic conditions, the special Electronic...
One-way Street of city is described as a strongly connected directed graph. Mathematical model is established by using related theory of strongly connected directed graph. The two algorithms are proposed, one is for solving the shortest distance between any two nodes in a strongly connected graph, and another is for computing the length of a minimal oriented H cycle based on improved genetic algorithm...
This paper focuses on the problem of delivery and scheduling for perishable goods with time-window. The aim is to find an optimal solution to minimize whole cost of delivery system. The challenge of this problem is that there are several trade-off between time constraint and cost constraint. We propose that genetic algorithm will be applied to research to find solution which meet customers' requirements...
The multiple origins multiple destinations routing (MOMDR) problem becomes extremely complicated when considering the traffic volumes on road sections. When solving this kind of problem, only heuristic algorithms have practical values because it is a typical NP-Hard problem. This paper applies Genetic Algorithm (GA) to enhance Sorting-Randomizing-Adjusting-Updating (SRAU) algorithm. The previous paper...
Vehicle Routing Problem (VRP) is one of the core issues of logistic distribution. But the traditional VRP doesn't consider the traffic condition of road network. Time Dependent Vehicle Routing Problem (TDVRP) is to study the problem of vehicle routing optimization in dynamic network with fluctuant link travel time. The traditional VRP has been proven to be an NP-hard problem, so it is more difficult...
In this paper, a dynamic vehicle routing problem with time windows (DVRPTW) was developed in the context of real-time traffic information. The objective of the problem is to minimize the travel time of the vehicles based on a time-dependent model in which the travel speeds are step functions. In order to calculate the forecasted speed, this model is enriched with an exponential smoothing function...
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.