Sharif Digital Repository

In this paper, we consider the problem of Minimum-Cost Multicast (MCM) sub-graph optimization with network coding subject to uncertainty in link costs. A number of uncertainty sets such as ellipsoids and bounded polyhedral are taken into account. A robust optimization model is developed to obtain the optimal sub-graph by replacing an uncertain model of MCM by its Robust Counterpart (RC). Then, the analytic and computational optimization tools to obtain robust solutions of an uncertain MCM problem via solving the corresponding explicitly-stated convex RC program is developed and validated through simulations  

Routing methods and algorithms in "Wireless Sensor Networks" attract researchers' attention a lot recently. In order to find the optimal path in WSNs depending on their type and application, various algorithms are proposed. In this paper, an optimal path finding algorithm based on "Game Theory" is discussed and improved. This algorithm finds a path witch is optimizing network lifetime, load distribution, and path reliability simultaneously  

Presented is a novel approach for online trajectory modification of joint motions to transfer a free open kinematic chain, undergoing flight phase, from a specified initial configuration to a specified final configuration. Formally, it is assumed that a nominal trajectory, computed offline, can reorient the kinematic chain (reconfiguration problem) for a given angular momentum on a time interval. A modification algorithm of body joints, based on optimal control, is developed such that for different angular momentums and time intervals, the same reconfiguration problem can be solved online. This approach can be utilised for space robotics applications and online computation of planar running... 

This paper presents the scheduling optimisation of cargo trains by hybrid computer simulation (CS) and genetic algorithm. Scheduling cargo trains is based on the timetable of passenger trains that have priority in relation to cargo trains. System modelling is accomplished by Visual SLAM by considering time limitations, queue priority and limited station lines. Time limitations define that a cargo train is permitted to travel from station i to j if scheduled passenger trains have completed the travel from station i to j. Queue priority means that passenger trains have priority over cargo trains. In addition, each station has a limited storage track. In addition, all repair, maintenance,... 

In this paper, a "Game Theory" approach for finding an optimal path in a "Wireless Sensor Network" is discussed. WSN is one of the most interesting research fields in the communication networks, and is the center of attention in recent years. In our model, a pricing and payment technique is presented to obtain an optimal path in a WSN by considering reliability, energy and traffic load. The proposed algorithm is able to find a path which improves network lifetime, load distribution and path reliability  

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and... 

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and... 

The low-cycle fatigue performance of shear panel damper (SPD) highly depends on the geometry of its shape and the criterion considered for its design. The main contribution of the current study is to find the optimum shape of the SPD subjected to cyclic loading by considering two different objective functions. The maximum equivalent plastic strain and the ratio of energy dissipation through plastic deformation to the maximum equivalent plastic strain are selected as the first and second objective functions, respectively. Since the optimization procedure requires high computational efforts, a hybrid computational approach is used to perform two paramount phases of estimating the inelastic... 

Most of the reported robust and non-robust optimization works are formulated based on a single-objective optimization, commonly in terms of net present value. However, variation of economical parameters such as oil price and costs forces such high computational optimization works to regenerate their optimum water injection policies. Furthermore, dynamic optimization strategies of water-flooding often lack robustness to geological uncertainties. This paper presents a multi-objective while robust optimization methodology by incorporating three dedicated objective functions. The goal is to determine optimized and robust water injection policies for all injection wells. It focuses on reducing... 

Curing of thermoset-based composites experience substantial temperature overshoot, especially at the center of thick parts and large temperature gradient exists through the whole part due to large amount of heat released and low conductivity of the composite. This leads to non-uniformity of cure, residual stress and consequently composite cracks and possibly degradation of the polymer. The scope of this work is to optimize the cure cycle in order to improve the properties and gaining a relatively uniform part of composite, using trained recurrent artificial neural networks purposed for speeding up the repetitious model re-calls during the optimization process. Numerical results obtained... 

An algorithm for guiding a launch vehicle carrying a small satellite to a sun synchronous LEO is presented. Before the launch, a nominal path and the corresponding nominal control law for the entire journey are computed. For each sampling instant during the guided flight, a linear equation approximately relating the differences between the actual and nominal values is considered, and a LeastSquares formula using data from on-line state measurements is applied to compute the actual control. The coefficient matrices of the Least-Squares formula can be determined by off-line computations. The method enjoys simplicity of implementation by onboard computers, as well as robust accuracy against... 

Inverse dynamics analysis as well as the generation of an optimal goal oriented human motion both lead to the problem of finding suitable activations of the redundant muscles involved. This paper employs an iterative feedback tuning approach to perform the forward dynamics simulation of the human musculoskeletal system during level walking. A modified form of the proportional-integral-derivative (PID) controller is proposed to stabilize the movement and provide tracking of problems of the desired lower extremity joint profiles. Controller parameters were determined iteratively using an optimization algorithm to minimize tracking errors during forward dynamics simulation. Static optimization... 

In this paper, a non-cooperative distributed frequency selection algorithm is proposed for cognitive radio networks in which in addition to interference minimization, the minimization of implementation complexity and probability of interruption of secondary users are also addressed. The convergence and interference reduction property of the algorithm is also demonstrated using game theoretic concepts. In order to evaluate the performance of the algorithm, the associated optimization problem is formulated into a variant of graph colouring problem, and a centralized algorithm is also proposed as an approximation of the optimal solution. Finally, simulation results demonstrate that the proposed...