• Title/Summary/Keyword: Optimization problem

Search Result 4,343, Processing Time 0.032 seconds

Solving the Team Orienteering Problem with Particle Swarm Optimization

  • Ai, The Jin;Pribadi, Jeffry Setyawan;Ariyono, Vincensius
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.3
    • /
    • pp.198-206
    • /
    • 2013
  • The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by $T_{max}$ that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score $S_i$. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time $t_{ij}$ needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.

A New Perspective to Stable Marriage Problem in Profit Maximization of Matrimonial Websites

  • Bhatnagar, Aniket;Gambhir, Varun;Thakur, Manish Kumar
    • Journal of Information Processing Systems
    • /
    • v.14 no.4
    • /
    • pp.961-979
    • /
    • 2018
  • For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

NSGA-II Technique for Multi-objective Generation Dispatch of Thermal Generators with Nonsmooth Fuel Cost Functions

  • Rajkumar, M.;Mahadevan, K.;Kannan, S.;Baskar, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.2
    • /
    • pp.423-432
    • /
    • 2014
  • Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is applied for solving Combined Economic Emission Dispatch (CEED) problem with valve-point loading of thermal generators. This CEED problem with valve-point loading is a nonlinear, constrained multi-objective optimization problem, with power balance and generator capacity constraints. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a nonsmooth optimization problem. To validate its effectiveness of NSGA-II, two benchmark test systems, IEEE 30-bus and IEEE 118-bus systems are considered. To compare the Pareto-front obtained using NSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Comparison with other optimization techniques showed the superiority of the NSGA-II approach and confirmed its potential for solving the CEED problem. Numerical results show that NSGA-II algorithm can provide Pareto-front in a single run with good diversity and convergence. An approach based on Technique for Ordering Preferences by Similarity to Ideal Solution (TOPSIS) is applied on non-dominated solutions obtained to determine Best Compromise Solution (BCS).

Shape Optimization of Cavitator for a Supercavitating Projectile Underwater (초공동(超空洞) 하의 수중 주행체 캐비데이터 형상최적설계)

  • Grandhli Ramana V.;Choi JooHo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.10
    • /
    • pp.1566-1573
    • /
    • 2004
  • When a projectile travels at high speed underwater, supercavitating flow arises, in which a huge cavity is generated behind the projectile so that only the nose, i.e., the cavitator, of the projectile is wetted, while the rest of it should be surrounded by the cavity. In that case, the projectile can achieve very high speed due to the reduced drag. Furthermore if the nose of the body is shaped properly, the attendant pressure drag can be maintained at a very low value, so that the overall drag is also reduced dramatically. In this study, shape optimization technique is employed to determine the optimum cavitator shape for minimum drag, given certain operating conditions. Shape optimization technique is also used to solve the potential flow problem fur any given cavitator, which is a free boundary value problem having the cavity shape as unknown a priori. Analytical sensitivities are derived for various shape parameters in order to implement a gradient-based optimization algorithm. Simultaneous optimization technique is proposed for efficient cavitator shape optimization, in which the cavity and cavitator shape are determined in a single optimization routine.

Topological optimized design considering dynamic problem with non-stochastic structural uncertainty

  • Lee, Dong-Kyu;Starossek, Uwe;Shin, Soo-Mi
    • Structural Engineering and Mechanics
    • /
    • v.36 no.1
    • /
    • pp.79-94
    • /
    • 2010
  • This study shows how uncertainties of data like material properties quantitatively have an influence on structural topology optimization results for dynamic problems, here such as both optimal topology and shape. In general, the data uncertainties may result in uncertainties of structural behaviors like deflection or stress in structural analyses. Therefore optimization solutions naturally depend on the uncertainties in structural behaviors, since structural behaviors estimated by the structural analysis method like FEM need to execute optimization procedures. In order to quantitatively estimate the effect of data uncertainties on topology optimization solutions of dynamic problems, a so-called interval analysis is utilized in this study, and it is a well-known non-stochastic approach for uncertainty estimate. Topology optimization is realized by using a typical SIMP method, and for dynamic problems the optimization seeks to maximize the first-order eigenfrequency subject to a given material limit like a volume. Numerical applications topologically optimizing dynamic wall structures with varied supports are studied to verify the non-stochastic interval analysis is also suitable to estimate topology optimization results with dynamic problems.

A Study on Improvement in the Resistance Performance of Planing hulls by Hull Shape Optimization (고속활주선의 선형 최적화를 통한 저항성능 개선에 관한 연구)

  • Kim, Sunbum
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.2
    • /
    • pp.83-90
    • /
    • 2018
  • This paper describes the method of hull shape optimization to improve the resistance performance of planing hulls when a reference hull shape and its principal dimensions are given. First, the planing hull of precedent research is adopted as the reference hull and an optimization problem is formulated by defining hull shape parameters. The search space of this research is discretized for computing cost and DPSO(Discrete binary version of Particle Swarm Optimization) method is used to solve the optimization problem. As the result of optimization, the decrease of resistance is confirmed from the comparison between the reference hull's and the modified hull's planing performance from computational results.

