Sharif Digital Repository

In this paper, an algorithm based on ant colony optimization metaheuristic is proposed for finding solutions to the well-known graceful labeling problem of graphs. Despite the large number of papers published on the theory of this problem, there are few particular techniques introduced by researchers for gracefully labeling graphs. The proposed algorithm is applied to many classes of graphs, and the results obtained have proven satisfactory when compared to those of the existing methods in the literature  

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a metaheuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the best patterns. Also because of the problem framework, effective improvements has been made to problem solving process. The results of that algorithm in sample problems, show high efficiency of the algorithm in different levels of problems  

The one-dimensional cutting stock problem has many applications in industries and during the past few years has been one of the centers of attention among the researchers in the field of applied operations research. In this paper, a revised version of Ant Colony Optimization (ACO) technique is presented to solve this problem. This paper is a sequel to the previous ACO algorithm presented by the authors. In this algorithm, according to some probabilistic rules, artificial ants will select cutting patterns and generate a feasible solution. Computational results show the high efficiency and accuracy of the proposed algorithm for solving one- dimensional cutting stock problem  

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  

In this paper, an algorithm based on Ant Colony Optimization metaheuristic is proposed for finding solutions to the well-known graceful labeling problem of graphs. Despite the large number of papers published on the theory of this problem, there are few particular techniques introduced by researchers for gracefully labeling graphs. The proposed algorithm is applied to many classes of graphs, and the results obtained have proven satisfactory when compared to those of the existing methods in the literature. © 2007 IEEE  

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

This paper considers a preemptive multi-skilled resource constrained project scheduling problem in a just-in-time environment where each activity has an interval due date to be completed. In this problem setting, resuming a preempted activity requires an extra setup cost, while each time unit violation from the given due date incurs earliness or tardiness penalty. Also, processing cost of each skill to execute any activity depends on the assigned staff member to accomplish the skill. The objective function of the model aims to minimize the total cost of allocating staff to skills, earliness-tardiness penalties and preemption costs. Two integer formulations are proposed for the model which... 

The problem of aerodynamic shape optimization of unguided projectiles has been investigated. Two stochastic optimization methods have been applied to solve the problem. These include a Genetic Algorithm (GA) and the recently developed Continuous Ant Colony System (CACS), which is based on the well-known Ant Colony Optimization meta-heuristic. The objective function is defined as the summation of normal force coefficients over a set of given flight conditions. An engineering code (EC) is used to calculate the normal force coefficients over the flight conditions. The obtained results of CACS+EC are compared with those of GA+EC, as well as the results of a previous work (GA +AeroDesign). The... 

The purpose of this paper is to present a mixed-integer linear programming model for the scheduling problem in an open-shop manufacturing system involving reverse flows, where two job flows (direct and reverse) in two opposite directions are processed on the same machines. The aim is to minimize the maximum completion time of all jobs on all machines (i.e., the makespan). A numerical example is presented and solved using the GAMS software (version 25.1.2) to validate the proposed mathematical model. As this problem is NP-hard, a vibration damping-based optimization (VDO) algorithm is proposed to solve large-scale problems in reasonable execution times. Besides, the Taguchi experimental... 

Voltage source converter based multi - terminal DC grids (VSC - MTDC) are widely used for integration of renewable resources. Control of these grids requires vector control method, which includes inner and outer current controllers, tuning of these controllers is very important. Conventionally used tuning methods consider approximated linear model to tune the proportional - integral (PI) parameters of voltage source converter (VSC) which fails to produce optimum disturbance rejection results. In this research an Ant Colony Optimization (ACO) technique is used to get the optimum parameters of inner and outer power control layers for multi - terminal DC system. ACO is applied simultaneously on... 

The purpose of this paper is to present a mixed-integer linear programming model for the scheduling problem in an open-shop manufacturing system involving reverse flows, where two job flows (direct and reverse) in two opposite directions are processed on the same machines. The aim is to minimize the maximum completion time of all jobs on all machines (i.e., the makespan). A numerical example is presented and solved using the GAMS software (version 25.1.2) to validate the proposed mathematical model. As this problem is NP-hard, a vibration damping-based optimization (VDO) algorithm is proposed to solve large-scale problems in reasonable execution times. Besides, the Taguchi experimental... 

Voltage source converter based multi - terminal DC grids (VSC - MTDC) are widely used for integration of renewable resources. Control of these grids requires vector control method, which includes inner and outer current controllers, tuning of these controllers is very important. Conventionally used tuning methods consider approximated linear model to tune the proportional - integral (PI) parameters of voltage source converter (VSC) which fails to produce optimum disturbance rejection results. In this research an Ant Colony Optimization (ACO) technique is used to get the optimum parameters of inner and outer power control layers for multi - terminal DC system. ACO is applied simultaneously on... 

Ant colony optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperate in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to max-min ant system structure and exploits a local search heuristic to improve its performance. Experimental results on DIMACS test instances show improvements over existing ACO algorithms of the graph coloring problem  

Cycle bases have many applications in science and engineering. In this paper, an ant colony system algorithm is developed to generate a cycle basis that is simultaneously subminimal and suboptimal. Such a basis is called a subminimal-suboptimal cycle basis. Examples are included to illustrate the efficiency of ACS algorithm  

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

Ant Colony Optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperate in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to Max-Min Ant System structure and exploits a local search heuristic to improve its performance. Experimental results on DIMACS test instances show improvements over existing ACO algorithms of the graph coloring problem  

The well-known ant colony optimization meta-heuristic is applied to design a new command to line-of-sight guidance law. In this regard, the lately developed continuous ant colony system is used to optimize the parameters of a pre-constructed fuzzy sliding mode controller. The performance of the resulting guidance law is evaluated at different engagement scenarios. © Springer-Verlag Berlin Heidelberg 2005  

An accurate estimation of aquifer hydraulic parameters is required for groundwater modeling and proper management of vital groundwater resources. In situ measurements of aquifer hydraulic parameters are expensive and difficult. Traditionally, these parameters have been estimated by graphical methods that are approximate and time-consuming. As a result, nonlinear programming (NLP) techniques have been used extensively to estimate them. Despite the outperformance of NLP approaches over graphical methods, they tend to converge to local minima and typically suffer from a convergence problem. In this study, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) methods are used to identify... 

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