An Extended Heuristic Algorithm to Settle Reacting Objects on a Planar Surface
AbstractGraph 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.
Scifeed alert for new publicationsNever 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
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.
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.Chicago/Turabian Style
Tokatli, Gorkem; Dundar, Pinar; Challenger, Moharram; Turaci, Tufan. 2011. "An Extended Heuristic Algorithm to Settle Reacting Objects on a Planar Surface." Math. Comput. Appl. 16, no. 1: 279-289.