View in EDS

Optimizing the new coordinated replenishment and delivery model considering quantity discount and resource constraints.

Saved in:
Bibliographic Details
Title: Optimizing the new coordinated replenishment and delivery model considering quantity discount and resource constraints.
Authors: Liu, Rui1 rliuhust316@gmail.com, Zeng, Yu-Rong1,2 zyr@hbue.edu.cn, Qu, Hui3 qhui733@gmail.com, Wang, Lin1 wanglin@hust.edu.cn
Source: Computers & Industrial Engineering. Feb2018, Vol. 116, p82-96. 15p.
Subjects: Tabu search algorithm, Constraint satisfaction, Computational complexity, Problem solving, Heuristic algorithms, Quantity discounts
Abstract: Under a global purchasing environment, more and more companies have realized that considerable cost savings can be achieved through a coordinated replenishment and delivery (CRD) strategy. A new and practical CRD model with quantity discount (D-CRD) and its extension with constraints (CD-CRD) are proposed. Several important properties of the proposed D-CRD and CD-CRD policies are presented. A heuristic based on these properties and a hybrid Tabu search algorithm is designed to obtain satisfactory solutions for D-CRD and CD-CRD. Computational results demonstrate the effectiveness and efficiency of the algorithms. Although D-CRD is more efficient than CRD, resource constraints significantly weaken the effects of quantity discount strategy, especially for large-scale problems. Moreover, constraints in the coordinated stage are more sensitive than constraints in the delivery stage. [ABSTRACT FROM AUTHOR]
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: 127671601
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Optimizing the new coordinated replenishment and delivery model considering quantity discount and resource constraints.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Liu%2C+Rui%22">Liu, Rui</searchLink><relatesTo>1</relatesTo><i> rliuhust316@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Zeng%2C+Yu-Rong%22">Zeng, Yu-Rong</searchLink><relatesTo>1,2</relatesTo><i> zyr@hbue.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Qu%2C+Hui%22">Qu, Hui</searchLink><relatesTo>3</relatesTo><i> qhui733@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Wang%2C+Lin%22">Wang, Lin</searchLink><relatesTo>1</relatesTo><i> wanglin@hust.edu.cn</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computers+%26+Industrial+Engineering%22">Computers & Industrial Engineering</searchLink>. Feb2018, Vol. 116, p82-96. 15p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Tabu+search+algorithm%22">Tabu search algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22Constraint+satisfaction%22">Constraint satisfaction</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic+algorithms%22">Heuristic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Quantity+discounts%22">Quantity discounts</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Under a global purchasing environment, more and more companies have realized that considerable cost savings can be achieved through a coordinated replenishment and delivery (CRD) strategy. A new and practical CRD model with quantity discount (D-CRD) and its extension with constraints (CD-CRD) are proposed. Several important properties of the proposed D-CRD and CD-CRD policies are presented. A heuristic based on these properties and a hybrid Tabu search algorithm is designed to obtain satisfactory solutions for D-CRD and CD-CRD. Computational results demonstrate the effectiveness and efficiency of the algorithms. Although D-CRD is more efficient than CRD, resource constraints significantly weaken the effects of quantity discount strategy, especially for large-scale problems. Moreover, constraints in the coordinated stage are more sensitive than constraints in the delivery stage. [ABSTRACT FROM AUTHOR]
– 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=127671601
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.cie.2017.12.014
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 82
    Subjects:
      – SubjectFull: Tabu search algorithm
        Type: general
      – SubjectFull: Constraint satisfaction
        Type: general
      – SubjectFull: Computational complexity
        Type: general
      – SubjectFull: Problem solving
        Type: general
      – SubjectFull: Heuristic algorithms
        Type: general
      – SubjectFull: Quantity discounts
        Type: general
    Titles:
      – TitleFull: Optimizing the new coordinated replenishment and delivery model considering quantity discount and resource constraints.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Liu, Rui
      – PersonEntity:
          Name:
            NameFull: Zeng, Yu-Rong
      – PersonEntity:
          Name:
            NameFull: Qu, Hui
      – PersonEntity:
          Name:
            NameFull: Wang, Lin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 03608352
          Numbering:
            – Type: volume
              Value: 116
          Titles:
            – TitleFull: Computers & Industrial Engineering
              Type: main
ResultId 1