نتایج جستجو برای: genetic algorithm and simulated annealing algorithm
تعداد نتایج: 16980195 فیلتر نتایج به سال:
logit models are one of the most important discrete choice models and they play an important role in describing decision makers’ choices among alternatives. in this paper the multi-nominal logit models has been used in mode choice modeling of isfahan. despite the availability of different mathematical computer programs there are not so many programs available for estimating discrete choice mode...
Reactive power dispatch for voltage profile modification has been of interest Abstract to powerr utilities. Usually local bus voltages can be altered by changing generator voltages, reactive shunts, ULTC transformers and SVCs. Determination of optimum values for control parameters, however, is not simple for modern power system networks. Heuristic and rather intelligent algorithms have to be so...
In this paper, we propose a new mathematical model for Capacitated Inventory Routing Problem (CIRP), which considers freshly delivery of perishable products to the customers’ location; otherwise, a reduction in products’ demand may occur. Therefore, we attempt to plan delivering process of products at the right time to avoid extra inventory causing increase in age of products. This ...
this paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. first, the problem is formulated as a mixed integer linear programming model. then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. two experiments are carried out to evaluate th...
Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. The problem is known to have local minimum solutions.A simulated annealing algorithm for the clustering problem. The solution of the clustering problem usually solved by the K-means algorithm.In this paper, we explore the applicability of simulated annealing. Clustering problem is investigat...
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید