Browsing by Subject "Optimization criteria"

Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Investigation of multi-objective optimization criteria for RNA design
    (IEEE, 2017-12) Hampson, D. J. D.; Sav, Sinem; Tsang, H. H.
    RNA design is the inverse of RNA folding and it appears to be NP-hard. In RNA design, a secondary structure is given and the goal is to find a nucleotide sequence that will fold into this structure. To find such sequence(s) involves exploring the exponentially large sequence space. In literature, heuristic algorithms are the standard technique for tackling the RNA design. Heuristic algorithms enable effective and efficient exploration of the high-dimensional sequence-structure space when searching for candidates that fold into a given target structure. The main goal of this paper is to investigate the use of multi-objective criteria in SIMARD and Quality Pre-selection Strategy (QPS). The objectives that we optimize are Hamming distance (between designed structure and target structure) and thermodynamic free energy. We examine the different combinations of optimization criteria, and attempt to draw conclusions about the relationships between them. We find that energy is a poor primary objective but makes an excellent secondary objective. We also find that using multi-objective pre-selection produces viable solutions in far fewer steps than was previously possible with SIMARD. © 2016 IEEE.
  • Thumbnail Image
    ItemOpen Access
    Near-optimal modified base stock policies for the capacitated inventory problem with stochastic demand and fixed cost
    (World Scientific Publishing, 2014) Özener, O. Ö.; Güllü, R.; Erkip, N.
    In this study, we investigate a single-item, periodic-review inventory problem where the production capacity is limited and unmet demand is backordered. We assume that customer demand in each period is a stationary, discrete random variable. Linear holding and backorder cost are charged per unit at the end of a period. In addition to the variable cost charged per unit ordered, a positive fixed ordering cost is incurred with each order given. The optimization criterion is the minimization of the expected cost per period over a planning horizon. We investigate the infinite horizon problem by modeling the problem as a discrete-time Markov chain. We propose a heuristic for the problem based on a particular solution of this stationary model, and conduct a computational study on a set of instances, providing insight on the performance of the heuristic.