A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

Resolução do problema de carregamento e descarregamento de contêineres em terminais portuários via Beam Search

One problem that has been happening frequently in port terminals is the poor planning of the loading and unloading of containers. The reason of this problem is the lack of an efficient method that provides the best means of these operations. The main goal of this work is, to implement a method that provides the best ways to perform the loading and unloading of containers, at each port and thus bring a great saving for these terminals, since the number of moves is directly proportional to cost. To carry out this program was used the idea that the containers are placed in vertical stacks, where the access can be done only by the top of the stack, so the ship was treated as an matrix and to fill it, two rules were created for loading and two for unloading. To obtain the best sequence of rules was used Beam Search method, which is an enumeration type implicit method that analyzes only the best solution of the tree generated. Thus, the program developed in the Java language, provides the best way to perform the loading and unloading ports and the way as the ship leaves each port using a graphical interface

Atribuição de turmas para professores via Beam Search em Java

In the universities, before the start of each school year, is held the distribution of classes among available teachers. Therefore, it is necessary to consider the maximum workweek for each teacher and their preferences for each discipline, to prevent a teacher to give lessons in two separate locations at the same time and to avoid some teachers to become overloaded while others with large clearance. This process, manually performed, is time consuming and does not allow the visualization of other combinations of assignment of teachers to classes, besides being liable to error. This work aims to develop a decision support tool for the problem of assigning teachers to classes in college. The project encompasses the development of a computer program using the concepts of object orientation and a tree search algorithm of a combinatorial nature called Beam Search. The programming language used is Java and the program has a graphical interface for entering and manipulating data of the problem. Once obtained the schedule data of classes and teachers is possible, by means of the tool, perform various simulations and manual adjustments to achieve the final result. It is an efficient method of class scheduling, considering the speed of task execution and the fact that it generates only feasible results

Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System

In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking.

A common Tabu search algorithm for the global optimization of engineering problems

A novel common Tabu algorithm for global optimizations of engineering problems is presented. The robustness and efficiency of the presented method are evaluated by using standard mathematical functions and hy solving a practical engineering problem. The numerical results show that the proposed method is (i) superior to the conventional Tabu search algorithm in robustness, and (ii) superior to the simulated annealing algorithm in efficiency. (C) 2001 Elsevier B.V. B.V. All rights reserved.

A modified ant colony optimization algorithm modeled on tabu-search methods

An earlier model underlying the foraging strategy of a pachycodyla apicalis ant is modified. The proposed algorithm incorporates key features of the tabu-search method in the development of a relatively simple but robust global ant colony optimization algorithm. Numerical results are reported to validate and demonstrate the feasibility and effectiveness of the proposed algorithm in solving electromagnetic (EM) design problems.

Application of an iterative method and an evolutionary algorithm in fuzzy optimization

This work develops two approaches based on the fuzzy set theory to solve a class of fuzzy mathematical optimization problems with uncertainties in the objective function and in the set of constraints. The first approach is an adaptation of an iterative method that obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. The second one is a metaheuristic approach that adapts a standard genetic algorithm to use fuzzy numbers. Both approaches use a decision criterion called satisfaction level that reaches the best solution in the uncertain environment. Selected examples from the literature are presented to compare and to validate the efficiency of the methods addressed, emphasizing the fuzzy optimization problem in some import-export companies in the south of Spain. © 2012 Brazilian Operations Research Society.

Structural study of thin films prepared from tungstate glass matrix by Raman and X-ray absorption spectroscopy

Thin films were prepared using glass precursors obtained in the ternary system NaPO(3)-BaF(2)-WO(3) and the binary system NaPO(3)-WO(3) with high concentrations of WO(3) (above 40% molar). Vitreous samples have been used as a target to prepare thin films. Such films were deposited using the electron beam evaporation method onto soda-lime glass substrates. Several structural characterizations were performed by Raman spectroscopy and X-ray Absorption Near Edge Spectroscopy (XANES) at the tungsten L(I) and L(III) absorption edges. XANES investigations showed that tungsten atoms are only sixfold coordinated (octahedral WO(6)) and that these films are free of tungstate tetrahedral units (WO(4)). In addition, Raman spectroscopy allowed identifying a break in the linear phosphate chains as the amount of WO(3) increases and the formation of P-O-W bonds in the films network indicating the intermediary behavior of WO(6) octahedra in the film network. Based on XANES data, we suggested a new attribution of several Raman absorption bands which allowed identifying the presence of W-O and W=O terminal bonds and a progressive apparition of W-O-W bridging bonds for the most WO(3) concentrated samples (above 40% molar) attributed to the formation of WO(6) clusters. (C) 2008 Elsevier B.V. All rights reserved.

