An improved model and exact algorithm using local branching for the inventory-routing problem with time windows

The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the associated routing decisions. The IRP with time windows (IRPTW) considers time windows for the deliveries to the customers. Due to its importance and several real-world applications, in this paper, we develop...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research Jg. 61; H. 1; S. 49 - 64
Hauptverfasser: Demantova, Bruno E., Scarpin, Cassius T., Coelho, Leandro C., Darvish, Maryam
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Taylor & Francis 02.01.2023
Taylor & Francis LLC
Schlagworte:
Algorithms
exact methods
Inventory-routing
local branching
Optimization
time windows
valid inequalities
vehicle routing
Windows (intervals)
ISSN:0020-7543, 1366-588X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the associated routing decisions. The IRP with time windows (IRPTW) considers time windows for the deliveries to the customers. Due to its importance and several real-world applications, in this paper, we develop an intricate solution algorithm for this problem. A combination of tools ranging from established groups of valid inequalities, pre-processing techniques, local search procedures, and a local branching algorithm is utilised to solve the IRPTW efficiently. We compare the performance of our algorithm on a benchmark set of instances and show how our solution algorithm provides promising results against a competing algorithm from the literature. Moreover, the results of our study provide an overview of the performance of several already proposed techniques and their integration in the literature.
AbstractList The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the associated routing decisions. The IRP with time windows (IRPTW) considers time windows for the deliveries to the customers. Due to its importance and several real-world applications, in this paper, we develop an intricate solution algorithm for this problem. A combination of tools ranging from established groups of valid inequalities, pre-processing techniques, local search procedures, and a local branching algorithm is utilised to solve the IRPTW efficiently. We compare the performance of our algorithm on a benchmark set of instances and show how our solution algorithm provides promising results against a competing algorithm from the literature. Moreover, the results of our study provide an overview of the performance of several already proposed techniques and their integration in the literature.
Author Coelho, Leandro C.
Scarpin, Cassius T.
Darvish, Maryam
Demantova, Bruno E.
Author_xml – sequence: 1
  givenname: Bruno E.
  surname: Demantova
  fullname: Demantova, Bruno E.
  organization: Federal University of Paraná
– sequence: 2
  givenname: Cassius T.
  surname: Scarpin
  fullname: Scarpin, Cassius T.
  organization: Federal University of Paraná
– sequence: 3
  givenname: Leandro C.
  orcidid: 0000-0002-9797-1019
  surname: Coelho
  fullname: Coelho, Leandro C.
  organization: Université Laval
– sequence: 4
  givenname: Maryam
  orcidid: 0000-0002-0929-4864
  surname: Darvish
  fullname: Darvish, Maryam
  email: maryam.darvish@fsa.ulaval.ca
  organization: Université Laval
