A HEURISTIC ALGORITHM BASED ON LINE-UP COMPETITION AND GENER-ALIZED PATTERN SEARCH FOR SOLVING INTEGER AND MIXED INTEGER NON-LINEAR OPTIMIZATION PROBLEMS

Authors

  • BEHROOZ SHAHRIARI DEPARTMENT OF MECHANICAL AND AEROSPACE ENGINEERING, MALEK-ASHTAR UNIVERSITY OF TECHNOLOGY,84145-115, ISFAHAN, IRAN. HTTP://ORCID.ORG/0000-0001-6262-946X
  • MOHAMMAD REZA KARAMOOZ RAVARI DEPARTMENT OF MECHANICAL ENGINEERING, GRADUATE UNIVERSITY OF ADVANCED TECHNOLOGY, 76311-33131, KERMAN, IRAN HTTP://ORCID.ORG/0000-0002-1372-3326
  • SHAHRAM YOUSEFI DEPARTMENT OF MECHANICAL AND AEROSPACE ENGINEERING, MALEK-ASHTAR UNIVERSITY OF TECHNOLOGY,84145-115, ISFAHAN, IRAN.
  • MAHDI TAJDARI DEPARTMENT OF MECHANICAL ENGINEERING, ISLAMIC AZAD UNIVERSITY, ARAK, IRAN

Keywords:

GLOBAL OPTIMIZATION, INTEGER OPTIMIZATION, MIXED INTEGER OPTIMIZATION, MULTI-MODAL PROBLEMS, CONSTRAINT OPTIMIZATION

Abstract

THE GLOBAL OPTIMIZATION OF INTEGER AND MIXED INTEGER NON-LINEAR PROBLEMS HAS A LOT OF APPLICATIONS IN ENGINEERING. IN THIS PAPER A HEURISTIC ALGORITHM IS DEVELOPED USING LINE-UP COMPETITION AND GENERALIZED PATTERN SEARCH TO SOLVE INTEGER AND MIXED INTEGER NONLINEAR OPTIMIZATION PROBLEMS SUBJECTED TO VARIOUS LINEAR OR NONLINEAR CONSTRAINTS. DUE TO ITS ABILITY TO FIND MORE THAN ONE LOCAL OR GLOBAL OPTIMAL POINTS, THE PROPOSED ALGORITHM IS MORE BENEFICIAL FOR MULTI-MODAL PROBLEMS. THE PERFORMANCE OF THIS ALGORITHM IS DEMONSTRATED THROUGH SEVERAL NON-CONVEX INTEGER AND MIXED INTEGER OPTIMIZATION PROBLEMS EXHIBITING GOOD AGREEMENT WITH THOSE REPORTED IN THE LITERATURE. IN ADDITION, THE CONVERGENCE TIME IS COMPARED WITH LCASÂ ONE DEMONSTRATING THE EFFICIENCY AND SPEED OF THE ALGORITHM. MEANWHILE, THE CONSTRAINTS ARE SATISFIED AFTER PASSING ONLY A FEW ITERATIONS.

Downloads

Published

2015-11-09

Issue

Vol. 13 No. 2 (2016)

Section

Articles

License

Authors who publish with this journal agree to the following terms:

 

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License [CC BY] that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).