Journals / Mathematical and Computational Applications / 2011 / Cilt: 16 - Sayı: 1

An extended heuristic algorithm to settle reacting objects on a planar surface

Pages
279–289
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The last and most effective extension is pruning unnecessary backtracking steps with the help of smarter heuristics in the algorithm.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Graph theory is a key subject for both mathematics and computer science.
📊
Key Findings & Data:In our study, we have extended the previous work on placing materials that may react with each other on a 2-D warehouse.
💡
Conclusion & Impact:The last and most effective extension is pruning unnecessary backtracking steps with the help of smarter heuristics in the algorithm.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

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.

Özet

Türkçe Öz Yok

🔖

Cite This Article

TOKATLI, G., DÜNDAR, P., CHALLENGER, M., TURACI, T. (2011). An extended heuristic algorithm to settle reacting objects on a planar surface. Mathematical and Computational Applications, Cilt: 16 - Sayı: 1, 279–289. https://ajindex.com/articles/279931

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (1)

  1. Christofides,N.,Graph Theory an Algorithmic Approach, Academic Pres, London, (1986). [2]West D.B., Introduction to Graph Theory, Prentice Hall, NJ, (2001). [3]Blidia M., Chellali M., Favaron O., Meddah N., Maximal k- independent sets in graphs. Discuss. Math. Graph Theory 28 (2008),no. 1,151 -163. [4]Chartrand G., Lesniak L., Graphs & Digraphs, Greg Hubit Bookworks, (1986). [5]Prather Ronald E., Discrete Mathematical Structures for Computer Science, Houghton Mifflin Company, (1976). [6]Coreman T., Leiserson C., Rivest R., Stein C., Introduction to Algorithms, 3rd Edition, The MIT Press, (2009). [7]Dundar P., Tokatli G., Challenger M., Turaci T., A Heuristic Algorithm for Placing Chemically Reacting Materials on a Platform, National Conference on Informatics, Mugla University, Turkey, 10-12 Feb 2010.