BookMark eNqFkMtKBDEQRYMoOD4-QQi47jFvO7hRxBcIbhTchXQ67UTSiSYZx_l704xuXGhtUpW69yacPbAdYrAAHGE0x6hFJwgRdMoZnRNE8BxL2QoptsAMUyEa3rbP22A2aZpJtAv2cn5FtXjLZiBeBOjGtxQ_bA_H2FsPdeih_dSmQO1fYnJlMcJlduEF-mi0h13SwSymeYgJloWFLnzYUGJaNykuy7SpgZ23I1xVNyxutLULfVzlA7AzaJ_t4fe5D56urx4vb5v7h5u7y4v7xlDJS4M7xmlPLRecd8OA9SB7I6mmmjEmDEd1SwwSVEhcByY1J6TVhKCO1QtJ98HxJrf-5H1pc1GvcZlCfVKRU1FpEEZIVZ1tVCbFnJMdlHFFFxdDSdp5hZGaCKsfwmoirL4JVzf_5X5LbtRp_a_vfONzoRIc9Som36ui1z6mYYLrsqJ_R3wBBGyUxg
CitedBy_id crossref_primary_10_3390_math11030510
crossref_primary_10_1016_j_apm_2025_116228
crossref_primary_10_1080_23302674_2023_2250250
crossref_primary_10_1016_j_cie_2024_109951
crossref_primary_10_1080_00207543_2023_2182151
crossref_primary_10_1080_00207543_2025_2551240
Cites_doi 10.1080/00207543.2019.1695167
10.1287/trsc.2013.0472
10.1016/j.cor.2018.07.024
10.1016/j.cie.2019.04.026
10.1016/j.tre.2019.01.005
10.1287/trsc.2015.0635
10.1287/opre.35.2.254
10.1287/inte.13.6.4
10.1007/PL00011432
10.1287/ijoc.1100.0439
10.1016/j.cor.2005.02.033
10.1016/j.ijpe.2013.11.019
10.1016/j.ijpe.2018.08.020
10.1016/j.ejor.2020.08.047
10.1007/s10107-003-0395-5
10.1007/s10732-007-9045-z
10.1016/j.cor.2009.11.009
10.1016/j.ijpe.2019.08.007
10.1016/j.ejor.2013.07.034
10.1016/j.trc.2009.08.004
10.1287/trsc.2019.0934
10.1016/j.trd.2016.07.001
10.1080/00207543.2014.986299
10.1016/j.cie.2016.07.022
10.1007/s10732-018-9392-y
10.1016/j.jfoodeng.2007.07.008
10.1016/j.ejor.2016.07.004
10.1016/j.cor.2008.09.003
10.1080/00207543.2020.1746428
10.1016/j.eswa.2011.04.138
ContentType Journal Article
Copyright 2021 Informa UK Limited, trading as Taylor & Francis Group 2021
2021 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2021 Informa UK Limited, trading as Taylor & Francis Group 2021
– notice: 2021 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
DOI 10.1080/00207543.2021.1998696
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1366-588X
EndPage 64
ExternalDocumentID 10_1080_00207543_2021_1998696
1998696
Genre Research Article
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29J
2DF
30N
4.4
5GY
5VS
8VB
A8Z
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFO
ACGFS
ACGOD
ACIWK
ACNCT
ACTIO
ADCVX
ADGTB
ADXPE
AEGXH
AEISY
AEMOZ
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AHQJS
AIAGR
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBD
EBE
EBO
EBR
EBS
EBU
EMK
EPL
ESTFP
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~9
H~P
I-F
IPNFZ
J.P
K1G
KYCEM
LJTGL
M4Z
ML~
NA5
NX~
O9-
P2P
PQQKQ
QWB
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TH9
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
ZL0
~S~
AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c395t-1b453d3e5655bff1af9dc93a3a4446c5053d2c06369150549a5228a220b415093
IEDL.DBID TFW
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000717866600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7543
IngestDate Wed Aug 13 08:43:43 EDT 2025
Tue Nov 18 21:27:09 EST 2025
Sat Nov 29 05:36:22 EST 2025
Mon Oct 20 23:46:15 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c395t-1b453d3e5655bff1af9dc93a3a4446c5053d2c06369150549a5228a220b415093
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-0929-4864
0000-0002-9797-1019
PQID 2760022422
PQPubID 30924
PageCount 16
ParticipantIDs crossref_citationtrail_10_1080_00207543_2021_1998696
informaworld_taylorfrancis_310_1080_00207543_2021_1998696
crossref_primary_10_1080_00207543_2021_1998696
proquest_journals_2760022422
PublicationCentury 2000
PublicationDate 2023-01-02
PublicationDateYYYYMMDD 2023-01-02
PublicationDate_xml – month: 01
  year: 2023
  text: 2023-01-02
  day: 02
PublicationDecade 2020
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle International journal of production research
PublicationYear 2023
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0034
CIT0011
CIT0033
CIT0014
CIT0013
CIT0016
CIT0015
CIT0017
CIT0019
Lappas P. Z. (CIT0018) 2017; 7
CIT0021
CIT0020
CIT0001
CIT0022
Li P. (CIT0023) 2015; 2015
CIT0003
CIT0025
CIT0002
CIT0024
CIT0005
CIT0027
CIT0004
CIT0026
CIT0007
CIT0029
CIT0006
CIT0028
CIT0009
CIT0008
References_xml – volume: 2015
  start-page: 1
  year: 2015
  ident: CIT0023
  publication-title: Discrete Dynamics in Nature and Society