Conformational analysis: A new approach by means of chemometrics

In conformational analysis, the systematic search method completely maps the space but suffers from the combinatorial explosion problem because the number of conformations increases exponentially with the number of free rotation angles. This study introduces a new methodology of conformational analysis that controls the combinatorial explosion. It is based on a dimensional reduction of the system through the use of principal component analysis. The results are exactly the same as those obtained for the complete search but, in this case, the number of conformations increases only quadratically with the number of free rotation angles. The method is applied to a series of three drugs: omeprazole. pantoprazole, lansoprazole-benzimidazoles that suppress gastric-acid secretion by means of H(+), K(+)-ATPase enzyme inhibition. (C) 2002 John Wiley Sons. Inc.

ALTERNATIVE SAMPLING STRATEGY FOR A RANDOM OPTIMIZATION ALGORITHM

Alternative sampling procedures are compared to the pure random search method. It is shown that the efficiency of the algorithm can be improved with respect to the expected number of steps to reach an epsilon-neighborhood of the optimal point.

Thin films prepared from tungstate glass matrix

Vitreous samples containing high concentrations of WO3 (above 40% M) have been used as a target to prepare thin films. Such films were deposited using the electron beam evaporation method onto soda-lime glass substrates. These films were characterized by X-ray diffraction (XRD), perfilometry, X-ray energy dispersion spectroscopy (EDS), M-Lines and UV-vis absorption spectroscopy. In this work, experimental parameters were established to obtain stable thin films showing a chemical composition close to the glass precursor composition and with a high concentration of WO3. These amorphous thin films of about 4 mu m in thickness exhibit a deep blue coloration but they can be bleached by thermal treatment near the glass transition temperature. Such bleached films show several guided modes in the visible region and have a high refractive index. Controlled crystallization was realized and thus it was possible to obtain WO3 microcrystals in the amorphous phase. (C) 2007 Elsevier B.V. All rights reserved.

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry's own practice. © 2006 Elsevier Ltd. All rights reserved.

Thermal tunability of photonic bandgaps in photonic crystal fibers selectively filled with nematic liquid crystal

We address the bandgap effect and the thermo-optical response of high-index liquid crystal (LC) infiltrated in photonic crystal fibers (PCF) and in hybrid photonic crystal fibers (HPCF). The PCF and HPCF consist of solid-core microstructured optical fibers with hexagonal lattice of air-holes or holes filled with LC. The HPCF is built from the PCF design by changing its cladding microstructure only in a horizontal central line by including large holes filled with high-index material. The HPCF supports propagating optical modes by two physical effects: the modified total internal reflection (mTIR) and the photonic bandgap (PBG). Nevertheless conventional PCF propagates light by the mTIR effect if holes are filled with low refractive index material or by the bandgap effect if the microstructure of holes is filled with high refractive-index material. The presence of a line of holes with high-index LC determines that low-loss optical propagation only occurs on the bandgap condition. The considered nematic liquid crystal E7 is an anisotropic uniaxial media with large thermo-optic coefficient; consequently temperature changes cause remarkable shifts in the transmission spectrums allowing thermal tunability of the bandgaps. Photonic bandgap guidance and thermally induced changes in the transmission spectrum were numerically investigated by using a computational program based on the beam propagation method. © 2010 SPIE.

Distribution system restoration in a DG environment using a heuristic constructive multi-start algorithm

This paper proposes a heuristic constructive multi-start algorithm (HCMA) to distribution system restoration in real time considering distributed generators installed in the system. The problem is modeled as nonlinear mixed integer and considers the two main goals of the restoration of distribution networks: minimizing the number of consumers without power and the number of switching. The proposed algorithm is implemented in C++ programming language and tested using a large real-life distribution system. The results show that the proposed algorithm is able to provide a set of feasible and good quality solutions in a suitable time for the problem. © 2011 IEEE.