Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

An adaptive meta-heuristic approach using partial optimization to non-convex polygons allocation 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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Takahara, S. ; Kagawa Prefectural Ind. Technol. Center, Japan ; Kusumoto, Y. ; Miyamoto, S.

We consider a two-dimensional packing problem of non-convex polygons of different shapes on a sheet. The problem is thus how to determine positions for placing objects such that the waste is minimized. In order to solve this problem, we propose an adaptive meta-heuristics using partial optimization. This partial optimization algorithm makes subgroups of objects. Moreover, theses groups and non-grouped objects are allocated using adaptive meta-heuristics. This partial optimization algorithm determines the groups dynamically; therefore meta-heuristic search efficiency is improved. The performance of the proposed method is tested using simulation experiments. The result shows that this method is superior to the case when adaptive meta-heuristics alone are used

Published in:

Fuzzy Systems, 2001. The 10th IEEE International Conference on  (Volume:3 )

Date of Conference: