Abstract.
Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.
Abstract. This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NPhard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined. The QAP is an NP-hard problem and this difficulty is not restricted only to finding the optimal solution. Sahni and Gonzalez [4] proved that even finding an ɛ-approximation solution for QAP is a hard problem in this sense that the existence of a ɛ-approximation algorithm implies P = NP.Finding an optimal solution to QAP is a difficult task not only in case of looking for the best solution among all the feasible ones. It might appear that finding an optimal solution in the subset of the feasible solutions can be easier. For QAP it was proven that finding an optimal solution in case of the local search is a difficult problem too. Johnson and Papadimitriou in [6] created the base for the complexity theory in the local search case, where a special structure of neighbourhood is introduced. They define the PLS-problems (polynomial-time local search problem) as a set for which a locally optimal solution can be found in polynomial time. Next, they introduce a PLS-complete decision problem as an analogy of NP-complete one, which are the most difficult problems in PLS.Murthy, Pardalos and Li [7] proposed a neighbourhood structure for QAP problem and proved that the corresponding local search problem is PLS-complete. The proposed structure is similar to that proposed by Kernighan and Lin [8] for the graph partitioning problem called K-L type neighbourhood structure N K-L . As the problem of finding QAP optimal solution in N K-L (called (QAP, N K-L )) is PLS-complete, then in the
Abstract. In recent years, newer algorithms inspired by nature have been created and used to solve various problems. Therefore, in the paper we present the application of firefly and cockroach algorithms to optimize two queueing systems and permutation flow shop problems with the objective of minimizing the makespan. The article briefly describes these algorithms to solve selected problems and their results. Because these algorithms were originally developed for continuous optimization problems, we introduce a new formula to transform the position of ith individual to solve the discrete problems.
Abstract:The article presents an example of using two optimisation methods, a genetic algorithm and cuckoo search, to identify parameters of electric drive controllers using some quality criteria and by applying a limitation to the maximum values of signals in the controlled facility. The results for both optimisation methods are compared. The impact of the probability that the nest host discovers the laid eggs on the speed of finding the optimum solution is investigated.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.