Sadegh Niroomand

Modified migrating birds optimization algorithm for closed loop layout with exact distances in flexible manufacturing systems

The paper modifies MBO algorithm using GA operators.The paper considers exact distances in layout evaluation.Taguchi method is used to calibrate the parameters of the algorithm.The modified MBO performs better than previous algorithms and also exact methods. This paper addresses a new meta-heuristic algorithm to solve a closed loop layout problem. The proposed algorithm applies a modified version of the recently invented migrating birds optimization method. The computational experiments show that in most of the benchmark problems the results obtained from the proposed migrating birds optimization method is better than those obtained by other methods which are published in the literature.

An extension principle based solution approach for shortest path problem with fuzzy arc lengths

AbstractA shortest path problem on a network in the presence of fuzzy arc lengths is focused in this paper. The aim is to introduce the shortest path connecting the first and last vertices of the network which has minimum fuzzy sum of arc lengths among all possible paths. In this study a solution algorithm based on the extension principle of Zadeh is developed to solve the problem. The algorithm decomposes the fuzzy shortest path problem into two lower bound and upper bound sub-problems. Each sub-problem is solved individually in different

Hybrid greedy algorithms for fuzzy tardiness/earliness minimisation in a special single machine scheduling problem: case study and generalisation

\alpha

A hybrid approach for multi-criteria emergency center location problem considering existing emergency centers with interval type data: a case study

α levels to obtain the shortest path, its fuzzy length and its associated membership function value. The proposed method contains no fuzzy ranking function and also for each

Modeling supermarket re-layout from the owner’s perspective

\alpha

Optimization Approaches for Core Mapping on Networks on Chip

α-cut, it gives a unique lower and upper bound for the fuzzy length of the shortest path. The algorithm is examined over some well-known networks from the literature and its performance is superior to the existent methods.