• Title/Summary/Keyword: combinatorial search

Search Result 111, Processing Time 0.026 seconds

A Hybrid of Evolutionary Search and Local Heuristic Search for Combinatorial Optimization Problems

  • Park, Lae-Jeong;Park, Cheol-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.1 no.1
    • /
    • pp.6-12
    • /
    • 2001
  • Evolutionary algorithms(EAs) have been successfully applied to many combinatorial optimization problems of various engineering fields. Recently, some comparative studies of EAs with other stochastic search algorithms have, however, shown that they are similar to, or even are not comparable to other heuristic search. In this paper, a new hybrid evolutionary algorithm utilizing a new local heuristic search, for combinatorial optimization problems, is presented. The new intelligent local heuristic search is described, and the behavior of the hybrid search algorithm is investigated on two well-known problems: traveling salesman problems (TSPs), and quadratic assignment problems(QAPs). The results indicate that the proposed hybrid is able to produce solutions of high quality compared with some of evolutionary and simulated annealing.

  • PDF

Search for Phosphors for Use in Displays and Lightings using Heuristics-based Combinatorial Materials Science

  • Sharma, Asish Kumar;Sohn, Kee-Sun
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2009.10a
    • /
    • pp.207-210
    • /
    • 2009
  • According to the recent demand for materials for use in various displays and solid state lightings, new phosphors with improved performance have been pursued consistently. Multi objective genetic algorithm assisted combinatorial material search (MOGACMS) strategies have been applied to various multi-compositional inorganic systems to search for new phosphors and to optimize the properties of phosphors.

  • PDF

DEVELOPMENT OF A TABU SEARCH HEURISTIC FOR SOLVING MULTI-OBJECTIVE COMBINATORIAL PROBLEMS WITH APPLICATIONS TO CONSTRUCTING DISCRETE OPTIMAL DESIGNS

  • JOO SUNG JUNG;BONG JIN YUM
    • Management Science and Financial Engineering
    • /
    • v.3 no.1
    • /
    • pp.75-88
    • /
    • 1997
  • Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness.

  • PDF

Neighbor Generation Strategies of Local Search for Permutation-based Combinatorial Optimization

  • Hwang, Junha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.10
    • /
    • pp.27-35
    • /
    • 2021
  • Local search has been used to solve various combinatorial optimization problems. One of the most important factors in local search is the method of generating a neighbor solution. In this paper, we propose neighbor generation strategies of local search for permutation-based combinatorial optimization, and compare the performance of each strategies targeting the traveling salesman problem. In this paper, we propose a total of 10 neighbor generation strategies. Basically, we propose 4 new strategies such as Rotation in addition to the 4 strategies such as Swap which have been widely used in the past. In addition, there are Combined1 and Combined2, which are made by combining basic neighbor generation strategies. The experiment was performed by applying the basic local search, but changing only the neighbor generation strategy. As a result of the experiment, it was confirmed that the performance difference is large according to the neighbor generation strategy, and also confirmed that the performance of Combined2 is the best. In addition, it was confirmed that Combined2 shows better performance than the existing local search methods.

Profit-based Thermal Unit Maintenance Scheduling under Price Volatility by Reactive Tabu Search

  • Sugimoto Junjiro;Yokoyama Ryuichi
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.4
    • /
    • pp.331-338
    • /
    • 2005
  • In this paper, an improved maintenance scheduling approach suitable for the competitive environment is proposed by taking account of profits and costs of generation companies and the formulated combinatorial optimization problem is solved by using Reactive Tabu search (RTS). In competitive power markets, electricity prices are determined by the balance between demand and supply through electric power exchanges or by bilateral contracts. Therefore, in decision makings, it is essential for system operation planners and market participants to take the volatility of electricity price into consideration. In the proposed maintenance scheduling approach, firstly, electricity prices over the targeted period are forecasted based on Artificial Neural Network (ANN) and also a newly proposed aggregated bidding curve. Secondary, the maintenance scheduling is formulated as a combinatorial optimization problem with a novel objective function by which the most profitable maintenance schedule would be attained. As an objective function, Opportunity Loss by Maintenance (OLM) is adopted to maximize the profit of generation companies (GENCOS). Thirdly, the combinatorial optimization maintenance scheduling problem is solved by using Reactive Tabu Search in the light of the objective functions and forecasted electricity prices. Finally, the proposed maintenance scheduling is applied to a practical test power system to verify the advantages and practicability of the proposed method.

Minimum-weight design of non-linear steel frames using combinatorial optimization algorithms

  • Hayalioglu, M.S.;Degertekin, S.O.
    • Steel and Composite Structures
    • /
    • v.7 no.3
    • /
    • pp.201-217
    • /
    • 2007
  • Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem

  • Eddaly, Mansour;Jarboui, Bassem;Siarry, Patrick
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.4
    • /
    • pp.295-311
    • /
    • 2016
  • This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem.

SA-selection-based Genetic Algorithm for the Design of Fuzzy Controller

  • Han Chang-Wook;Park Jung-Il
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.2
    • /
    • pp.236-243
    • /
    • 2005
  • This paper presents a new stochastic approach for solving combinatorial optimization problems by using a new selection method, i.e. SA-selection, in genetic algorithm (GA). This approach combines GA with simulated annealing (SA) to improve the performance of GA. GA and SA have complementary strengths and weaknesses. While GA explores the search space by means of population of search points, it suffers from poor convergence properties. SA, by contrast, has good convergence properties, but it cannot explore the search space by means of population. However, SA does employ a completely local selection strategy where the current candidate and the new modification are evaluated and compared. To verify the effectiveness of the proposed method, the optimization of a fuzzy controller for balancing an inverted pendulum on a cart is considered.

Hybrid Genetic Algorithm Reinforced by Fuzzy Logic Controller (퍼지로직제어에 의해 강화된 혼합유전 알고리듬)

  • Yun, Young-Su
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.1
    • /
    • pp.76-86
    • /
    • 2002
  • In this paper, we suggest a hybrid genetic algorithm reinforced by a fuzzy logic controller (flc-HGA) to overcome weaknesses of conventional genetic algorithms: the problem of parameter fine-tuning, the lack of local search ability, and the convergence speed in searching process. In the proposed flc-HGA, a fuzzy logic controller is used to adaptively regulate the fine-tuning structure of genetic algorithm (GA) parameters and a local search technique is applied to find a better solution in GA loop. In numerical examples, we apply the proposed algorithm to a simple test problem and two complex combinatorial optimization problems. Experiment results show that the proposed algorithm outperforms conventional GAs and heuristics.

Heuristic Search in Overcurrent Protection Coordination of Power Distribution Systems (경험적 탐색에 의한 배전계통 보호기기 정정협조)

  • 이승재;박영문;이정원
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.2
    • /
    • pp.135-143
    • /
    • 1991
  • The setting problem of protective devices in power distribution systems is a combinatorial search problem involving a lot of trial & errors to search for a proper solution which has a great impact for the system reliability. This paper discusses the nature of the problem and proposes a scheme to prune the decision tree achieving the efficient search for a setting solution by applying heuristic rules which utilize pattern informations of backup and primary devices. Its effectiveness is demonstrated through many tests on real systems.

  • PDF