View in EDS PDF Full Text

Dynamic storage assignment with product affinity and ABC classification-a case study.

Saved in:
Bibliographic Details
Title: Dynamic storage assignment with product affinity and ABC classification-a case study.
Authors: Li, Jiaxi1 li313@purdue.edu, Moghaddam, Mohsen1 mmoghadd@purdue.edu, Nof, Shimon1 nof@purdue.edu
Source: International Journal of Advanced Manufacturing Technology. Jun2016, Vol. 84 Issue 9-12, p2179-2194. 16p.
Subjects: Dynamic storage allocation (Computer science), Production (Economic theory), Process optimization, Genetic algorithms, Polynomial time algorithms
Abstract: This article defines a new dynamic storage assignment problem (DSAP) and develops an integrated mechanism for optimization purpose, based on the ABC classification and mutual affinity of products. A product affinity-based heuristic (PABH)-a technique based on data mining-is developed for calculation of pairwise relationships between products. It is shown that the analytical and multi-parametric DSAP is a quadratic assignment problem (QAP) and thus non-deterministic polynomial-time (NP)-hard. A greedy genetic algorithm (GA) is therefore developed for handling the computational complexity of the DSAP. Performance comparisons between the new approach and the traditional ABC classification method are conducted. The experimental results show that a preferred storage assignment approach is to simultaneously maximize the sum of affinity values and the product of zone indicators and order frequencies based on traditional ABC classification. The experiments on a distribution center of a family care product manufacturer indicate 7.14 to 104.48 % improvement in the average order picking time. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Advanced Manufacturing Technology is the property of Springer Nature 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 Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 115528433
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Dynamic storage assignment with product affinity and ABC classification-a case study.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Li%2C+Jiaxi%22">Li, Jiaxi</searchLink><relatesTo>1</relatesTo><i> li313@purdue.edu</i><br /><searchLink fieldCode="AR" term="%22Moghaddam%2C+Mohsen%22">Moghaddam, Mohsen</searchLink><relatesTo>1</relatesTo><i> mmoghadd@purdue.edu</i><br /><searchLink fieldCode="AR" term="%22Nof%2C+Shimon%22">Nof, Shimon</searchLink><relatesTo>1</relatesTo><i> nof@purdue.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Advanced+Manufacturing+Technology%22">International Journal of Advanced Manufacturing Technology</searchLink>. Jun2016, Vol. 84 Issue 9-12, p2179-2194. 16p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Dynamic+storage+allocation+%28Computer+science%29%22">Dynamic storage allocation (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Production+%28Economic+theory%29%22">Production (Economic theory)</searchLink><br /><searchLink fieldCode="DE" term="%22Process+optimization%22">Process optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Genetic+algorithms%22">Genetic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Polynomial+time+algorithms%22">Polynomial time algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This article defines a new dynamic storage assignment problem (DSAP) and develops an integrated mechanism for optimization purpose, based on the ABC classification and mutual affinity of products. A product affinity-based heuristic (PABH)-a technique based on data mining-is developed for calculation of pairwise relationships between products. It is shown that the analytical and multi-parametric DSAP is a quadratic assignment problem (QAP) and thus non-deterministic polynomial-time (NP)-hard. A greedy genetic algorithm (GA) is therefore developed for handling the computational complexity of the DSAP. Performance comparisons between the new approach and the traditional ABC classification method are conducted. The experimental results show that a preferred storage assignment approach is to simultaneously maximize the sum of affinity values and the product of zone indicators and order frequencies based on traditional ABC classification. The experiments on a distribution center of a family care product manufacturer indicate 7.14 to 104.48 % improvement in the average order picking time. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Advanced Manufacturing Technology is the property of Springer Nature 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=115528433
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00170-015-7806-7
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 16
        StartPage: 2179
    Subjects:
      – SubjectFull: Dynamic storage allocation (Computer science)
        Type: general
      – SubjectFull: Production (Economic theory)
        Type: general
      – SubjectFull: Process optimization
        Type: general
      – SubjectFull: Genetic algorithms
        Type: general
      – SubjectFull: Polynomial time algorithms
        Type: general
    Titles:
      – TitleFull: Dynamic storage assignment with product affinity and ABC classification-a case study.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Li, Jiaxi
      – PersonEntity:
          Name:
            NameFull: Moghaddam, Mohsen
      – PersonEntity:
          Name:
            NameFull: Nof, Shimon
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 02683768
          Numbering:
            – Type: volume
              Value: 84
            – Type: issue
              Value: 9-12
          Titles:
            – TitleFull: International Journal of Advanced Manufacturing Technology
              Type: main
ResultId 1