Sharif Digital Repository

The modeling and evaluation of enormous numbers of contingencies are the most challenging impediments associated with composite power system adequacy assessment, particularly for large-scale power systems. Optimal power flow (OPF) solution, as a widely common approach, is normally employed to model and analyze each individual contingency as an independent problem. However, mathematical representations associated with diverse states are slightly different in one or a few generating units, line outages, or trivial load variations. This inherent attribute brings a promising idea to speed up the contingency evaluation procedure. In this paper, postoptimal analysis (POA), as a well-recognized... 

In this article, a capacitated location allocation problem is considered in which the demands and the locations of the customers are uncertain. The demands are assumed fuzzy, the locations follow a normal probability distribution, and the distances between the locations and the customers are taken Euclidean and squared Euclidean. The fuzzy expected cost programming, the fuzzy β-cost minimization model, and the credibility maximization model are three types of fuzzy programming that are developed to model the problem. Moreover, two closed-form Euclidean and squared Euclidean expressions are used to evaluate the expected distance between customers and facilities. In order to solve the problem... 

In this research, the no-wait flowshop sequence-dependent setup time scheduling problem with minimization of weighted earliness and tardiness penalties as the criterion, typically classified as Fm|nwt, S ijk|∑wj'Ej+wj ″Tj, is investigated. A mixed integer linear programming model for the research problem is proposed. As the problem is shown to be strongly NP-hard, several metaheuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) algorithms are developed to heuristically solve the problem. A timing algorithm is generated to find the optimal schedule and calculate the objective function value of a given sequence. In order to compare the performance of the... 

In this paper, a novel multi-objective location model within multi-server queuing framework is proposed, in which facilities behave as M/M/m queues. In the developed model of the problem, the constraints of selecting the nearest-facility along with the service level restriction are considered to bring the model closer to reality. Three objective functions are also considered including minimizing (I) sum of the aggregate travel and waiting times, (II) maximum idle time of all facilities, and (III) the budget required to cover the costs of establishing the selected facilities plus server staffing costs. Since the developed model of the problem is of an NP-hard type and inexact solutions are... 

A mixed binary integer mathematical programming model is developed in this paper for ordering items in multi-item multi-period inventory control systems, in which unit and incremental quantity discounts as well as interest and inflation factors are considered. Although the demand rates are assumed deterministic, they may vary in different periods. The situation considered for the problem at hand is similar to a seasonal inventory control model in which orders and sales happen in a given season. To make the model more realistic, three types of constraints including storage space, budget, and order quantity are simultaneously considered. The goal is to find optimal order quantities of the... 

This research deals with a flexible flowshop scheduling problem with the arrival and delivery of jobs in groups and processing them individually. Each group of jobs has a specific release time. Due to the special characteristics of each job, only a specific group of machines in each stage are eligible to process that job. All jobs in a group should be delivered at the same time after processing. The objectives of the problem are the minimization of the sum of the completion time of groups on one hand and the minimization of sum of the differences between the completion time of jobs and the delivery time of the group containing that job (waiting period) on the other hand. The problem can be... 

Multi-periodic inventory control problems are mainly studied by employing one of two assumptions. First, the continuous review, where depending on the inventory level, orders can happen at any time, and next the periodic review, where orders can only be placed at the beginning of each period. In this paper, we relax these assumptions and assume the times between two replenishments are independent random variables. For the problem at hand, the decision variables (the maximum inventory of several products) are of integer-type and there is a single space-constraint. While demands are treated as fuzzy numbers, a combination of back-order and lost-sales is considered for the shortages. We... 

We revisit the problem of finding k paths with a minimum number of shared edges between two vertices of a graph. An edge is called shared if it is used in more than one of the k paths. We provide a ⌊k/2⌋-approximation algorithm for this problem, improving the best previous approximation factor of k - 1. We also provide the first approximation algorithm for the problem with a sublinear approximation factor of O(n3/4), where n is the number of vertices in the input graph. For sparse graphs, such as bounded-degree and planar graphs, we show that the approximation factor of our algorithm can be improved to O(√n). While the problem is NP-hard, and even hard to approximate to within an O(log n)... 

The bus network design problem is an important problem in transportation planning. It is the problem of determining a network of bus lines which best achieves a predetermined objective. This may be done with or without the presence of rapid transit lines. This study is devoted to solving this problem using genetic algorithm. The fitness function is defined as the benefit to the users of the bus network less the cost of the operator of the network, which is to be maximized subject to constraints that properly distribute bus routes over the study area. Objective function calculation depends on the basic data of the city and its bus lines and does not need traffic assignment results. So, it is... 

In this paper, we propose an optimization framework to retrieve an optimal group of experts to perform a given multi-aspect task/project. Each task needs a diverse set of skills and the group of assigned experts should be able to collectively cover all required aspects of the task. We consider three types of multiaspect team formation problems and propose a unified framework to solve these problems accurately and efficiently. Our proposed framework is based on Facility Location Analysis (FLA) which is a well known branch of the Operation Research (OR). Our experiments on a real dataset show significant improvement in comparison with the state-of-the art approaches for the team formation... 

Meshless methods are a relatively new type of numerical methods that have attracted the attention of many researchers over the past years. So far, a number of meshless methods have been developed and applied to solve problems in various fields of engineering, including solid mechanics and geotechnical problems. The Element-Free Galerkin (EFG) method is adopted in this study for solving the governing partial differential equations of equilibrium and continuity of pore fluid flow for numerical simulation of coupled hydro-mechanical problems. For this purpose, the weak form of the governing equations is derived by applying the weighted residual method and Galerkin technique. The penalty method... 

Flow shop scheduling problems with sequence-dependent setup times and minimising the number of tardy jobs as the criterion (F m |prmu, S ijk |∑U j) are considered in this research. A mixed-integer linear programming model is developed for the research problem. Since the proposed research problem has been proven to be NP-hard, several meta-heuristic algorithms based on tabu search (TS) and the imperialist competitive algorithm (ICA) are proposed to heuristically solve the problem. In order to find the best meta-heuristic algorithm, random test problems, ranging in size from small, medium, to large, are generated and solved by the meta-heuristic algorithms. Then, a detailed statistical... 

The airline industry is under intense competition to simultaneously increase efficiency and satisfaction for passengers and profitability and internal system benefit for itself. The boarding process is one way to achieve these objectives as it tends itself to adaptive changes. In order to increase the flying time of a plane, commercial airlines try to minimize the boarding time, which is one of the most lengthy parts of a plane's turn time. To reduce boarding time, it is thus necessary to minimize the number of interferences between passengers by controlling the order in which they get onto the plane through a boarding policy. Here, we determine the passenger boarding problem and examine the... 

In this paper, the flexible flow shop sequence-dependent group scheduling problem (FFSDGS) with minimisation of makespan as the criterion (FF m|fmls, S plk|C max) is investigated. For the first time a mathematical model for the proposed research problem is developed. Since the problem is shown to be NP-hard, six metaheuristic algorithms based on tabu search (TS) are developed to efficiently solve the problem. The proposed metaheuristics are different to the only available metaheuristic algorithm in the literature based on TS. By applying randomised complete block design and using available test problems in the literature, the best of the proposed TS algorithms in this research is identified.... 

We consider a multi-facility location problem in the presence of a line barrier with the starting point of the barrier uniformly distributed. The objective is to locate n new facilities among m existing facilities minimising the summation of the weighted expected rectilinear barrier distances of the locations of new facilities and new and existing facilities. The proposed problem is designed as a mixed-integer nonlinear programming model, conveniently transformed into a mixed-integer quadratic programming model. The computational results show that the LINGO 9.0 software package is effective in solving problems with small sizes. For large problems, we propose two meta-heuristic algorithms,... 

Management of reactive power resources is vital for stable and secure operation of power systems in the view point of voltage stability. This paper deals with the management of on-load tap changers (OLTCs) and dynamic VAR sources (including synchronous generators, synchronous condensers, and shunt reactive power compensators) to improve voltage stability margin (VSM) of power systems. This problem is usually called optimal reactive power dispatch (ORD) in the literature. The main contribution of the paper is to introduce a new objective function for the ORD problem. The proposed objective function is derived based on a local voltage stability index, called DSY, and has a strong correlation... 

In this paper the setup assembly line balancing and scheduling problem (SUALBSP) is considered. Since this problem is NP-hard, a hybrid genetic algorithm (GA) is proposed to solve the problem. This problem involves assigning the tasks to the stations and scheduling them inside each station. A simple permutation is used to determine the sequence of tasks. To determine the assignment of tasks to stations, the algorithm is hybridized using a dynamic programming procedure. Using dynamic programming, at any time a chromosome can be converted to an optimal solution (subject to the chromosome sequence). Since population diversity is very important to prevent from being trapped in local optimum... 

In this paper, a multi-product multi-chance constraint joint single-vendor multi-buyers inventory problem is considered in which the demand follows a uniform distribution, the lead-time is assumed to vary linearly with respect to the lot size, and the shortage in combination of backorder and lost-sale is assumed. Furthermore, the orders are placed in multiple of packets, there is a limited space available for the vendor, there are chance constraints on the vendor service rate to supply the products, and there is a limited budget for each buyer to purchase the products. While the elements of the buyers' cost function are holding, shortage, order and transportation costs, the set up and... 

A flexible flow shop is a generalized flow shop with multiple machines in some stages. This system is fairly common in flexible manufacturing and in process industry. In most practical environments, scheduling is an ongoing reactive process where the presence of real time information continually forces reconsideration of pre-established schedules. This paper studies a flexible flow shop system considering non-deterministic and dynamic arrival of jobs and also sequence dependent setup times. The problem objective is to determine a schedule that minimizes average tardiness of jobs. Since the problem class is NP-hard, a novel dispatching rule and hybrid genetic algorithm have been developed to... 

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...