scholarly journals Travel route scheduling based on user’s preferences using simulated annealing

2019 ◽  
Vol 9 (2) ◽  
pp. 1275 ◽  
Author(s):  
Z. K. A. Baizal ◽  
Kemas M. Lhaksmana ◽  
Aniq A. Rahmawati ◽  
Mizanul Kirom ◽  
Zidni Mubarok
Keyword(s):  
Simulated Annealing ◽  
Average Length ◽  
Travelling Salesman Problem ◽  
Ant Colony ◽  
Routine Activity ◽  
Tourist Destination ◽  
Route Scheduling ◽  
Annealing Method ◽  
Length Of Visit

<p>Nowadays, traveling has become a routine activity for many people, so that many researchers have developed studies in the tourism domain, especially for the determination of tourist routes. Based on prior work, the problem of determining travel route is analogous to finding the solution for travelling salesman problem (TSP). However, the majority of works only dealt with generating the travel route within one day and also did not take into account several user’s preference criteria. This paper proposes a model for generating a travel route schedule within a few days, and considers some user needs criteria, so that the determination of a travel route can be considered as a multi-criteria issue. The travel route is generated based on several constraints, such as travel time limits per day, opening/closing hours and the average length of visit for each tourist destination. We use simulated annealing method to generate the optimum travel route. Based on evaluation result, the optimality of the travel route generated by the system is not significantly different with ant colony result. However, our model is far more superior in running time compared to Ant Colony method.</p>

Novel Form-Finding of Tensegrity Structures Using Ant Colony Systems

2011 ◽  
Author(s):  
Yao Chen ◽  
Jian Feng ◽  
Yongfen Wu
Keyword(s):  
Travelling Salesman Problem ◽  
Ant Colony ◽  
Ant Colony System ◽  
Form Finding ◽  
Tensegrity Structures ◽  
Connectivity Patterns ◽  
Feasible Solutions ◽  
Ant Colony Systems ◽  
The Given

Tensegrity structures are drawing the attention of architects and engineers due to their remarkable configurations. They have inextensional mechanisms, yet they are stable. The determination of connectivity patterns of the compression bars and tension cables is a key to design tensegrity structures. In this paper, a discrete optimization model for the form-finding of tensegrity structures was developed, and converted into a modified travelling salesman problem (TSP). The ant colony system (ACS) was used to search for feasible solutions, where all the given nodes were taken as different cities in the network. To obtain optimized shapes of tensegrity structures with stable equilibriums and adequate stiffness, an objective function was introduced. Examples based on the geometries of some polyhedra were carried out using the proposed technique. Many different configurations of the assemblies which consist of cables and bars are transformed into interesting tensegrity structures. It concludes that this novel algorithm could be applicable to the form-finding of both regular and nonregular tensegrity structures.

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 Solving Random Travelling Salesman Problem using Firefly Algorithm

2020 ◽  
Vol 9 (4) ◽  
pp. 1037-1041
Keyword(s):  
Genetic Algorithms ◽  
Simulated Annealing ◽  
Firefly Algorithm ◽  
Ant Colony Algorithm ◽  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
Ant Colony ◽  
Ant Colony Algorithms ◽  
Comparison Of The Results ◽  
Discrete Optimization Problems

The firefly algorithm is a recently developed optimization algorithm, which is suitable for solving any kind of discrete optimization problems. This is an algorithm inspired from the nature. In this paper, a firefly algorithm is proposed to solve random traveling salesman problem. The solution to this problem is already proposed by the algorithms like simulated annealing, genetic algorithms and ant colony algorithms. This algorithm is developed to deal with the issue of accuracy and convergence rate in the solutions provided by those algorithms. A comparison of the results produced by proposed algorithm with the results of simulated annealing, genetic algorithms and ant colony algorithm is given. Finally, the effectiveness of the proposed algorithm is discussed.

scholarly journals Determination of magnetoelastic oscillations in ferrite plate with different values of anisotropy constant

2018 ◽  
Vol 185 ◽  
pp. 02005
Author(s):  
Leonid Kotov ◽  
Pavel Severin ◽  
Vladimir Vlasov ◽  
Dmitry Beznosikov
Keyword(s):  
Simulated Annealing ◽  
Magnetization Vector ◽  
Anisotropy Constant ◽  
External Fields ◽  
Ferrite Plate ◽  
Simulated Annealing Method ◽  
Material Parameters ◽  
Additional Constraints ◽  
Annealing Method

The maximum amplitudes of magnetic and elastic oscillations are calculated at various material parameters and parameters of external fields. Normally and tangentially magnetized anisotropic magnetic plates were considered. To obtain the maximum amplitudes with additional constraints, the simulated annealing method was used. The behaviour of the magnetic and elastic components of the oscillations was considered. The changes in the position of the magnetization vector and the equilibrium displacements as a function of the first anisotropy constant were revealed.

Sign in / Sign up

Export Citation Format

Share Document