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
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
MCA
Volume 16
Issue 1
10.3390/mca16010279
mca-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

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

by
Gorkem Tokatli
1,*,
Pinar Dundar
2,*,
Moharram Challenger
1,3,* and
Tufan Turaci
4,*
1
Ege University, International Computer Institute, Izmir, Turkey
2
Ege University, Mathematics Department, Applied Mathematics, Izmir, Turkey
3
Islamic Azad University, Shabestar Branch, Iran
4
Ege University, Mathematics Department, Computer Science, Izmir, Turkey
*
Authors to whom correspondence should be addressed.
Math. Comput. Appl. 2011, 16(1), 279-289; https://doi.org/10.3390/mca16010279
Published: 1 April 2011
Versions Notes

Abstract

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

Share and Cite

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. https://doi.org/10.3390/mca16010279

AMA Style

Tokatli G, Dundar P, Challenger M, Turaci T. An Extended Heuristic Algorithm to Settle Reacting Objects on a Planar Surface. Mathematical and Computational Applications. 2011; 16(1):279-289. https://doi.org/10.3390/mca16010279

Chicago/Turabian Style

Tokatli, Gorkem, Pinar Dundar, Moharram Challenger, and Tufan Turaci. 2011. "An Extended Heuristic Algorithm to Settle Reacting Objects on a Planar Surface" Mathematical and Computational Applications 16, no. 1: 279-289. https://doi.org/10.3390/mca16010279

APA Style

Tokatli, G., Dundar, P., Challenger, M., & Turaci, T. (2011). An Extended Heuristic Algorithm to Settle Reacting Objects on a Planar Surface. Mathematical and Computational Applications, 16(1), 279-289. https://doi.org/10.3390/mca16010279

Article Metrics

Back to TopTop