scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Taboo Search Algorithm for Continuous Function Optimization

TL;DR: The Taboo search framework provides a simple and effective procedure for solving global optimization problems involving continuous functions and can be successfully used for large-scale process optimization.
Abstract: The Taboo search framework provides a simple and effective procedure for solving global optimization problems involving continuous functions. This novel algorithm handles both constrained and unconstrained functions very well and can be successfully used for large-scale process optimization.
Citations
More filters
Journal ArticleDOI
TL;DR: A version of TS, namely, enhanced continuous TS (ECTS), is tried for benchmark test functions having multiple minima and then evaluated for phase equilibrium calculations, showing that both TS and GA have high reliability in locating the global minimum, and that TS converges faster than GA thus reducing the computational time and number of function evaluations.

91 citations

Journal ArticleDOI
TL;DR: In this paper, the authors proposed a maintenance scheduling model for railway power supply system as a whole to meet both reliability and maintenance cost for a railway power-supply system as well as its functional complexity and demanding operation conditions.
Abstract: High reliability is the crucial requirement in railway operation and a power supply system is one of the key components of electrified railways. The cost-effectiveness of the maintenance works is also the concern of the railway operators while the time window on trackside maintenance is often limited. Maintenance scheduling is thus essential to uphold reliability and to reduce operation cost. It is however difficult to formulate the optimal schedule to meet both reliability and maintenance cost for a railway power supply system as a whole because of its functional complexity and demanding operation conditions. Maintenance scheduling models to achieve reliability and maintenance cost are proposed in this study. Optimisation algorithms are then developed to attain the solutions of the model. The applicability of the models and efficiency of the solution algorithms are demonstrated in an example. The proposed methods are vitally important for the railway engineers and operators to assure the service quality ...

29 citations


Cites methods from "Taboo Search Algorithm for Continuo..."

  • ...The extension of TS to continuous optimisation problems, called continuous tabu search (CTS), is investigated (Rajesh, Jayaraman, and Kulkarni 2000)....

    [...]

Journal ArticleDOI
TL;DR: The tests carried out for the LJ-MM algorithm proved its high performance for multi-modal problems with sharp peaks in particular and showed that it is the robust solver even in cases of problems with a smoother function.

28 citations

Dissertation
30 Jul 2012
TL;DR: In this article, a renormalization group analysis of the hierarchical model with fractal structures, representing the interaction structure of the stock traders, is applied to the study of the microscopic mechanisms of stock price movements.
Abstract: Financial market models are able to help the investors foresee the risk of a financial market crash and reduce the probability of its occurrence. Modelling in financial markets is categorized into microscopic models and macroscopic models. The microscopic models study the mechanisms behind the market and their behaviour. These models assist in an understanding of the causes of financial market crashes. Macroscopic models find the disciplines and rules from the historical macroscopic data for the prediction of market trends, directions and crashes. They aim to provide forecasts of when the crashes should occur. Except for large fluctuations, the stock market price or index movements can be characterized by a random walk. The stock price trajectory possesses the properties of self-similarity and scale invariance, and hence mimics fractals. Furthermore, the stock price movement is a manifestation of the actions and interactions of stock traders. The hierarchical model with fractal structures, representing the interaction structure of the stock traders, is applicable to the study of the microscopic mechanisms of stock price movements. In the language of statistical mechanics, stock market crashes are viewed as critical phenomena where a crash occurs only at the critical point with a phase transition. The renormalization group is a mathematical apparatus that allows the decomposition of a macroscopic problem viewed at different scales. The renormalization group analysis of the hierarchical model finds that the time to reach the critical point of a system is a function of the interaction degree of stock traders in a power law. Moreover, the hierarchical model with the renormalization group formalism shows that the behavior of the fraction of all stock traders putting buy orders over time follows a power law coupled with log-periodic oscillations. Based on the renormalization group analysis results of the hierarchical model, a log-periodic power law model is derived by constructing an renormalization group formalism from the risk-driven model. In the log-periodic power law model, the expected time to crash is always finite. Therefore, market crashes are inevitable, but the existence of bubbles and crash risks is foreseen by the model.

9 citations


Cites background from "Taboo Search Algorithm for Continuo..."

  • ...discrete functions, mix-integer problems, continuous functions, and graph theory problems [79, 54]....

    [...]

