نتایج جستجو برای: non dominated ranked genetic algorithms nrga

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

2015
Seyed Mohsen Mousavi Najmeh Alikar Seyed Taghi Akhavan Niaki Ardeshir Bahreininejad

In this study, a bi-objective multi-state redundancy allocation problem of series-parallel systems consisting of some serial subsystems, each with non-repairable components in parallel, is investigated. Furthermore, due to uncertainty involved, both the performance rates and the availabilities of components are considered fuzzy. In addition, two strategies of all-unit and incremental-quantity d...

, Elnaz Pashaei,

The competitive market and declined economy have increased the relevant importance of making supply chain network efficient. This has created many motivations to reduce the cost of services, and simultaneously, to increase the quality of them. The network as a tri-echelon one consists of Suppliers, Warehouses or Distribution Centers (DCs), and Retailer nodes. To bring the problem closer to real...

In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...

Journal: :journal of industrial engineering and management studies 0
m. zandieh department of industrial management, management and accounting faculty, shahid beheshti university, g. c., tehran, iran.

this paper considers the job scheduling problem in virtual manufacturing cells (vmcs) with the goal of minimizing two objectives namely, makespan and total travelling distance. to solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (nsga-ii) and knowledge-based non-dominated sorting genetic algorithm (kbnsga-ii). the difference between these algor...

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

2011
Seyed Hamid Reza Pasandideh Amirhossain Chambari

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

Journal: :Appl. Soft Comput. 2015
Javad Sadeghi Seyed Taghi Akhavan Niaki

This paper presents a bi-objective vendor managed inventory (BOVMI) model for a supply chain problem with a single vendor and multiple retailers, in which the demand is fuzzy and the vendor manages the retailers’ inventory in a central warehouse. The vendor confronts two constraints: number of orders and available budget. In this model, the fuzzy demand is formulated using trapezoidal fuzzy num...

B. M. Vishkaei, M. EbrahimNezhad Moghadam Rashti, R. Esmaeilpour,

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

 In this research, a tri-objective mathematical model is proposed for the Transportation-Location-Routing problem. The model considers a three-echelon supply chain and aims to minimize total costs, maximize the minimum reliability of the traveled routes and establish a well-balanced set of routes. In order to solve the proposed model, four metaheuristic algorithms, including Multi-Objective Gre...

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

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