Next Article in Journal
Amplitude Noise Reduction in a Nano-Mechanical Oscillator
Previous Article in Journal
Numerical Approach of High-Order Linear Delay Difference Equations with Variable Coefficients in Terms of Laguerre Polynomials
Article Menu

Article Versions

Export Article

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Articles in this Volume were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence. Articles are hosted by MDPI on as a courtesy and upon agreement with the previous journal publisher.
Open AccessArticle
Math. Comput. Appl. 2011, 16(1), 279-289; doi:10.3390/mca16010279

An Extended Heuristic Algorithm to Settle Reacting Objects on a Planar Surface

Ege University, International Computer Institute, Izmir, Turkey
Ege University, Mathematics Department, Applied Mathematics, Izmir, Turkey
Islamic Azad University, Shabestar Branch, Iran
Ege University, Mathematics Department, Computer Science, Izmir, Turkey
Authors to whom correspondence should be addressed.
Published: 1 April 2011
Download PDF [440 KB, uploaded 6 April 2016]


Graph theory is a key subject for both mathematics and computer science. It is used for modelling many problems such as maximal independent set, minimum covering and matching. In our study, we have extended the previous work on placing materials that may react with each other on a 2-D warehouse. We have modelled the problem using graph theory. Then, we have developed extensions on the heuristic algorithm which is using Paull-Unger method that finds Maximal Independent Sets. First two of these extensions include finding solutions with gaps for specific graphs, and meanwhile capability of performing replacement in any desired rectangle surface. The last and most effective extension is pruning unnecessary backtracking steps with the help of smarter heuristics in the algorithm.
Keywords: Graph Theory; Independent Set Problem; Storage Problem; Heuristic Algorithms Graph Theory; Independent Set Problem; Storage Problem; Heuristic Algorithms
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Tokatli, G.; Dundar, P.; Challenger, M.; Turaci, T. An Extended Heuristic Algorithm to Settle Reacting Objects on a Planar Surface. Math. Comput. Appl. 2011, 16, 279-289.

Show more citation formats Show less citations formats

Article Metrics

Article Access Statistics



[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top