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 routing problems pertain to the search for a shortest route (minimum cost or minimum distance or maximum flow, etc.) connecting two specified stations or nodes described as ‘source’ and ‘sink’. The paper aims at obtaining an optimal route of a more realistic situation as to scheduling maximum flows at a minimum cost from a source to a destination. The distance (cost) and arc capacity between any...
The paper aims at obtaining an optimal route of a fleet of oil-delivery tankers from a source to a number of service stations. The distance between any two stations and demand(s) for each station are given. The objective is to find an optimal route undertaken by tankers such that the requirements of stations are met, the total distance travelled by the Tankers and the backload of the Tankers is to...
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.