scholarly journals SHORTEST PATH DETERMINATION BETWEEN EDUCATIONAL INSTITUTIONS OF RĒZEKNE MUNICIPALITY

2017 ◽  
Vol 3 ◽  
pp. 451
Author(s):  
Pēteris Grabusts ◽  
Jurijs Musatovs
Keyword(s):  
Simulated Annealing ◽  
Degrees Of Freedom ◽  
Travelling Salesman Problem ◽  
Optimization Method ◽  
Educational Institutions ◽  
Travelling Salesman ◽  
Simulated Annealing Method ◽  
Multiple Degrees Of Freedom ◽  
Combinatorial System ◽  
Annealing Method

This study describes an optimization method called Simulated Annealing. The Simulated Annealing method is widely used in various combinatorial optimization tasks. Simulated Annealing is a stochastic optimization method that can be used to minimize the specified cost function given a combinatorial system with multiple degrees of freedom. In this study the application of the Simulated Annealing method to a well - known task of combinatorial analysis, Travelling Salesman Problem, is demonstrated and an experiment aimed to find the shortest tour distances between educational institutions of Rēzekne Municipality is performed. It gives possibilities to analyze and search optimal schools' network in Rēzekne Municipality.

scholarly journals OPTIMAL ROUTE DETECTION BETWEEN EDUCATIONAL INSTITUTIONS OF REZEKNE MUNICIPALITY

2017 ◽  
Vol 1 (9) ◽  
pp. 25
Author(s):  
Peter Grabusts ◽  
Jurijs Musatovs
Keyword(s):  
Simulated Annealing ◽  
Shortest Path ◽  
Degrees Of Freedom ◽  
Travelling Salesman Problem ◽  
Optimization Method ◽  
Theoretical Research ◽  
Educational Institutions ◽  
Descriptive Research ◽  
Shortest Route ◽  
School Network

Information about the merger of schools or their optimization periodically appears in the society. It is believed that the ideal school network is not yet ready. The paper provides the analysis of the educational institutions locations by their availability. A theoretical research has been conducted and mathematically the shortest path has been calculated between different educational institutions. The paper also provides mapping of these educational institutions and location analysis of educational institutions at different levels. The main goal of the paper is to show the possibilities of applying the mathematical models in solving practical tasks – to determine the shortest path between the educational institutions. This study describes an optimization method called Simulated Annealing. The Simulated Annealing method is widely used in various combinatorial optimization tasks. Simulated Annealing is a stochastic optimization method that can be used to minimize the specified cost function given a combinatorial system with multiple degrees of freedom. In this paper the application of Travelling Salesman Problem, is demonstrated and an experiment aimed to find the shortest route between educational institutions of Rezekne Municipality is performed. It gives possibilities to analyse and search optimal school' s network in the Rezekne Municipality.   Common research methods are used in this research: descriptive research method, statistical method, mathematical modelling

scholarly journals THE SEARCH FOR THE SHORTEST ROUTE FOR TOURISTS VISITING SIGHTSEEING OBJECTS OF THE RAZNA NATIONAL PARK

2018 ◽  
Vol 1 (10) ◽  
pp. 45
Author(s):  
Peter Grabusts ◽  
Jurijs Musatovs
Keyword(s):  
Simulated Annealing ◽  
National Park ◽  
Degrees Of Freedom ◽  
Travelling Salesman Problem ◽  
Optimization Method ◽  
Theoretical Research ◽  
Tourist Attractions ◽  
Descriptive Research ◽  
Shortest Route ◽  
Combinatorial System

The aim of the paper is to popularize the Razna National Park’s tourist attractions. The opportunity to choose the shortest route to visit all the most interesting potential sightseeing objects is offered. The authors continue their research on the theoretical and practical aspects of searching for the shortest route. Theoretical research has been carried out and mathematically the shortest route has been calculated for various sightseeing objects of the Razna National Park. The paper also provides mapping of these objects and an analysis of the locations of the sightseeing objects at different levels. The main goal of the paper is to show the possibilities of applying mathematical models in solving practical tasks – to determine the shortest route between the sightseeing objects. This research describes an optimization method called Simulated Annealing. The Simulated Annealing method is widely used for various combinatorial optimization tasks. Simulated Annealing is a stochastic optimization method that can be used to minimize the specified cost function given a combinatorial system with multiple degrees of freedom. In this paper, the application of the Travelling Salesman Problem is demonstrated, and an experiment aimed to find the shortest route between the Razna National Park sightseeing objects is performed. Common research methods are used in this research: the descriptive research method, the statistical method, mathematical modelling.

scholarly journals Shape Optimization of a Labyrinth Seal Applying the Simulated Annealing Method

