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.
Location Set Covering Problem (LSCP) is a traditional problem in the location literature. LSCP is used in locating fire stations, computer networks, and many other service facilities. This paper proposes a covering problem with variable radii. In this problem, the cost to establish a facility is a monotonically increasing function of distance to the farthest covered node by the facility. The problem...
The capacitated location-routing problem (CLRP) belongs to the field of logistics of transportation. The CLRP appears as a combination of two difficult problems: the facility location problem (FLP) and the vehicle routing problem (VRP).It is an NP-hard problem. In order to solve practical large scale capacitated LRP, We propose a hybrid ant colony algorithm to solve the CLRP. To compare the proposed...
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.