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.
It is tempting to reuse simulation replications taken during a simulation optimization search as input to a ranking-and-selection procedure, especially when generating replications is computationally expensive. Yet when a search identifies new systems based on the observed performance of explored systems, the resulting search replications are conditionally dependent given the sequence of returned...
There has been enormous interest about Covering Location Problem (CLP) among both academicians and practitioners around the world. Applications of CLP range from locating fire stations to telecommunications. This paper deals with a special case of CLP where travel times are fuzzy variables. In addition, it has been assumed that the variable cost of locating facilities is a function of the distance...
This paper is talking about Open Capacitated Arc Routing Problem,which is a combinational optimization problem.The objective is mainly to search for a solution of minimum cost.
A differential evolution (DE) is presented for Minimizing earliness and tardiness penalties in a single machine problem with a common due date. Some control parameters of DE such as population, termination, and crossover factor, are selected according to the dynamic process of evolution, so the DE is very effective and efficient on finding optimum or near-optimal solutions. In order to improve solution...
This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Immune Genetic Algorithm (IGA) and Integer Linear Programming (ILP) model. More precisely, an IGA engine works as a generator of reduced instances for the original CL problem, which are formulated as ILP models. These instances, in turn, are solved by ILP, and the performance measures...
Cooperation and parallelism are means for increasing efficiency of search. However, these aspects become a downside, when do not use good strategy for cooperation and parallelism so that to remedy this. We propose to take these aspects into account by studying, choice of the strategy of cooperation and parallelism. Firstly, in this paper, we present a new algorithm specifically designed for solving...
The metric space model abstracts many proximity or similarity problems, where the most frequently considered primitives are range and k-nearest neighbor search, leaving out the similarity join, an extremely important primitive. In fact, despite the great attention that this primitive has received in traditional and even multidimensional databases, little has been done for general metric databases...
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.