2004 ◽  
Vol 10 (5) ◽  
pp. 365-371 ◽  
Author(s):  
V. Schramm ◽  
J. Denecke ◽  
S. Kim ◽  
S. Wittig
Keyword(s):  
Simulated Annealing ◽  
Shape Optimization ◽  
Optimization Method ◽  
Labyrinth Seal ◽  
Local Optima ◽  
Simulated Annealing Method ◽  
Flow Solver ◽  
Gradient Based ◽  
Computational Fluid Dynamics Cfd ◽  
Annealing Method

In the present work, an environment for the shape optimization of a labyrinth seal is described. A program for a parameterized, automated grid generation is coupled with a commercial Computational Fluid Dynamics (CFD) flow solver and an optimization algorithm. Standard optimization strategies, like gradient-based methods, mostly are trapped to local optima. Therefore, the simulated annealing method is applied. It allows the finding of global minima or maxima of arbitrary functions.The presented optimization method is used to minimize the leakage through a three-finned, stepped labyrinth seal. For the optimization, the step position and the step height are chosen to be variable. The characteristics of the flow fields of selected seal configurations are compared and discussed against the background of the leakage behavior of the seal.

A simulation study of self-assembly of ABC star terpolymers confined between two parallel surfaces

Soft Matter ◽  
2021 ◽  
Author(s):  
Zhiyao Liu ◽  
Zheng Wang ◽  
Yuhua Yin ◽  
Run Jiang ◽  
Baohui Li
Keyword(s):  
Simulated Annealing ◽  
Phase Behavior ◽  
Phase Diagrams ◽  
Simulation Study ◽  
Self Assembly ◽  
Simulated Annealing Method ◽  
Parallel Surfaces ◽  
Annealing Method

Phase behavior of ABC star terpolymers confined between two identical parallel surfaces is systematically studied with a simulated annealing method. Several phase diagrams are constructed for systems with different bulk...

Component Rearrangement on Printed Wiring Boards to Maximize the Fundamental Natural Frequency

1993 ◽  
Vol 115 (3) ◽  
pp. 312-321 ◽  
Author(s):  
Tien-Sheng Chang ◽  
E. B. Magrab
Keyword(s):  
Simulated Annealing ◽  
Boundary Conditions ◽  
Natural Frequency ◽  
Printed Wiring Board ◽  
Computationally Efficient ◽  
Additional Increase ◽  
Simulated Annealing Method ◽  
Fundamental Natural Frequency ◽  
Rearrangement Algorithm ◽  
Annealing Method

A methodology to attain the highest fundamental natural frequency of a printed wiring board by rearranging its components has been developed. A general two-dimensional rearrangement algorithm is developed by which the rearrangement of the component-lead-board (CLB) assemblies is performed automatically for any combination of equal size, unequal size, movable and immovable CLBs. This algorithm is also capable of incorporating two design restrictions: fixed (immovable) components and prohibited (non-swappable) areas. A highly computationally efficient objective function for the evaluation of the automatic rearrangement process is introduced, which is a linear function of the size of the individual CLBs that have been selected for each interchange. The simulated annealing method is adapted to solve the combinatorial rearrangement of the CLBs. Using 61 combinations of boundary conditions, equal and unequal sized CLBs, movable and immovable CLBs, various CLB groupings and sets of material properties, it is found that, when compared to the exact solution obtained by an exhaustive search method, the simulated annealing method obtained the highest fundamental natural frequency within 1 percent for 87 percent of the cases considered, within 0.5 percent for 72 percent of the cases and the true maximum in 43 percent of them. To further increase the fundamental natural frequency the introduction of a single interior point support is analyzed. Depending on the boundary conditions an additional increase in the maximum fundamental natural frequency of 44 to 198 percent can be obtained.

An Improved Shape Annealing Method for Truss Topology Generation

1994 ◽  
Author(s):  
Giridhar Reddy ◽  
Jonathan Cagan
Keyword(s):  
Simulated Annealing ◽  
Optimization Method ◽  
Geometric Constraints ◽  
Truss Structures ◽  
Model Design ◽  
Topology Generation ◽  
Truss Topology ◽  
Gradient Based ◽  
Annealing Algorithm ◽  
Annealing Method

Abstract A method for the design of truss structures which encourages lateral exploration, pushes away from violated spaces, models design intentions, and produces solutions with a wide variety of characteristics is introduced. An improved shape annealing algorithm for truss topology generation and optimization, based on the techniques of shape grammars and simulated annealing, implements the method. The algorithm features a shape grammar to model design intentions, an ability to incorporate geometric constraints to avoid obstacles, and a shape optimization method using only simulated annealing with more consistent convergence characteristics; no traditional gradient-based techniques are employed. The improved algorithm is illustrated on various structural examples generating a variety of solutions based on a simple grammar.

Sign in / Sign up

Export Citation Format

Share Document