TITLE

Extension of the Firefly Algorithm and Preference Rules for Solving MINLP Problems

AUTHOR(S)
Costa, M. Fernanda P.; Francisco, Rogério B.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.
PUB. DATE
July 2017
SOURCE
AIP Conference Proceedings;2017, Vol. 1863 Issue 1, p1
SOURCE TYPE
Conference Proceeding
DOC. TYPE
Article
ABSTRACT
An extension of the firefly algorithm (FA) for solving mixed-integer nonlinear programming (MINLP) problems is presented. Although penalty functions are nowadays frequently used to handle integrality conditions and inequality and equality constraints, this paper proposes the implementation within the FA of a simple rounded-based heuristic and four preference rules to find and converge to MINLP feasible solutions. Preliminary numerical experiments are carried out to validate the proposed methodology.
ACCESSION #
124340201

 

Related Articles

  • AN APPROACH FOR THE OPTIMAL SOLUTION OF MILP PROBLEMS. Ubale, P. V. // Bulletin of Pure & Applied Sciences-Mathematics;Jul-Dec2012, Vol. 31E Issue 2, p169 

    This paper describes an algorithm for finding solutions to optimization problems in which some of the variables must take integer values. The solution of discrete optimization problem to optimality is often an immense job requiring very efficient algorithm. In this paper we describe a Branch and...

  • Dynamic Facility Location with Generalized Modular Capacities. Jena, Sanjay Dominik; Cordeau, Jean-François; Gendron, Bernard // Transportation Science;Aug2015, Vol. 49 Issue 3, p484 

    Location decisions are frequently subject to dynamic aspects such as changes in customer demand. Often, flexibility regarding the geographic location of facilities, as well as their capacities, is the only solution to such issues. Even when demand can be forecast, finding the optimal schedule...

  • A branch and bound method for the solution of multiparametric mixed integer linear programming problems. Oberdieck, Richard; Wittmann-Hohlbein, Martina; Pistikopoulos, Efstratios // Journal of Global Optimization;Jul2014, Vol. 59 Issue 2/3, p527 

    In this paper, we present a novel algorithm for the solution of multiparametric mixed integer linear programming (mp-MILP) problems that exhibit uncertain objective function coefficients and uncertain entries in the right-hand side constraint vector. The algorithmic procedure employs a branch...

  • Global optimization of general nonconvex problems with intermediate polynomial substructures. Zorn, Keith; Sahinidis, Nikolaos // Journal of Global Optimization;Jul2014, Vol. 59 Issue 2/3, p673 

    This work considers the global optimization of general nonconvex nonlinear and mixed-integer nonlinear programming problems with underlying polynomial substructures. We incorporate linear cutting planes inspired by reformulation-linearization techniques to produce tight subproblem formulations...

  • Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model. Brooks, J. Paul; Lee, Eva K. // INFORMS Journal on Computing;Summer2014, Vol. 26 Issue 3, p567 

    Solution methods are presented for a mixed-integer program (MIP) associated with a method for constrained discrimination. In constrained discrimination, one wishes to maximize the probability of correct classification subject to intergroup misclassification limits. The misclassification limits...

  • A MIP-based framework and its application on a lot sizing problem with setup carryover. Caserta, Marco; Voß, Stefan // Journal of Heuristics;Apr2013, Vol. 19 Issue 2, p295 

    In this paper we present a framework to tackle mixed integer programming problems based upon a 'constrained' black box approach. Given a MIP formulation, a black-box solver, and a set of incumbent solutions, we iteratively build corridors around such solutions by adding exogenous constraints to...

  • A Constraint Programming-based Genetic Algorithm (CPGA) for Capacity Output Optimization. Kate Ean Nee Goh; Jeng Feng Chin; Wei Ping Loh; Melissa Chea-Ling Tan // Journal of Industrial Engineering & Management;2014, Vol. 7 Issue 5, p1222 

    Purpose: The manuscript presents an investigation into a constraint programming-based genetic algorithm for capacity output optimization in a back-end semiconductor manufacturing company. Design/methodology/approach: In the first stage, constraint programming defining the relationships between...

  • Shift-and-Propagate. Berthold, Timo; Hendel, Gregor // Journal of Heuristics;Feb2015, Vol. 21 Issue 1, p73 

    In recent years, there has been a growing interest in the design of general purpose primal heuristics for use inside complete mixed integer programming solvers. Many of these heuristics rely on an optimal LP solution, which may take a significant amount of time to find. In this paper, we address...

  • Comparing mathematical and heuristic rules for solving single machine scheduling problem with release and due date constraints. Yong Zhan; Haitao Zhu; Yuguang Zhong // Applied Mechanics & Materials;2014, Issue 635-637, p1707 

    The purpose of this paper is to compare a mixed integer programming(MIP) model, and heuristic rules based on their practical efficiency and the accuracy of results to tackle the minimum lateness single machine scheduling problem with release and due date constraints. Extensive numerical...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics