[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
Main Menu
Home::
Journal Information::
Articles archive::
Submission Instruction::
Registration::
Submit article::
Site Facilities::
Contact us::
::
Google Scholar

Citation Indices from GS

AllSince 2019
Citations85163555
h-index127
i10-index136

Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Search published articles ::
Showing 3 results for Javadian

Noori Darvish, Tavakkoli-Moghaddam, Javadian,
Volume 3, Issue 1 (4-2012)
Abstract

We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean completion times. After converting the original formulation into a single-objective crisp one by using an interactive approach and obtaining the Pareto-optimal solutions for small-sized instances, an efficient multi-objective particle swarm optimization (MOPSO) is proposed in order to achieve a good approximate Pareto-optimal set for medium and large-sized examples. This algorithm exploits new selection regimes of the literature for the global best and personal best. Furthermore, a modified decoding scheme is designed to reduce the search area in the solution space, and a local search algorithm is proposed to generate initial particle positions. Finally, the efficiency of the proposed MOPSO (PMOPSO) is shown by comparing with the common MOPSO (CMOPSO) by the use of the design of experiments (DOE) based on three comparison metrics.
Ms Avishan Salehi, Dr. Nikbakhsh Javadian,
Volume 13, Issue 1 (6-2022)
Abstract

Today, a high volume of multimedia information is transmitted in computer networks, such as the internet, that the requirement for achieving high security level against unauthorized access. the visual secret sharing scheme is a cryptographic system without requiring a secret key that is able to encrypt information in a multi - user computer network. in this research, a visual secret sharing scheme including two strategies for binary communications and multiple relationships were considered. in binary communications, an entity plays a role in the role of the server and an entity in the role of the client 's service in this strategy using a network - based visual secret sharing scheme ( 2 , 2 ) a secure approach to establish double relations where the provider entity is sending confidential information after authentication of the client 's service. then, two main phases of registration and verification are performed on the basis of the visual secret sharing scheme based on random networks. in tuple communication ( n , n ) an entity plays a role in the role of the server and several entities in the role of the service, and then two main phases of registration and verification are executed.
 
O. Keramatlou, Dr N. Javadian, H. Didehkhani, M. Amirkhan,
Volume 14, Issue 2 (12-2023)
Abstract

In this paper, a closed-loop supply chain (CLSC) is modeled to obtain the best location of retailers and allocate them to other utilities. The structure of CLSC includes production centers, retailers’ centers, probabilistic customers, collection, and disposal centers. In this research, two strategies are considered to find the best location for retailers by focusing on 1) the type of expected movement and 2) expected coverage. To this end, a bi-objective nonlinear programming model is proposed. This model concurrently compares Strategies 1 and 2 to select the best competitor. Based on the chosen strategy, the best allocation is determined by employing two heuristic algorithms, and the locations of the best retailers are determined. As the proposed model is NP-hard, a meta-heuristics (non-dominated sorting genetic) algorithm is employed for the solution process. Afterward, the effectiveness of the proposed model is validated and confirmed, and the obtained results are analyzed. For this purpose, a numerical example is given and solved through the optimization software.
 

Page 1 from 1     

مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.06 seconds with 29 queries by YEKTAWEB 4642