نتایج جستجو برای: pareto based meta heuristic algorithm

تعداد نتایج: 3494059  

2017
Kawal Jeet Sameer Sharma Kewal Krishan Nailwal

Flow shop scheduling of jobs has always been a popular problem that has found solutions in the number of heuristic and meta-heuristic techniques. In this manuscript, two-machine flow shop scheduling problem has been investigated while optimizing makespan and idle time of machines. Uncertainties in the processing time and set up times of jobs involved are also taken into consideration in the for...

Journal: :international journal of smart electrical engineering 0
ehsan tehrani 1department of electrical engineering, buinzahra branch, isamic azad university, buinzahra, amir reza zare bidaki young researchers and elite club, buinzahra branch, islamic azad university, buinzahra mohsen farahani young researchers and elite club, east tehran branch, islamic azad university, tehran iran

abstract in this paper, a fuzzy pid with new structure is proposed to solve the load frequency control in interconnected power systems. in this study, a new structure and effective of the fuzzy pid-type load frequency control (lfc) is proposed to solve the load frequency control in interconnected power systems. the main objective is to eliminate the deviations in the frequency of different area...

Journal: :journal of computational & applied research in mechanical engineering (jcarme) 2012
n. balaji n. jawahar

this paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. the objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. a 0-1 mixed intege...

Journal: :Networks 2021

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...

F. Moeen Moghadas

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد گرمسار - دانشکده ادبیات و زبانهای خارجی 1391

this study was an attempt to investigate the effect of teaching meta cognitive strategies on iranian intermediate efl students speaking proficiency. in this study the researcher has employed metacognitive strategies taken from brown (2000) to teach speaking strategies to number of participants. the participants were intermediate students of shokouh language institute; they were divided into an ...

2014
Lixin Tang Hua Gong Jiyin Liu Feng Li

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the...

Journal: :Electronics 2021

This paper presents a comprehensive survey of the meta-heuristic optimization algorithms on text clustering applications and highlights its main procedures. These Artificial Intelligence (AI) are recognized as promising swarm intelligence methods due to their successful ability solve machine learning problems, especially problems. reviews all relevant literature meta-heuristic-based application...

2012
Cheol Min Joo Byung Soo Kim

This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain opt...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید