نتایج جستجو برای: cloud based simulated annealing algorithm
تعداد نتایج: 3480795 فیلتر نتایج به سال:
bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. bilevel programming has been proved to be an np-hard problem. numerous algorithms have been developed for solving bilevel programming problems. these algorithms lack the required efficiency for solving a real problem. ...
in today’s dynamic market, organizations must be adaptive to market fluctuations. in addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. Combining with the features of flower pollination algorithm, an improved simulated annealing algorithm is proposed in this paper (FPSA). It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by flower pollination. There...
nowadays, one-dimensional cutting stock problem (1d-csp) is used in many industrial processes and re-cently has been considered as one of the most important research topic. in this paper, a metaheuristic algo-rithm based on the simulated annealing (sa) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. in this method, the 1d-...
recently, much attention has been given to stochastic demand due to uncertainty in the real -world. in the literature, decision-making models and suppliers' selection do not often consider inventory management as part of shopping problems. on the other hand, the environmental sustainability of a supply chain depends on the shopping strategy of the supply chain members. the supplier selection pl...
With the existence of ambiguity in the financial processes of projects, fuzzy concepts are being implemented into the foundation and essence of the current article. Authors have employed chance constrained programming and simulated annealing as appropriate tools for determining the net present worth value of several projects. At the end, the most economical project was chosen. In this article, ...
Stochastic optimization using simulated annealing has found wide applications in combinatorial optimization of NP-complete problems in recent years, especially in VLSI related problems. The Grid Connection Problem is a combinatorial optimization problem that is proven to be NP-complete. In this paper the simulated annealing algorithm has been applied to the Grid Connection Problem. We also prop...
the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...
The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید