Sharif Digital Repository

The problem of finding the expected shortest path in stochastic networks, where the presence of each node is probabilistic and the arc lengths are random variables, have numerous applications, especially in communication networks. The problem being NP-hard we use an ant colony system (ACS) to propose a metaheuristic algorithm for finding the expected shortest path. A new local heuristic is formulated for the proposed algorithm to consider the probabilistic nodes. The arc lengths are randomly generated based on the arc length distribution functions. Examples are worked out to illustrate the applicability of the proposed approach  

We consider nonlinear optimization problems constrained by a system of fuzzy relation equations. The solution set of the fuzzy relation equations being nonconvex, in general, conventional nonlinear programming methods are not practical. Here, we propose a genetic algorithm with max-product composition to obtain a near optimal solution for convex or nonconvex solution set. Test problems are constructed to evaluate the performance of the proposed algorithm showing alternative solutions obtained by our proposed model  

This work considers scheduling problems minding the setup and removal times of jobs rather than processing times. For some production systems, setup times and removal times are so important to be considered independent of processing times. In general, jobs are performed according to the automatic machine processing in production systems, and the processing times are considered to be constant regardless of the process sequence. As the human factor can influence the setup and removal times, when the setup process is repetitive the setup times decreases. This fact is considered as learning effect in scheduling literature. In this study, a bi-criteria m-identical parallel machines scheduling... 

Line balancing problem plays an important role in the decision making process to increase efficiency and productivity. Recently, U-shaped layout in many production lines has replaced the traditional straight line layout using just-in-time concept. Here, we propose a model, using multi-objective decision making approach to the U-shaped line balancing problem, to offer enhanced decision maker flexibility, by allowing for conflicting goals. The assembly line operation efficiency is the most significant aim in our study, and this efficiency relates to management of resources and the solution of line balancing problem. First, the U-shaped line balancing problem is solved considering the model's... 

Graph theory has numerous applications to problems in systems analysis, operations research, transportation, and economics. In many cases, however, some aspects of a graph-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to make use of fuzzy set theory to deal with the uncertainty. Here, we are concerned with finding shortest chains in a graph with fuzzy distance for every edge. We propose a dynamic programming approach to solve the fuzzy shortest chain problem using a suitable ranking method. By using MATLAB, two illustrative examples are worked out to demonstrate the... 

We develop a fuzzy multi-objective linear programming (FMOLP) model for solving multi-objective mixed-model assembly line problem. In practice, vagueness and imprecision of the goals in this problem make the fuzzy decision-making complicated. The proposed model considers minimizing total utility work, total production rate variation, and total setup cost, using a two-phase linear programming approach. In the first phase, the problem is solved using a max-min approach. The max-min solution not being efficient, in general, we propose a new model in the second phase to maximize a composite satisfaction degree at least as good as the degrees obtained by phase one. To show the effectiveness of... 

The authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer bi-level mathematical problem, based on the concept of reserve capacity. The upper level goal is to maximize the reserve capacity by signal settings at intersections, determine street direction and increase street capacities via addition of lanes. The lower level problem is a deterministic user equilibrium traffic assignment problem to minimize the user travel time. The model being non-convex, meta-heuristic methods are used to solve the problem. A hybridization of genetic algorithm with simulated annealing and a bee algorithm are proposed. Numerical examples are illustrated to verify the... 

Green products are increasingly considered by companies, owing to the significant attention of government regulations, customers’ requests and competitors. Here, we deal with Green Product Families (GPFs) by selecting green components, modules and products which are produced based on the assembling to order (ATO) approach to cover diverse customer needs. Designing a GPFs is important but not sufficient for sustainable optimization. In fact, we need to simultaneously consider the supply chain of a GPF to control the pollution generated in the downstream supply chain. For a sustainable optimization approach, this joint configuration is usually structured based on economic, environmental and... 

Using 3-D scanned data to analyze and extract pore network plays a vital role in investigation of porous media's characteristics. In this paper, a new simple method is developed to detect pores and throats for analyzing the connectivity and permeability of the network. This automated method utilizes some of the common and well-known image processing functions which are widely accessible by researchers and this has led to an easy algorithm implementation. In this method, after polishing and quality control of images, using city-block distance function and watershed segmentation algorithm, pores and throats are detected and 3-D network is produced. This method can also be applied on 2-D images... 

In this paper, we try to recognize and distinguish different groups of arrhythmia using novel features which have been obtained from the heart rate's phase space in recent years. For this purpose, we used Triangular Phase Space Mapping (TPSM) and Parabolic Phase Space Mapping (PPSM). For recognition, we used three groups of 15 subjects using the Physionet database (Arrhythmia, Congestive Heart Failure (CHF), and Atrial Fibrillation (AF)) with Normal Sinus Rhythm (NSR). The obtained features discriminate arrhythmia from NSR by p