A multilevel framework for decomposition-based reliability shape and size optimization

  • Tamijani, Ali Y.;Mulani, Sameer B.;Kapania, Rakesh K.
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.4
    • /
    • pp.467-486
    • /
    • 2017
  • A method for decoupling reliability based design optimization problem into a set of deterministic optimization and performing a reliability analysis is described. The inner reliability analysis and the outer optimization are performed separately in a sequential manner. Since the outer optimizer must perform a large number of iterations to find the optimized shape and size of structure, the computational cost is very high. Therefore, during the course of this research, new multilevel reliability optimization methods are developed that divide the design domain into two sub-spaces to be employed in an iterative procedure: one of the shape design variables, and the other of the size design variables. In each iteration, the probability constraints are converted into equivalent deterministic constraints using reliability analysis and then implemented in the deterministic optimization problem. The framework is first tested on a short column with cross-sectional properties as design variables, the applied loads and the yield stress as random variables. In addition, two cases of curvilinearly stiffened panels subjected to uniform shear and compression in-plane loads, and two cases of curvilinearly stiffened panels subjected to shear and compression loads that vary in linear and quadratic manner are presented.

Reliability-Based Design Optimization of Slider Air Bearings

  • Yoon, Sang-Joon;Choi, Dong-Hoon
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.10
    • /
    • pp.1722-1729
    • /
    • 2004
  • This paper presents a design methodology for determining configurations of slider air bearings considering the randomness of the air-bearing surface (ABS) geometry by using the iSIGHT. A reliability-based design optimization (RBDO) problem is formulated to minimize the variations in the mean values of the flying heights from a target value while satisfying the desired probabilistic constraints keeping the pitch and roll angles within a suitable range. The reliability analysis is employed to estimate how the fabrication tolerances of individual slider parameters affect the final flying attitude tolerances. The proposed approach first solves the deterministic optimization problem. Then, beginning with this solution, the RBDO is continued with the reliability constraints affected by the random variables. Reliability constraints overriding the constraints of the deterministic optimization attempt to drive the design to a reliability solution with minimum increase in the objective. The simulation results of the RBDO are listed in comparison with the values of the initial design and the results of the deterministic optimization, respectively. To show the effectiveness of the proposed approach, the reliability analyses are simply carried out by using the mean value first-order second-moment (MVFO) method. The Monte Carlo simulation of the RBDO's results is also performed to estimate the efficiency of the proposed approach. Those results are demonstrated to satisfy all the desired probabilistic constraints, where the target reliability level for constraints is defined as 0.8.

Mathematical Proof for Structural Optimization with Equivalent Static Loads Transformed from Dynamic Loads (동하중에서 변환된 등가정하중에 의한 최적화 방법의 수학적 고찰)

  • Park, Gyung-Jin;Kang, Byung-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.2
    • /
    • pp.268-275
    • /
    • 2003
  • Generally, structural optimization is carried out based on external static loads. All forces have dynamic characteristics in the real world. Mathematical optimization with dynamic loads is extremely difficult in a large-scale problem due to the behaviors in the time domain. The dynamic loads are often transformed into static loads by dynamic factors, design codes, and etc. Therefore, the optimization results can give inaccurate solutions. Recently, a systematic transformation has been proposed as an engineering algorithm. Equivalent static loads are made to generate the same displacement field as the one from dynamic loads at each time step of dynamic analysis. Thus, many load cases are used as the multiple leading conditions which are not costly to include in modern structural optimization. In this research, it is mathematically proved that the solution of the algorithm satisfies the Karush-Kuhn-Tucker necessary condition. At first, the solution of the new algorithm is mathematically obtained. Using the termination criteria, it is proved that the solution satisfies the Karush-Kuhn-Tucker necessary condition of the original dynamic response optimization problem. The application of the algorithm is discussed.

Shape Optimization of Cavitator for a Supercavitating Projectile Underwater (초공동(超空洞) 하의 수중 주행체 캐비테이터 형상최적설계)

  • Choi, Joo-Ho;Grandhi, Ramana V.
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1876-1881
    • /
    • 2003
  • When a projectile travels at high speed underwater, supercavitating flow arises, in which a huge cavity is generated behind the projectile so that only the nose, i.e., the cavitator, of the projectile is wetted, while the rest of it should be surrounded by the cavity. In that case, the projectile can achieve very high speed due to the reduced drag. Furthermore if the nose of the body is shaped properly, the attendant pressure drag can be maintained at a very low value, so that the overall drag is also reduced dramatically. In this study, shape optimization technique is employed to determine the optimum cavitator shape for minimum drag, given certain operating conditions. Shape optimization technique is also used to solve the potential flow problem for any given cavitator, which is a free boundary value problem having the cavity shape as unknown a priori. Analytical sensitivities are derived for various shape parameters in order to implement a gradient-based optimization algorithm. Simultaneous optimization technique is proposed for efficient cavitator shape optimization, in which the cavity and cavitator shape are determined in a single optimization routine.

  • PDF