نتایج جستجو برای: meta heuristic methods
تعداد نتایج: 2043161 فیلتر نتایج به سال:
Here, a mixed-integer linear programming model is developed to represent transportation system of students traveling from/to university campus. The concept ridesharing used and the mechanism combinatorial auctions incorporated within routing-based model. mathematical based on vehicle routing problem along with appropriate constraints accommodating features that express auction clearing phase. A...
Flood is a common global natural hazard, and detailed flood susceptibility maps for specific watersheds are important management measures. We compute the map Kaiser watershed in Iran using machine learning models such as support vector (SVM), Particle swarm optimization (PSO), genetic algorithm (GA) along with ensembles (PSO-GA SVM-GA). The application of assessment mapping analyzed, future res...
Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...
One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...
In last few decades, the application of biological methods and systems to the study and design of engineering systems and modern technologies have fascinated many researchers. Numerous mathematical and meta-heuristic algorithms for solving optimization problems have been developed and widely used in both theoretical study and practical applications. To realize the application of such meta-heuri...
In this paper, a hybrid gradient simulated annealing algorithm is guided to solve the constrained optimization problem. trying problems using deterministic, stochastic methods or hybridization between them, penalty function are most popular approach due their simplicity and ease of implementation. There many approaches handling existence constraints in The simulated-annealing (SA) one successfu...
The network-design problem (NDP) has a wide range of applications in transportation, telecommunications, and logistics. The idea is to efficiently design a network of links (roads, optical fibres, etc.) enabling the flow of commodities (drivers, data packets, etc.) to satisfy demand characteristics. Various exact and heuristic methods such as branch and bound, Tabu search, genetic algorithm (GA...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید