View in EDS

Evolutionary based heuristic for bin packing problem

Saved in:
Bibliographic Details
Title: Evolutionary based heuristic for bin packing problem
Authors: Stawowy, Adam1 astawowy@zarz.agh.edu.pl
Source: Computers & Industrial Engineering. Sep2008, Vol. 55 Issue 2, p465-474. 10p.
Subjects: Mathematical optimization, Operations research, Algorithms, Industrial engineering
Abstract: Abstract: In this paper, we investigate the use of evolutionary based heuristic to the one-dimensional bin packing problem (BPP). Unlike other evolutionary heuristics used with optimization problems, a non-specialized and non-hybridized algorithm is proposed and analyzed for solving BPP. The algorithm uses a modified permutation with separators encoding scheme, unique concept of separators’ movements during mutation, and separators removal as a technique of problem size reduction. The set of experiments confirmed that the proposed approach is comparable to much more complicated algorithms. [Copyright &y& Elsevier]
Copyright of Computers & Industrial Engineering is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 34087013
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Evolutionary based heuristic for bin packing problem
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Stawowy%2C+Adam%22">Stawowy, Adam</searchLink><relatesTo>1</relatesTo><i> astawowy@zarz.agh.edu.pl</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computers+%26+Industrial+Engineering%22">Computers & Industrial Engineering</searchLink>. Sep2008, Vol. 55 Issue 2, p465-474. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Operations+research%22">Operations research</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Industrial+engineering%22">Industrial engineering</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: In this paper, we investigate the use of evolutionary based heuristic to the one-dimensional bin packing problem (BPP). Unlike other evolutionary heuristics used with optimization problems, a non-specialized and non-hybridized algorithm is proposed and analyzed for solving BPP. The algorithm uses a modified permutation with separators encoding scheme, unique concept of separators’ movements during mutation, and separators removal as a technique of problem size reduction. The set of experiments confirmed that the proposed approach is comparable to much more complicated algorithms. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computers & Industrial Engineering is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=34087013
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.cie.2008.01.007
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 465
    Subjects:
      – SubjectFull: Mathematical optimization
        Type: general
      – SubjectFull: Operations research
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Industrial engineering
        Type: general
    Titles:
      – TitleFull: Evolutionary based heuristic for bin packing problem
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Stawowy, Adam
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 03608352
          Numbering:
            – Type: volume
              Value: 55
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Computers & Industrial Engineering
              Type: main
ResultId 1