Titlebook: Recent Advances in Computational Optimization; Results of the Works Stefka Fidanova Book 2018 Springer International Publishing AG 2018 Com

救護車

Comparison of Selected Fuzzy PSO Algorithms,hich each of the particles has its own inertia weight and coefficients of the cognitive and social components. The evaluation is based on the common nonlinear benchmark functions frequently used for testing optimization methods. The ratings of the algorithms are assigned on the basis of the mean of the objective function final value.

anesthesia

Verification of Correctness of Parallel Algorithms in Practice,ctness of our two parallel algorithms for the NP-hard pickup and delivery problem with time windows. Both algorithms (for minimizing the number of routes and the travel distance) were already shown to be extremely efficient in practice—the implementations were thoroughly examined using the famous Li and Lim’s benchmark dataset.

說明

非秘密

ONYM

Process Control with the Variability Constraints,in consistent initial conditions. It has been proposed, that variability constraints can be used to define the consistent initial values for the index-1 differential-algebraic (DAEs) process. The variability constraints have an important practical application and have never been considered previousl

frozen-shoulder

Comparison of Different ACO Start Strategies Based on InterCriteria Analysis,rial optimization problems are hard to be solved. Therefore on this kind of problems usually is applied some metaheuristics. One of the most successful techniques for a lot of problem classes is metaheuristic algorithm Ant Colony Optimization (ACO). Some start strategies can be applied on ACO algori

沐浴

Evolutionary Approach for Tuning of Longwall Scraper Conveyor Model,l states which may lead to the occurrence of faults, and finally, to the breakdown. The developed model of a machine should be always parametrized, i.e. the certain number of parameters should be selected in the certain ranges. The most of the parameters can be selected based on engineering document

CLOUT

Solving Graph Partitioning Problems with Parallel Metaheuristics,g problems like clustering, partitioning into cliques and coloring. In all cases the search space is composed of vertex partitions satisfying specific problem requirements. The solver application contains two sequential and nine parallel/hybrid algorithms developed on the basis of SA and TS metaheur

LASH

Comparison of Selected Fuzzy PSO Algorithms, Takagi–Sugeno fuzzy system is used to change the parameters of these algorithms. A modified fuzzy particle swarm optimization method is proposed in which each of the particles has its own inertia weight and coefficients of the cognitive and social components. The evaluation is based on the common n

Foreknowledge

On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1, to the edge weights. Weights can be either exact real values, or real-valued intervals. In this work, the focus is on problems where the embedding space is the Euclidean 1-dimensional space, and the general situation where distances can be represented by intervals is taken into consideration. A pre