01 Jan 2012
TL;DR: The main intent of this report is to aid developers in the process of choosing an appropriate unit testing tool from categorization table of available tools with automation unit testing support that ease this process significantly.
Abstract: Unit testing is defined as a test activity usually performed by a developer for the purpose of demonstrating program functionality and meeting the requirements specification of module. Nowadays, unit testing is considered as an integral part in the software development cycle. However, performing unit testing by developers is still considered as a major concern because of the time and cost involved in it. Automation support for unit testing, in the form of various automation tools, could significantly lower the cost of performing unit testing phase as well as decrease the time developer involved in the actual testing. The problem is how to choose the most appropriate tool that will suit developer requirements consisting of cost involved, effort needed, level of automation provided, language support, etc. This research work presents results from a systematic literature review with the aim of finding all unit testing tools with an automation support. In the systematic literature review, we initially identified 1957 studies. After performing several removal stages, 112 primary studies were listed and 24 tools identified in total. Along with the list of tools, we also provide the categorization of all the tools found based on the programming language support, availability (License, Open source, Free), testing technique, level of effort required by developer to use tool, target domain, that we consider as good properties for a developer to make a decision on which tool to use. Additionally, we categorized type of error(s) found by some tools, which could be beneficial for a developer when looking at the tool’s effectiveness. The main intent of this report is to aid developers in the process of choosing an appropriate unit testing tool from categorization table of available tools with automation unit testing support that ease this process significantly. This work could be beneficial for researchers considering to evaluate efficiency and effectiveness of each tool and use this information to eventually build a new tool with the same properties as several others.

3 citations

References
More filters
Journal ArticleDOI
TL;DR: Four key areas of Integer programming are examined from a framework that links the perspectives of artificial intelligence and operations research, and each has characteristics that appear usefully relevant to developments on the horizon.

3,985 citations

Book
01 Mar 1997
TL;DR: This chapter discusses the development of Optimization Theory and Methods for Process Design, and some of the techniques used in this work were new to the literature.
Abstract: 1. Introduction to Process Design. I. PRELIMINARY ANALYSIS AND EVALUATION OF PROCESSES. 2. Overview of Flowsheet Synthesis. 3. Mass and Energy Balances. 4. Equipment Sizing and Costing. 5. Economic Evaluation. 6. Design and Scheduling of Batch Processes. II. ANALYSIS WITH RIGOROUS PROCESS MODELS. 7. Unit Equation Models. 8. General Concepts of Simulation for Process Design. 9. Process Flowsheet Optimization. III. BASIC CONCEPTS IN PROCESS SYNTHESIS. 10. Heat and Power Integration. 11. Ideal Distillation Systems. 12. Heat Integrated Distillation Processes. 13. Geometric Techniques for the Synthesis of Reactor Networks. 14. Separating Azeotropic Mixtures. IV. OPTIMIZATION APPROACHES TO PROCESS SYNTHESIS AND DESIGN. 15. Basic Concepts for Algorithmic Methods. 16. Synthesis of Heat Exchanger Networks. 17. Synthesis of Distillation Sequences. 18. Simultaneous Optimization and Heat Integration. 19. Optimization Techniques for Reactor Network Synthesis. 20. Structural Optimization of Process Flowsheets. 21. Process Flexibility. 22. Optimal Design and Scheduling for Multiproduct Batch Plants. References. Exercises. Appendix A.: Summary of Optimization Theory and Methods. Appendix B.: Smooth Approximations for max { 0, f(x)}. Appendix C.: Computer Tools for Preliminary Process Design. Author Index. Subject Index.

1,105 citations

Book ChapterDOI
TL;DR: It is shown empirically that the new evolution strategy based on Cauchy mutation outperforms the classical evolution strategy on most of the 23 benchmark problems tested in this paper.
Abstract: Evolution strategies are a class of general optimisation algorithms which are applicable to functions that are multimodal, non-differentiable, or even discontinuous. Although recombination operators have been introduced into evolution strategies, their primary search operator is still mutation. Classical evolution strategies rely on Gaussian mutations. A new mutation operator based on the Cauchy distribution is proposed in this paper. It is shown empirically that the new evolution strategy based on Cauchy mutation outperforms the classical evolution strategy on most of the 23 benchmark problems tested in this paper. These results, along with those obtained by fast evolutionary programming

573 citations

Journal ArticleDOI
03 Feb 1995-Science
TL;DR: In this article, a method based on Glover's taboo search for discrete functions is proposed for solving the multiple minima problem for continuous functions, which avoids entrapment in local minima and continues the search to give a near-optimal final solution.
Abstract: Described here is a method, based on Glover's taboo search for discrete functions, of solving the multiple minima problem for continuous functions. As demonstrated by model calculations, the algorithm avoids entrapment in local minima and continues the search to give a near-optimal final solution. Unlike other methods of global optimization, this procedure is generally applicable, easy to implement, derivative-free, and conceptually simple.

378 citations

Journal ArticleDOI
TL;DR: A new approach for global optimum search is presented in this paper which involves a decomposition of the variable set into two sets—complicating and noncomplicating variables, which results in a decomposing of the constraint set leading to two subproblems.

201 citations