– ident: CIT0020
  doi: 10.1080/00207543.2019.1695167
– ident: CIT0006
  doi: 10.1287/trsc.2013.0472
– ident: CIT0013
  doi: 10.1016/j.cor.2018.07.024
– ident: CIT0034
  doi: 10.1016/j.cie.2019.04.026
– ident: CIT0005
  doi: 10.1016/j.tre.2019.01.005
– ident: CIT0010
  doi: 10.1287/trsc.2015.0635
– volume: 7
  start-page: 237
  issue: 9
  year: 2017
  ident: CIT0018
  publication-title: Journal of Mathematics and System Science
– ident: CIT0032
  doi: 10.1287/opre.35.2.254
– ident: CIT0004
  doi: 10.1287/inte.13.6.4
– ident: CIT0003
  doi: 10.1007/PL00011432
– ident: CIT0002
  doi: 10.1287/ijoc.1100.0439
– ident: CIT0015
  doi: 10.1016/j.cor.2005.02.033
– ident: CIT0007
  doi: 10.1016/j.ijpe.2013.11.019
– ident: CIT0009
  doi: 10.1016/j.ijpe.2018.08.020
– ident: CIT0025
  doi: 10.1016/j.ejor.2020.08.047
– ident: CIT0012
  doi: 10.1007/s10107-003-0395-5
– ident: CIT0027
  doi: 10.1007/s10732-007-9045-z
– ident: CIT0014
– ident: CIT0001
  doi: 10.1016/j.cor.2009.11.009
– ident: CIT0022
  doi: 10.1016/j.ijpe.2019.08.007
– ident: CIT0021
  doi: 10.1016/j.ejor.2013.07.034
– ident: CIT0028
  doi: 10.1016/j.trc.2009.08.004
– ident: CIT0017
  doi: 10.1287/trsc.2019.0934
– ident: CIT0033
  doi: 10.1016/j.trd.2016.07.001
– ident: CIT0008
  doi: 10.1080/00207543.2014.986299
– ident: CIT0031
  doi: 10.1016/j.cie.2016.07.022
– ident: CIT0016
  doi: 10.1007/s10732-018-9392-y
– ident: CIT0026
  doi: 10.1016/j.jfoodeng.2007.07.008
– ident: CIT0030
  doi: 10.1016/j.ejor.2016.07.004
– ident: CIT0019
– ident: CIT0029
  doi: 10.1016/j.cor.2008.09.003
– ident: CIT0011
  doi: 10.1080/00207543.2020.1746428
– ident: CIT0024
  doi: 10.1016/j.eswa.2011.04.138
