View in EDS HTML Full Text PDF Full Text

Cost minimizing planning of container inspection and repair in multiple facilities.

Saved in:
Bibliographic Details
Title: Cost minimizing planning of container inspection and repair in multiple facilities.
Authors: Kovalyov, Mikhail Y.1 (AUTHOR), Lukashevich, Mikhail N.2,3 (AUTHOR), Pesch, Erwin3 (AUTHOR) erwin.pesch@uni-siegen.de
Source: OR Spectrum. Mar2023, Vol. 45 Issue 1, p181-204. 24p.
Subjects: Containers, Repairing, Shipping containers, Linear programming
Abstract: A problem of optimal mid-term or long-term planning of inspection and repair of freight containers in multiple facilities is introduced and investigated. The containers are of different types and quality levels, which define their repair costs and workforce requirements. The objective function includes the total holding, inspection, repair, transportation and rejection costs. We propose a deterministic, time-dependent, integer linear min-cost multi-commodity network-flow formulation. The problem is shown to be polynomially solvable if there is a single facility, a single time period and all the containers are repairable and have to be repaired. It is shown to be NP-hard for three important special cases. The computational results of our experiments on randomly generated instances based on real data show that instances of sizes 3 facilities, 4 container types and up to 9 container quality levels can be solved with CPLEX in 5 minutes on a conventional PC, even for 30 periods, with an optimality gap of less than 3%. This is sufficient for medium-term or weekly planning or for short-term recovery planning. However, there are instances of the same magnitude, but with 360 periods of a considerably longer planning horizon, for which an optimality gap of 28% remained even after 10 hours of CPLEX computation. [ABSTRACT FROM AUTHOR]
Copyright of OR Spectrum 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
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 161854884
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Cost minimizing planning of container inspection and repair in multiple facilities.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kovalyov%2C+Mikhail+Y%2E%22">Kovalyov, Mikhail Y.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Lukashevich%2C+Mikhail+N%2E%22">Lukashevich, Mikhail N.</searchLink><relatesTo>2,3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Pesch%2C+Erwin%22">Pesch, Erwin</searchLink><relatesTo>3</relatesTo> (AUTHOR)<i> erwin.pesch@uni-siegen.de</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22OR+Spectrum%22">OR Spectrum</searchLink>. Mar2023, Vol. 45 Issue 1, p181-204. 24p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Containers%22">Containers</searchLink><br /><searchLink fieldCode="DE" term="%22Repairing%22">Repairing</searchLink><br /><searchLink fieldCode="DE" term="%22Shipping+containers%22">Shipping containers</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+programming%22">Linear programming</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A problem of optimal mid-term or long-term planning of inspection and repair of freight containers in multiple facilities is introduced and investigated. The containers are of different types and quality levels, which define their repair costs and workforce requirements. The objective function includes the total holding, inspection, repair, transportation and rejection costs. We propose a deterministic, time-dependent, integer linear min-cost multi-commodity network-flow formulation. The problem is shown to be polynomially solvable if there is a single facility, a single time period and all the containers are repairable and have to be repaired. It is shown to be NP-hard for three important special cases. The computational results of our experiments on randomly generated instances based on real data show that instances of sizes 3 facilities, 4 container types and up to 9 container quality levels can be solved with CPLEX in 5 minutes on a conventional PC, even for 30 periods, with an optimality gap of less than 3%. This is sufficient for medium-term or weekly planning or for short-term recovery planning. However, there are instances of the same magnitude, but with 360 periods of a considerably longer planning horizon, for which an optimality gap of 28% remained even after 10 hours of CPLEX computation. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of OR Spectrum 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=161854884
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00291-022-00699-4
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 24
        StartPage: 181
    Subjects:
      – SubjectFull: Containers
        Type: general
      – SubjectFull: Repairing
        Type: general
      – SubjectFull: Shipping containers
        Type: general
      – SubjectFull: Linear programming
        Type: general
    Titles:
      – TitleFull: Cost minimizing planning of container inspection and repair in multiple facilities.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kovalyov, Mikhail Y.
      – PersonEntity:
          Name:
            NameFull: Lukashevich, Mikhail N.
      – PersonEntity:
          Name:
            NameFull: Pesch, Erwin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2023
              Type: published
              Y: 2023
          Identifiers:
            – Type: issn-print
              Value: 01716468
          Numbering:
            – Type: volume
              Value: 45
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: OR Spectrum
              Type: main
ResultId 1