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.
We investigate a variant of the many‐to‐many hub location‐routing problem which consists in partitioning the set of nodes of a graph into routes containing exactly one hub each, and determining an extra route interconnecting all hubs. A variable neighborhood descent with neighborhood structures based on remove/add, swap and exchange moves nested with routing and location operations is used as a local...
This article studies the effect of partial coverage to extend the lifetime of wireless sensor networks and introduces a hybrid exact solution strategy that efficiently maximizes network lifetime. We consider a set of sensors used to provide coverage of discrete targets and transfer the information to the sink node via multi‐hop wireless communication. An active sensor has one of the two roles: it...
Ejection chain methods, which include the classical Lin–Kernighan (LK) procedure and the Stem‐and‐Cycle (S&C) reference structure, have been the source of the currently leading algorithms for large scale symmetric traveling salesman problems (STSP). Although these methods proved highly effective in generating large neighborhoods for symmetric instances, their potential application to the asymmetric...
We consider a content distribution network (CDN) in which data hubs or servers are established in multiple locations to cater to local demands. The distributions of data to these hubs along with related network design problems (such as hub location and user assignment) are the key decision problems to consider to minimize the total routing cost. A new model for allocation of segments is introduced...
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.