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.
In this paper, a filter and fan method is proposed for the single-machine tardiness scheduling problem with sequence-dependent setups, which is a typical NP-hard combinational optimization problem. The method searches the solution space by means of neighborhood search tree and the tree branches are extended by predefined moves. To enhance the algorithm ability of escaping from local optima, kick strategy...
Diversity maintenance of solutions is a crucial part in multi-objective optimization. However, most of existing studies show a good distribution with a large computational load or a comparative bad distribution quickly. In this paper, a method for pruning a set of non-dominated solutions using a spanning tree is proposed. This approach defines a density estimation metric - spanning tree crowding distance...
In this paper we consider several problems regarding the optimal placement of storage servers in content delivery networks with tree-like topologies (paths, trees and cacti). We present several novel algorithmic solutions for locating (k+p)-centers and connected k-centers (and k-medians) in these networks, both in the continuous and the discrete cases. We comment both on the theoretical and the practical...
Given a connected, weighted, undirected graph G=(V, E) and a bound D, bounded diameter minimum spanning tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V| - 1. This paper proposes three new multi-parent recombination operators using different methods to choose parents in genetic...
With the explosive deployment of "triple play" (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access network is becoming critical for service providers. The problem of economically provisioning survivable access networks has given rise to a new class of network design problems, including the so-called survivable multi-level...
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.