نتایج جستجو برای: multi objective imperialist competitive algorithm

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

A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...

2017
Seyed Mahmood Hashemi Jingsha He Alireza Ebrahimi Basabi

modeling of network security is useful approach to comprehend the status. In this paper, network is modeled in a graph. Security problem is solved in graph as Graph Coloring Problem (GCP). In GCP, two adjacent nodes must have different colors. Thus GCP provides the security in the network. One objective in GCP is chromatic number and another objective is total price. We present a multi-objectiv...

2014
Meng - Hui Chen Chiao - Wei Yu Pei - Chann Chang

Imperial competitive algorithm (ICA) simulates a multi-agent algorithm. Each agent is like a kingdom has its country, and the strongest country in each agent is called imperialist, others are colony. Countries are competitive with imperialist which in the same kingdom by evolving. So this country will move in the search space to find better solutions with higher fitness to be a new imperialist....

2012
Helena Bahrami Marjan Abdechiri Mohammad Reza Meybodi

The novel Imperialist Competitive Algorithm (ICA) that was recently introduced has a good performance in some optimization problems. The ICA inspired by socio-political process of imperialistic competition of human being in the real world. In this paper, a new Imperialist Competitive Algorithm with Adaptive Radius of Colonies movement (ICAR) is proposed. In the proposed algorithm, for an effect...

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the inventory-routing problem, which is a combination of distribution and inventory management. This paper considers a multi object...

Journal: :journal of industrial engineering and management studies 0
f. molavi sadjad university of technology, mashhad, iran. e. rezaee nik sadjad university of technology, mashhad, iran.

resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...

This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...

There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist compe...

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

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