Home About us Contact
|
Home About us Contact | ||
|
|
||
Heuristic Approach (heuristic + approach)
Selected AbstractsFourier Transformed Large Amplitude Square-Wave Voltammetry as an Alternative to Impedance Spectroscopy: Evaluation of Resistance, Capacitance and Electrode Kinetic Effects via an Heuristic ApproachELECTROANALYSIS, Issue 15-16 2005Abstract A detailed simulation of Fourier transformed large amplitude square-wave voltammetry is presented in the frequency domain for the process Red,Ox+e,. The simulation takes into account the influence of the electrode kinetics (Butler,Volmer model), uncompensated resistance (Ru) and double layer capacitance (Cdl). Of particular significance is the prediction that the even harmonic responses are only detected in the presence of quasi-reversibility or uncompensated resistance, and also are essentially devoid of charging current. In contrast, the DC and odd harmonic AC components exhibit much larger faradaic currents and also contain charging current. Conveniently, detailed analysis of the simulated DC and AC harmonic components reveals the presence of readily recognised patterns of behaviour with unique levels of sensitivity to electrode kinetics, Ru and Cdl, that facilitate quantitative analysis of these terms. These electrochemical parameters are generally calculated by small amplitude impedance spectroscopy and utilisation of linear analysis of equivalent circuits. Experimental studies on the one electron oxidation of ferrocene in dichloromethane (0.1,M Bu4NPF6) and the one electron reduction of [Fe(CN)6]3, in aqueous 0.5,M KCl electrolyte analysed via heuristic forms of data analysis based on recognition of patterns of behaviour, are presented as examples of a reversible process with significant uncompensated resistance and a quasi-reversible process with minimal ohmic drop, respectively. Results demonstrate the advantages of a more intuitively implemented form of data analysis than presently available with conventional forms of impedance spectroscopy. [source] A case of rule-based heuristics for scheduling hot rolling seamless steel tube productionEXPERT SYSTEMS, Issue 3 2006Jianxiang Li Abstract: A production scheduling problem for hot rolling seamless steel tube at Tianjin Pipe Corporation of China is studied. Considering the complexity of the problem and the acceptable time for solving it, a rule-based heuristic approach is proposed and implemented. The proposed approach is a bottleneck scheduling method and considers simultaneously all production processes in three production units and ,optimizes' them as a whole. Additionally, the running result shows, on average, that a 3% increase in throughput and a 5% reduction in late deliveries have been achieved since the system implementation. [source] Combining random forest and copula functions: A heuristic approach for selecting assets from a financial crisis perspectiveINTELLIGENT SYSTEMS IN ACCOUNTING, FINANCE & MANAGEMENT, Issue 2 2010Giovanni De Luca Abstract In this paper we propose a heuristic strategy aimed at selecting and analysing a set of financial assets, focusing attention on their multivariate tail dependence structure. The selection, obtained through an algorithmic procedure based on data mining tools, assumes the existence of a reference asset we are specifically interested to. The procedure allows one to opt for two alternatives: to prefer those assets exhibiting either a minimum lower tail dependence or a maximum upper tail dependence. The former could be a recommendable opportunity in a financial crisis period. For the selected assets, the tail dependence coefficients are estimated by means of a proper multivariate copula function. Copyright © 2010 John Wiley & Sons, Ltd. [source] A computer method based on simulated annealing to identify aquifer parameters using pumping-test dataINTERNATIONAL JOURNAL FOR NUMERICAL AND ANALYTICAL METHODS IN GEOMECHANICS, Issue 3 2008Yen-Chen Huang Abstract Conventional graphical or computer methods for identifying aquifer parameters have their own inevitable limitations. This paper proposes a computer method based on a drawdown model and a heuristic approach of simulated annealing (SA) to determine the best-fit aquifer parameters of the confined and unconfined aquifer systems. The drawdown model for the confined aquifer is the Theis solution and the unconfined aquifer is the Neuman solution. The estimated results of proposed method have better accuracy than those of the graphical methods and agree well with those of the computer methods based on the extended Kalman filter and Newton's method. Finally, the sensitivity analyses for the control parameters of SA indicate that the proposed method is very robust and stable in parameter identification procedures. Copyright © 2007 John Wiley & Sons, Ltd. [source] Power generation expansion planning with emission control: a nonlinear model and a GA-based heuristic approachINTERNATIONAL JOURNAL OF ENERGY RESEARCH, Issue 2 2006Jiraporn Sirikum Abstract This paper presents an application of genetic algorithms (GA) for solving the long-term power generation expansion planning (PGEP) problem, a highly constrained nonlinear discrete optimization problem. The problem is formulated into a mixed integer nonlinear programming (MINLP) program that determines the most economical investment plan for additional thermal power generating units over a planning horizon, subject to the requirements of power demands, power capacities, loss of load probability (LOLP) levels, locations, and environmental limitations. Computational results show that the GA-based heuristic method can solve the PGEP problem effectively and more efficiently at a significant saving in runtime, when compared with a commercial optimization package. Copyright © 2005 John Wiley & Sons, Ltd. [source] Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solutionINTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Issue 3 2009Rita Girão-Silva Abstract Modern multiservice network routing functionalities have to deal with multiple, heterogeneous and multifaceted Quality of Service (QoS) requirements. A heuristic approach devised to find "good" solutions to a hierarchical multiobjective alternative routing optimization problem in Multiprotocol Label Switching networks with two service classes (and different types of traffic flows in each class), namely QoS and Best Effort services, formulated within a hierarchical network-wide optimization framework, is presented. This heuristic solution is based on a bi-objective constrained shortest path model and is applied to a test network used in a benchmarking case study. An experimental study based on analytic and discrete event simulation results is presented, allowing for an assessment of the quality of results obtained with this new heuristic solution for various traffic matrices. A dynamic version of the routing method is formulated and its performance with the same case study network is analysed. [source] Understanding topological symmetry: A heuristic approach to its determinationJOURNAL OF COMPUTATIONAL CHEMISTRY, Issue 4 2008M. L. Contreras Abstract An algorithm based on heuristic rules for topological symmetry perception of organic structures having heteroatoms, multiple bonds, and any kind of cycle, and configuration, is presented. This algorithm identifies topological symmetry planes and sets of equivalent atoms in the structure, named symmetry atom groups (SAGs). This approach avoids both the need to explore the entire graph automorphism groups, and to encompass cycle determination, resulting in a very effective computer processing. Applications to several structures, some of them highly symmetrical such as dendrimers, are presented. © 2007 Wiley Periodicals, Inc. J Comput Chem, 2008 [source] Development of a Core Set from a Large Rice Collection using a Modified Heuristic Algorithm to Retain Maximum DiversityJOURNAL OF INTEGRATIVE PLANT BIOLOGY, Issue 12 2009Hun-Ki Chung Abstract A new heuristic approach was undertaken for the establishment of a core set for the diversity research of rice. As a result, 107 entries were selected from the 10 368 characterized accessions. The core set derived using this new approach provided a good representation of the characterized accessions present in the entire collection. No significant differences for the mean, range, standard deviation and coefficient of variation of each trait were observed between the core and existing collections. We also compared the diversity of core sets established using this Heuristic Core Collection (HCC) approach with those of core sets established using the conventional clustering methods. This modified heuristic algorithm can also be used to select genotype data with allelic richness and reduced redundancy, and to facilitate management and use of large collections of plant genetic resources in a more efficient way. [source] Enhancing molecular discovery using descriptor-free rearrangement clustering techniques for sparse data setsAICHE JOURNAL, Issue 2 2010Peter A. DiMaggio Jr. Abstract This article presents a descriptor-free method for estimating library compounds with desired properties from synthesizing and assaying minimal library space. The method works by identifying the optimal substituent ordering (i.e., the optimal encoding integer assignment to each functional group on every substituent site of molecular scaffold) based on a global pairwise difference metric intended to capture smoothness of the compound library. The reordering can be accomplished via a (i) mixed-integer linear programming (MILP) model, (ii) genetic algorithm based approach, or (iii) heuristic approach. We present performance comparisons between these techniques as well as an independent analysis of characteristics of the MILP model. Two sparsely sampled data matrices provided by Pfizer are analyzed to validate the proposed approach and we show that the rearrangement of these matrices leads to regular property landscapes which enable reliable property estimation/interpolation over the full library space. An iterative strategy for compound synthesis is also introduced that utilizes the results of the reordered data to direct the synthesis toward desirable compounds. We demonstrate in a simulated experiment using held out subsets of the data that the proposed iterative technique is effective in identifying compounds with desired physical properties. © 2009 American Institute of Chemical Engineers AIChE J, 2010 [source] A selective newsvendor approach to order managementNAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 8 2008Kevin Taaffe Abstract Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed-integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L-shaped method for two-stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise-linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state-of-the-art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 [source] A heuristic approach of calculating spray water flux needed to avert fire-induced runaway reactions,,PROCESS SAFETY PROGRESS, Issue 3 2006BChE (Honors), Dilip K. Das BSc (Honors), MSChE In general all reactions have some heat effects. When the ability of the equipment to remove the heat is exceeded by the heat generated by a reaction, a hazardous situation called a runaway reaction may take place. Sometimes the exothermicity of runaway reactions is so high that the size of an emergency vent becomes impractical to install. A water spray system can sometimes be used to avert a fire-induced runaway reaction. Because the water spray system has a finite activation time, insulation helps to prolong the time required to reach the decomposition temperature. This article concludes that the required water flux to avert the fire-induced runaway reaction may be conservatively estimated by adding the water flux necessary to maintain an unbroken water film on the external surface of the equipment and the water flux necessary to absorb the fire heat after allowing for the splash loss and the in-flight loss. When adequate spray water is used, the metal temperature of the insulation jacket cannot theoretically exceed the boiling point of water thereby ensuring the avoidance of fire-induced runaway reactions whose adjusted onset decomposition temperature exceeds 100 ° C. Fire-induced runaway reactions with lower onset temperature can also be avoided depending on the initial temperature of the contents, mass of the contents and equipment, insulation thickness, and fire duration, for example, but a detailed calculation including dynamic simulation is necessary and the burden of proof lies with the designer. The reliability of the spray water system must be maintained high to include its credit as an environmental factor defined according to NFPA 30 to avoid the fire-induced runaway reaction as a scenario. Although API RP 521 does not allow any credit for sprinkler water, it allows credit, unlike NFPA 30, for insulation thickness and thus a runaway reaction can be avoided by using insulation alone according to API RP 521. © 2006 American Institute of Chemical Engineers Process Saf Prog, 2006 [source] Comparison of two new approaches to variable ordering for binary decision diagramsQUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, Issue 3 2001L. M. Bartlett Abstract Fault tree analysis, FTA, is one of the most commonly used techniques for safety system analysis. There can be problems with the efficiency and accuracy of the approach when dealing with large tree structures. Recently the binary decision diagram (BDD) methodology has been introduced which significantly aids the analysis of the fault tree diagram. The approach has been shown to improve both the efficiency of determining the minimal cut sets of the fault tree, and also the accuracy of the calculation procedure used to quantify the top event parameters. To utilize the BDD technique the fault tree structure needs to be converted into the BDD format. Converting the fault tree is relatively straightforward but requires the basic events of the tree to be placed in an ordering. The ordering of the basic events is critical to the resulting size of the BDD, and ultimately affects the performance and benefits of this technique. There are a number of variable ordering heuristics in the literature, however the performance of each depends on the tree structure being analysed. These heuristic approaches do not yield a minimal BDD structure for all trees, some approaches generate orderings that are better for some trees but worse for others. Within this paper two approaches to the variable ordering problem have been discussed. The first is the pattern recognition approach of neural networks, which is used to select the best ordering heuristic for a given fault tree from a set of alternatives. The second examines a completely new heuristic approach of using the structural importance of a component to produce a ranked ordering. The merits of each are discussed and the results compared. Copyright © 2001 John Wiley & Sons, Ltd. [source] A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windowsNETWORKS: AN INTERNATIONAL JOURNAL, Issue 4 2009Eric Prescott-Gagnon Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance traveled. A large number of heuristic approaches for the VRPTW have been proposed in the literature. In this article, we present a large neighborhood search algorithm that takes advantage of the power of branch-and-price which is the leading methodology for the exact solution of the VRPTW. To ensure diversification during the search, this approach uses different procedures for defining the neighborhood explored at each iteration. Computational results on the Solomo's and the Gehring and Homberge's benchmark instances are reported. Compared to the best known methods, the proposed algorithm produces better solutions, especially on the largest instances where the number of vehicles used is significantly reduced. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009 [source] Real-Time Work Schedule Adjustment Decisions: An Investigation and EvaluationPRODUCTION AND OPERATIONS MANAGEMENT, Issue 4 2004Daesik Hur Service managers often find that available worker capacity does not match with actual demand during a given day. They then must attempt to modify the planned work schedule to improve service and increase profitability. This study, which defines such a setting as the real-time work schedule adjustment decision, proposes mathematical formulations of the real-time adjustment and develops efficient heuristic approaches for this decision. The study evaluates the relative effectiveness of these heuristics versus experienced service managers, investigates the effect of the degree of schedule adjustment on profitability, and assesses the effect of demand forecast update errors on the performance of the schedule adjustment efforts. First, the results indicate that the computer based heuristics achieve higher profit improvement than experienced managers. Second, there is a trade-off between schedule stability and profitability so that more extensive schedule revisions (efficiency first heuristics) generally result in higher profitability. However, the incremental return on schedule changes is diminishing. Third, we find that active adjustments of work schedules are beneficial as long as the direction of demand change is accurately identified. [source] Comparison of two new approaches to variable ordering for binary decision diagramsQUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, Issue 3 2001L. M. Bartlett Abstract Fault tree analysis, FTA, is one of the most commonly used techniques for safety system analysis. There can be problems with the efficiency and accuracy of the approach when dealing with large tree structures. Recently the binary decision diagram (BDD) methodology has been introduced which significantly aids the analysis of the fault tree diagram. The approach has been shown to improve both the efficiency of determining the minimal cut sets of the fault tree, and also the accuracy of the calculation procedure used to quantify the top event parameters. To utilize the BDD technique the fault tree structure needs to be converted into the BDD format. Converting the fault tree is relatively straightforward but requires the basic events of the tree to be placed in an ordering. The ordering of the basic events is critical to the resulting size of the BDD, and ultimately affects the performance and benefits of this technique. There are a number of variable ordering heuristics in the literature, however the performance of each depends on the tree structure being analysed. These heuristic approaches do not yield a minimal BDD structure for all trees, some approaches generate orderings that are better for some trees but worse for others. Within this paper two approaches to the variable ordering problem have been discussed. The first is the pattern recognition approach of neural networks, which is used to select the best ordering heuristic for a given fault tree from a set of alternatives. The second examines a completely new heuristic approach of using the structural importance of a component to produce a ranked ordering. The merits of each are discussed and the results compared. Copyright © 2001 John Wiley & Sons, Ltd. [source] Shifting adaptive landscapes: Progress and challenges in reconstructing early hominid environmentsAMERICAN JOURNAL OF PHYSICAL ANTHROPOLOGY, Issue S45 2007John D. Kingston Abstract Since Darwin situated humans in an evolutionary framework, much discussion has focused on environmental factors that may have shaped or influenced the course of human evolution. Developing adaptive or causal perspectives on the morphological and behavioral variability documented in the human fossil record requires establishing a comprehensive paleoenvironmental context. Reconstructing environments in the past, however, is a complex undertaking, requiring assimilation of diverse datasets of varying quality, scale, and relevance. In response to these difficulties, human evolution has traditionally been interpreted in a somewhat generalized framework, characterized primarily by increasing aridity and seasonality periodically punctuated by pulses or intervals of environmental change, inferred largely from global climatic records. Although these broad paradigms provide useful heuristic approaches for interpreting human evolution, the spatiotemporal resolution remains far too coarse to develop unambiguous causal links. This challenge has become more acute as the emerging paleoenvironmental evidence from equatorial Africa is revealing a complex pattern of habitat heterogeneity and persistent ecological flux throughout the interval of human evolution. In addition, recent discoveries have revealed significant taxonomic diversity and substantially increased the geographic and temporal range of early hominids. These findings raise further questions regarding the role of the environment in mediating or directing the course of human evolution. As a consequence, it is imperative to critically assess the environmental criteria on which many theories and hypotheses of human evolution hinge. The goals here are to 1) compile, review, and evaluate relevant paleoecological datasets from equatorial Africa spanning the last 10 Ma, 2) develop a hierarchical perspective for developing and evaluating hypotheses linking paleoecology to patterns and processes in early hominid evolution, and 3) suggest a conceptual framework for modeling and interpreting environmental data relevant to human evolution in equatorial Africa. Yrbk Phys Anthropol 50:20,58, 2007. © 2007 Wiley-Liss, Inc. [source] Design and synthesis of separation process based on a hybrid methodASIA-PACIFIC JOURNAL OF CHEMICAL ENGINEERING, Issue 6 2009Chunshan Li Abstract A new general hybrid methodology for separation process synthesis and design is proposed, which considers different separation technologies by integrating mathematical modeling,Analytical Hierarchy Process (AHP) with heuristic approaches and thermodynamic insights. The methodology can provide suitable guidance for the initial separation process design and energy saving. Firstly, a general separation synthesis system based on thermodynamic insights is developed to select suitable separation techniques before sequencing, which reduces the complexity and size of synthesis search space. Then, the pseudo-component concept is proposed and used to deal with the azeotrope contained in the mixture, which widens the scope of the application of the proposed methodology. The AHP method is used to make a separation sequence by pairwise comparison matrices. Lastly, the separation of the pseudo-component will be considered, and it performs energy integration and a detailed process design. Application of the proposed methodology is highlighted through two industrial examples: one is the separation synthesis of a light-end refinery mixture. The other is azeotrope system, the mixture of phenol, o -cresol, p -cresol, and m -cresol. Copyright © 2009 Curtin University of Technology and John Wiley & Sons, Ltd. [source] | ||||||||||||||||||||||