The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

This paper presents the design optimization of axial flux surface mounted Permanent Magnet Brushless DC motor based on genetic algorithm for an electrical vehicle application. The rating of the motor calculated form vehicle dynamics is 250 W, 150 rpm. The axial flux surface mounted Permanent Magnet Brushless DC (PMBLDC) motor was designed to fit in the rim of the wheel. There are several design...

The cost-effectiveness and accuracy of a multidisciplinary design optimization (MDO) process is highly dependent on designers’ ability to flexibly formulate the optimization problem for specific challenges. Designers need to rapidly modify how object parameters are assigned to groupings of objects in the product model. Our research has developed a Reference-Based Optimization Method (RBOM) to e...

The optimization of continuous parameters in electrotechnical design using electromagnetic field simulation is already standard. In this paper, we present a new sequential modelling approach for mixed-integer simulationbased optimization. We apply the method for the optimization of integerand real-valued geometrical parameters of the coils of a superconductive magnet.

Manufacturing sectors in Sweden have a long history that leads to common non-optimized flows on the shop floor. Especially when having a really high product mix and a low-volume of customized products, a great deal of effort with respect to flow optimization is needed to stay present and compete in the globalized market. The goal of this project is to support the design and development of the i...

In this paper we consider a global optimization method for space trajectory design problems. The method, which actually aims at finding not only the global minimizer but a whole set of low-lying local minimizers (corresponding to a set of different design options), is based on a domain decomposition technique where each subdomain is evaluated through a procedure based on the evolution of a popu...

The class of generalized pattern search (GPS) algorithms for mixed variable optimization is extended to problems with stochastic objective functions, by augmenting it with ranking and selection (R&S). Asymptotic convergence for the algorithm is established, numerical issues are discussed, and performance of the algorithm is studied on a set of test problems.

In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). Although the application of OO in the SP has been justified theoretically, the application in the DCP lacks similar analysis. In this paper, we show the equivalence between OO in the DCP and in the SP, which justifies...

While multi-agent systems have been successfully applied to combinatorial optimization, very few works concern their applicability to continuous optimization problems. In this article we propose a framework for modeling a continuous optimization problems as multi-agent system, which we call NDMO, by representing the problem as an agent graph, and complemented with optimization solving behaviors...

We use discrete event simulation to model and analyze a real-life emergency department (ED). Our approach relies on the appropriate integration of most real-life ED features to the simulation model in order to derive useful practical results. Data is supplied from the ED of the urban French hospital Saint Camille. Our purpose is to optimize the human resource staffing levels. We want to minimiz...