NDLI: Solving Irregular Rotational Knapsack Problems

Content Provider	IEEE Xplore Digital Library
Author	Martins, T.C. Tsuzuki, M.S.G.
Copyright Year	2007
Description	Author affiliation: Univ. of Sao Paulo, Sao Paulo (Martins, T.C.; Tsuzuki, M.S.G.)
Abstract	This work deals with the problem of minimize the waste of space that occurs on a placement of a set of bi-dimensional items inside a bi-dimensional container with fixed dimensions. This problem is approached with an heuristic based on Simulated Annealing (SA), which is inspired on the physic-chemical process that takes place during the recrystallization of a metal. Traditional "external penalization" techniques are avoided through the application of no-fit polygons, that represents collision-free areas for each items before its placement. That gives to the proposed process a more universal character, as external penalization is based on empiric parameters of great influence on the optimization performance. The SA controls: the rotation and the placement. For each non-placed items a limited depth binary search is performed to find a scale factor that when applied to the items, would allow it to be fitted on the container. The proposed process is suited for non-convex items and containers, and can be easily adapted for related problems, such as container size minimization. Some results are shown with irregular items, non-convex items and containers.
Starting Page	711
Ending Page	716
File Size	494808
Page Count	6
File Format	PDF
ISBN	9780769529769
DOI	10.1109/ISDA.2007.57
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-10-20
Publisher Place	Brazil
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Shape Simulated annealing Containers Cost function Space exploration Intelligent systems
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem

A hybrid heuristic for the 0–1 knapsack problem with items of irregular shape

Solving irregular rotational knapsack problems (2007).

Priority Encoding Scheme for Solving Permutation and Constraint Problems with Genetic Algorithms and Simulated Annealing

Solving Order Picking Problem Using Simulated Annealing Based Algorithms

Optimal simulated annealing schedules for larger problems

Solving strip-packing problem using sequence pair

Solving timetabling problems using genetic algorithms

Simulated annealing based fixed order controller design and system simulations

Solving Irregular Rotational Knapsack Problems

Similar Documents

Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem

A hybrid heuristic for the 0–1 knapsack problem with items of irregular shape

Solving irregular rotational knapsack problems (2007).

Priority Encoding Scheme for Solving Permutation and Constraint Problems with Genetic Algorithms and Simulated Annealing

Solving Order Picking Problem Using Simulated Annealing Based Algorithms

Optimal simulated annealing schedules for larger problems

Solving strip-packing problem using sequence pair

Solving timetabling problems using genetic algorithms

Simulated annealing based fixed order controller design and system simulations

Solving Irregular Rotational Knapsack Problems