By Topic

A hybrid ant colony algorithm for the Cutting Stock Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jin Peng ; Key Lab. Process Optimization & Intell., Decision-making, Hefei Univ. of Technol., Hefei, China ; Zhang Shu Chu

This study presents a new hybrid ant colony algorithm (HACO) to solve an in integer linear programming formulation of the Cutting Stock Problem(CSP). The CSP is an important class combinatorial problem. It is appropriate to minimize the raw material used by industries for fulfilling customer's demands. In such cases, classic models for solving the cutting stock problem are useless. HACO consists of GDCP procedure and modified ACO (MACO). GDCP procedure provides dominative cutting patterns as MACO solution components, in MACO the pheromone trail is put on cutting patterns instead of items. MACO preserves cutting patterns and frequencies information under ants building solution procedure. Results obtained from computational experiments for ten benchmarks demonstrate that the performance of MACO is compared to that obtained using existing mete-heuristic algorithm.

Published in:

Future Information Technology and Management Engineering (FITME), 2010 International Conference on  (Volume:2 )

Date of Conference:

9-10 Oct. 2010