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 road network of a small town is represented as a directed graph where each road junction is a vertex and each road segment (which has a length and a priority value) is a directed edge. We assume that there are several plows available to service the roads. We seek to compute an optimal allocation of routes to plows. Each route begins and ends at the same (depot) vertex. The union of all plow routes...
The road network of a small town is represented by a directed graph. Road junctions are the vertices of this graph and each road segment (which has a length and a priority value) is represented by a directed edge. Priority values are numbers 1, 2, etc. with the assumption that 1 is the highest priority. We seek to compute an optimal route map that begins at a particular vertex (the depot) and covers...
Snow plowing comprises a major portion of the total municipal budget in many communities. In these times of severe budget stress, it is vital to find ways to perform this essential service in an efficient manner. Optimizing the routes travelled by plows is one way to reduce costs. This problem, however, can be shown to be an NP-Hard problem at its core, with several additional complications. In this...
In this paper, we demonstrate the use of particle swarm optimization (PSO) to obtain near-optimal solutions to the NP-complete routing and wavelength assignment (RWA) problem in optical networks. More specifically, our PSO algorithm solves the RWA problem to carry the given traffic demands so that the network wavelength requirement as well as the average path lengths for the traffic is minimized....
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.