Two new heuristics for the equal piles problem
Two new heuristics for the equal piles problem
| dc.contributor.author | Singh, Alok | |
| dc.contributor.author | Gupta, Ashok K. | |
| dc.date.accessioned | 2022-03-27T05:50:36Z | |
| dc.date.available | 2022-03-27T05:50:36Z | |
| dc.date.issued | 2005-12-01 | |
| dc.description.abstract | Given n objects of various heights, the equal piles problem seeks an arrangement of these objects into k piles such that the heights of the resulting piles are as nearly equal as possible. In this paper we propose two new heuristics for this problem. One is a hybrid steady-state grouping genetic algorithm while the other is a perturbation based local search. Computational results demonstrate the effectiveness of our heuristics. Copyright © IICAI 2005. | |
| dc.identifier.citation | Proceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005 | |
| dc.identifier.uri | https://dspace.uohyd.ac.in/handle/1/8177 | |
| dc.title | Two new heuristics for the equal piles problem | |
| dc.type | Conference Proceeding. Conference Paper | |
| dspace.entity.type |
Files
License bundle
1 - 1 of 1