نتایج جستجو برای: heuristic behavior
تعداد نتایج: 671457 فیلتر نتایج به سال:
entrepreneurs use decision heuristics in lots of their business-related decisions. one of the most important heuristics is affect heuristic which is of paramount importance in entrepreneurs’ decision making. also, entrepreneurial marketing behavior is one of the most important entrepreneurial characteristics which is influenced by entrepreneurial mindset, decision making and thought. the paper’...
the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...
a one dimensional dynamic model for a riser reactor in a fluidized bed catalytic cracking unit (fccu) for gasoil feed has been developed in two distinct conditions, one for industrial fccu and another for fccu using various frequencies of microwave energy spaced at the height of the riser reactor (fccu-mw). in addition, in order to increase the accuracy of component and bulk diffusion, instanta...
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to be NP-complete; so that heuristic techniques are usually used. The main contribution of this work is twofold: (i) a technique for de-composing a CSP into a DFS-tree CSP structure; (ii) an heuristic search technique for solving ...
one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید