Sharif Digital Repository

In this paper, a new algorithm for solving the shortest loop design problem is presented. The shortest loop design problem is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. In this paper, first it is shown that this problem can be represented as a graph model. The properties of the presented model enable us to design a meta-heuristic based on ant colony system algorithm for solving the shortest loop design problem. Computational results show the efficiency of our algorithm in compare to the other techniques  

Two different approaches of the dynamic optimization for chemical process control engineering applications are presented. The first approach is based on discretizing both the control region and the time interval. This method, known as the Region Reduction Strategy (RRS), employs the previous solution in its next iteration to obtain more accurate results. Moreover, the procedure will continue unless the control region becomes smaller than a prescribed value. The second approach is called Control Vector Parameterization (CVP) and appears to have a large number of advantages. In this approach, control action is generated in feedback form, i.e., a set of trial functions of the state variables... 

The optimal reactive power dispatch (ORPD) problem is formulated as a combinatorial optimization problem involving nonlinear objective Junction with multiple local minima. In this paper, as a new approach, different ant colony optimization (ACO) algorithms are applied to the reactive power dispatch problem. Ant system (AS), the firstly introduced ant colony optimization algorithm, and its direct successors, elitist ant system (EAS), rank-based ant system (ASrank) and max-min ant system (MMAS), are employed to solve the reactive power dispatch problem. To analyze the efficiency and effectiveness of these modern search algorithms, the proposed methods are applied to the IEEE 30-bus system and... 

In this paper, a new algorithm for solving the shortest loop design problem is presented. The shortest loop design problem is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. In this paper, first it is shown that this problem can be represented as a graph model. The properties of the presented model enable us to design a meta-heuristic based on ant colony system algorithm for solving the shortest loop design problem. Computational results show the efficiency of our algorithm in compare to the other techniques. © 2006 Elsevier Ltd. All rights reserved  

One of the organizations’ main concerns is to protect sensitive data in database systems, especially the ones outsourced to untrusted service providers. An effective solution for this issue is to employ database encryption methods. Among different encryption approaches, Bucket-based method has the advantage of balancing security and performance of database operations. However, generating false-positive results in executing queries is the main drawback of this method. On the other hand, multi-join queries are one of the most critical operations executed on these stored sensitive data. Hence, acceptable processing and response time in executing multi-join queries is required. In this paper, we... 

When the reservoir energy is too low for the well to flow, or the production rate desired is greater than the reservoir energy can deliver, using some kind of artificial lift method to provide the energy to bring the fluid to the surface, seems to be necessary. Continuous flow gas lift is one of the most common artificial lift methods widely used in the oil industry during which, at appropriate pressure, gas is injected in a suitable depth into the tubing to gasify the oil column, and thus assist the production. Each well has an optimal point at which it will produce the most oil. In ideal conditions, at which there is no limitation in the total amount of available gas, a sufficient amount... 

In this study, a multi-item economic order quantity model with shortage under vendor managed inventory policy in a single vendor single buyer supply chain is developed. This model explicitly includes warehouse capacity and delivery constraints, bounds order quantity, and limits the number of pallets. Not only the demands are considered imprecise, but also resources such as available storage and total order quantity of all items can be vaguely defined in different ways. An ant colony optimization is employed to find a near-optimum solution of the fuzzy nonlinear integer-programming problem with the objective of minimizing the total cost of the supply chain. Since no benchmark is available in... 

In presence of obstacles, inter-agent pulling actions must be bounded. In this case, to remain connected to the group, the leader-agent (LA) must perform an active leading strategy. In this paper, an active leading algorithm is proposed which monitors the neighborhood of the LA and adjusts its velocity. The algorithm is based on the ant colony optimization (ACO) technique. As a real time optimization package, the ACO algorithm maximizes influence of the LA on the group, leading to fast flocking. Comparison with another optimization method is provided as well. Simulations show that the algorithm is successful and cost effective  

Scaling analysis of fluid displacement in porous media is a reliable, fast method to evaluate the displacement performance of different oil production processes under various conditions. This paper presents the scaling studies of multiphase fluid flow through permeable media with a special attention to the three-phase immiscible water alternating gas (WAG) flooding under conditions prevailing in many oil reservoirs. The investigations are performed on a heterogeneous reservoir to study in detail the sensitivity of the displacement process to the scaling groups using various combinations of the process controlling parameters. The procedure of Inspectional analysis (IA) was utilized to... 

An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-allocation cost is minimized. Pipeline systems in natural gas network must be designed based on gas flow rate, length of pipe, gas maximum pressure drop allowance, and gas maximum velocity allowance. We use the information regarding gas flow rates and pipe diameter sizes considering the gas pressure and... 

This paper presents an evolutionary based approach to achieve optimal management of a coastal aquifer to control saltwater intrusion. An improved Elitist Continuous Ant Colony Optimization (ECACO) algorithm is employed for optimal control variables setting of coastal aquifer management problem. The objectives of the optimal management are; maximizing the total water-pumping rate, while controlling the drawdown limits and protecting the wells from saltwater intrusion. Since present work is one of the first efforts towards the application of an ECACO algorithm, sharp interface solution for steady state problem is first exploited. The performance of the developed optimization model is evaluated...