نتایج جستجو برای: search problem
تعداد نتایج: 1119304 فیلتر نتایج به سال:
Diversified top-k weight clique (DTKWC) search problem is an important generalization of the diversified (DTKC) with practical applications. The aims to k maximal cliques that can cover maximum in a vertex weighted graph. In this work, we propose novel local algorithm called TOPKWCLQ for DTKWC which mainly includes two strategies. First, restart strategy adopted, repeated construction and updat...
economic dispatch with valve point effect and prohibited operating zones (pozs) is a non-convex and discontinuous optimization problem. harmony search (hs) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. the performances of these variants are severely affected by selection of different parameters of the algorithm. intel...
The Linear Search Problem is studied from the view point of Hamiltonian dynamics. For the specific, yet representative case of exponentially distributed position of the hidden object, it is shown that the optimal orbit follows an unstable separatrix in the associated Hamiltonian system.
Scheduling in production environments is used as a competitive tool to improve efficiency and respond to customer requests. In this paper, a scheduling problem is investigated in a three-stage flexible flowshop environment with the consideration of blocking and batch processing. This problem has been inspired by the charging and packaging line of a large battery manufacturer. In this environmen...
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
in this work, harmony search meta-heuristic optimization algorithm has been developed for aerodynamic shape optimization problem for the first time. the aerodynamic shape, which has been investigated, is an airfoil with parces method for its shape parameterization. the problem was minimization of aerodynamic objective function using inverse design method and the objective function has been the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید