Share This Article:

No Fit Polygon for Nesting Problem Solving with Hybridizing Ant Algorithms

HTML XML Download Download as PDF (Size:1098KB) PP. 433-439
DOI: 10.4236/jsea.2014.75040    5,540 Downloads   7,330 Views Citations
Author(s)

ABSTRACT

In design science, these two kinds of problems are mutually nested, however, the nesting could not blind us for the fact that their problem-solving and solution justification methods are different. The ant algorithms research field, builds on the idea that the study of the behavior of ant colonies or other social insects is interesting, because it provides models of distributed organization which could be utilized as a source of inspiration for the design of optimization and distributed control algorithms. In this paper, a relatively new type of hybridizing ant search algorithm is developed, and the results are compared against other algorithms. The intelligence of this heuristic approach is not portrayed by individual ants, but rather is expressed by the colony as a whole inspired by labor division and brood sorting. This solution obtained by this method will be evaluated against the one obtained by other traditional heuristics.

Cite this paper

Yang, Q. (2014) No Fit Polygon for Nesting Problem Solving with Hybridizing Ant Algorithms. Journal of Software Engineering and Applications, 7, 433-439. doi: 10.4236/jsea.2014.75040.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.