SSID ssj0000584
Score 2.4160078
Snippet The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the associated routing decisions. The IRP with time windows (IRPTW)...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 49
SubjectTerms Algorithms
exact methods
Inventory-routing
local branching
Optimization
time windows
valid inequalities
vehicle routing
Windows (intervals)
Title An improved model and exact algorithm using local branching for the inventory-routing problem with time windows
URI https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1998696
https://www.proquest.com/docview/2760022422
Volume 61
WOSCitedRecordID wos000717866600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: TFW
  dateStart: 19610101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0ShIA-sQYmdpPFYISqmiqGIbpGT2KVSSVCS8vj33DlOaYVQB9iyXB722ffd5fx9hFxHEPWMRpjyQuVAxBeO1K7vZJFiLAoN6jBiE_3RKJpMxIPtJqxsWyXm0LohijB7NS5umVRtRxye4IZA53PI7piHx-2iUCDpNoR-XJrj4dP3XhxElofZddCkPcPz213WotMad-mPvdoEoOH-P7z6Admz6JMOGnc5JFsqPyK7K5yEx6QY5HRmKg0qo0Ynh8LTqPqQaU3lfFqUs_r5hWK__JSaSEgTFOfAShaFD6GAKOnMtLIX5adTFgtsrKZWuIZi3ZeioD1c5VnxXp2Qx-Hd-PbesaoMTspFUDte4gc84wqQYJBo7UktslRwyaUPqWUKiIpnLAXkEwoAm5B-SoB4kWTMTQAsuIKfkk5e5OqM0H7AlNah9qUvfB2oyA3AWKJ_QFbKeJf47WzEqaUsR-WMeewtmU2b8YxxPGM7nl1yszR7bTg7NhmI1amOa1Ms0Y2yScw32PZav4jt8q9iZn53Avph53-49QXZQXF7U_BhPdKpy4W6JNvpWz2ryivj6F-LpfZ3
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT4QwEG50NVEPvo2rq_bgFQMtID0a42aNuqc1emsKtEqygmHx9e-dKaBrjPGgNy5ToB1mvhlm5iPkMAKvZznCtBdqBzy-cJRxfSeNNGNRaFGHJZs4Hg6j21sx3QuDZZUYQ5t6UIS11fhxYzK6LYnDFm7wdD6H8I552G8XhSKcJXMB-Fqcnz_q33xa4yBqJjG7Dsq0XTw_LfPFP32ZXvrNWlsX1F_5j4dfJcsNAKUntcaskRmdr5OlqbGEG6Q4yWlmkw06pZYqh8LtqH5VSUXV-K4os-r-gWLJ_B21zpDGyM-BySwKb0IBVNLMVrMX5ZtTFk9YW00b7hqKqV-KnPZwlafFy2STXPfPRqcDpyFmcBIugsrxYj_gKdcABoPYGE8ZkSaCK658iC4TAFU8ZQmAn1AA3oQIVAHKixRjbgx4wRV8i3TyItfbhB4HTBsTGl_5wjeBjtwAhBWqCASmjHeJ3x6HTJqp5UieMZbex3DTej8l7qds9rNLjj7EHuuxHb8JiOmzlpXNl5ia3ETyX2R7rWLIxgJMJLN_PAEAsZ0_LH1AFgajq0t5eT682CWLyHVv8z-sRzpV-aT3yHzyXGWTct9q_Ts2jvqh
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagIAQDb0ShgAfWoMRO0nisgAoEqjoU0c1yE7tUKkmVpjz-PWfHLa0Q6gBblsvDPvu-u5y_D6HLCKKe0QiTXigdiPjMEcr1nSSShEShQR1GbKLeakXdLmvbbsKxbavUObQqiSLMXq0X9yhR0444fYIbAp1PIbsjnj5uF4UsXEVrAJ1D7eSd5vP3ZhxElojZdbTN9BDPb7dZCE8L5KU_NmsTgZo7__Duu2jbwk_cKP1lD63IdB9tzZESHqCskeKBKTXIBBuhHAxPw_JDxAUWw36WD4qXV6wb5vvYhELc0-ocupSF4UMwQEo8ML3sWf7p5NlEd1Zjq1yDdeEXa0V7uEqT7H18iJ6at53rO8fKMjgxZUHheD0_oAmVAAWDnlKeUCyJGRVU-JBbxgCpaEJigD4hA7QJ-acAjBcJQtweoAWX0SNUSbNUHiNcD4hUKlS-8JmvAhm5ARgL7SCQlhJaRf50NnhsOcu1dMaQezNq03I8uR5Pbseziq5mZqOStGOZAZufal6YaokqpU04XWJbm_oFt-t_zIn53wnwh5z84dYXaKN90-SP962HU7Sphe5N8YfUUKXIJ_IMrcdvxWCcnxuf_wI7EPlT
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+improved+model+and+exact+algorithm+using+local+branching+for+the+inventory-routing+problem+with+time+windows&rft.jtitle=International+journal+of+production+research&rft.au=Demantova%2C+Bruno+E.&rft.au=Scarpin%2C+Cassius+T.&rft.au=Coelho%2C+Leandro+C.&rft.au=Darvish%2C+Maryam&rft.date=2023-01-02&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=61&rft.issue=1&rft.spage=49&rft.epage=64&rft_id=info:doi/10.1080%2F00207543.2021.1998696&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_00207543_2021_1998696
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon