File
Title Transcription
ニジゲン トリアワセ モンダイ ニ タイスル イデン アルゴリズム ノ テキヨウ
Title Alternative
A Genetic Algorithm for Solving 2-Dimensional Packing Problem
Authors
Keywords
Genetic Algorithms
Bin-Packing Ploblem
Abstract
This paper discribes a new approach to solve the two dimensional packing problem which is known as NP‐complete(Non‐deterministic Polynomial) problem of two dimensional geometory. We propose an approach applying Genetic Algorithms in order to guide a search process effectively and obtain a near- optimal allocation.
Genetic Algorithms are search algorithms based on the mechanics of survival and randomized information exchange Packing method is controlled by evaluation functions which describe the selecting a box and space allocation. Genetic operators are applied to bit strings and combined the weighted coefficients of evcaluation items.
Publisher
鳥取大学工学部
Content Type
Departmental Bulletin Paper
ISSN・ISBN
0385-8596
NCID
AN00174610
Journal Title
鳥取大学工学部研究報告
Current Journal Title
鳥取大学工学部研究報告
Volume
25
Issue
1
Start Page
209
End Page
215
Published Date
1994-11
Text Version
Publisher
Rights
注があるものを除き、この著作物は日本国著作権法により保護されています。 / This work is protected under Japanese Copyright Law unless otherwise noted.
Citation
鳥取大学工学部研究報告. 1995, 25(1), 209-215
Department
Faculty of Engineering/Graduate School of Engineering
Language
Japanese