A hybrid heuristic for a stochastic production-inventory-routing problem

We consider a stochastic single item production-inventory-routing problem with a single producer and multiple clients. At the clients, demand is allowed to be backlogged incurring a penalty cost. Demands are considered uncertain. A recourse model is presented where the production and routing decisio...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 64; pp. 345 - 354
Main Authors Agra, Agostinho, Requejo, Cristina, Rodrigues, Filipe
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.02.2018
Subjects
hybrid heuristic
Inventory routing
sample approximation algorithm
stochastic programming
Inventory routing
sample approximation algorithm
hybrid heuristic
stochastic programming
Online AccessGet full text
ISSN1571-0653
1571-0653
DOI10.1016/j.endm.2018.02.009

Cover

Abstract We consider a stochastic single item production-inventory-routing problem with a single producer and multiple clients. At the clients, demand is allowed to be backlogged incurring a penalty cost. Demands are considered uncertain. A recourse model is presented where the production and routing decisions are taken before the scenario is known, and the quantities to deliver to the clients and the inventory levels are adjustable to the scenario. Valid inequalities are introduced and a hybrid heuristic that combines ideas from the sample average approximation method and from relax-and-fix approaches is proposed. Preliminary tests based on randomly generated instances are reported showing that the hybrid heuristic performs better than the classical sample approximation algorithm for hard instances.
AbstractList We consider a stochastic single item production-inventory-routing problem with a single producer and multiple clients. At the clients, demand is allowed to be backlogged incurring a penalty cost. Demands are considered uncertain. A recourse model is presented where the production and routing decisions are taken before the scenario is known, and the quantities to deliver to the clients and the inventory levels are adjustable to the scenario. Valid inequalities are introduced and a hybrid heuristic that combines ideas from the sample average approximation method and from relax-and-fix approaches is proposed. Preliminary tests based on randomly generated instances are reported showing that the hybrid heuristic performs better than the classical sample approximation algorithm for hard instances.
Author Agra, Agostinho
Requejo, Cristina
Rodrigues, Filipe
Author_xml – sequence: 1
  givenname: Agostinho
  surname: Agra
  fullname: Agra, Agostinho
  organization: Department of Mathematics, University of Aveiro, 3810-193 Aveiro, Portugal
– sequence: 2
  givenname: Cristina
  surname: Requejo
  fullname: Requejo, Cristina
  organization: Department of Mathematics, University of Aveiro, 3810-193 Aveiro, Portugal
– sequence: 3
  givenname: Filipe
  surname: Rodrigues
  fullname: Rodrigues, Filipe
  organization: Department of Mathematics, University of Aveiro, 3810-193 Aveiro, Portugal
BookMark eNp9kM9qAjEQh0OxULV9gZ72BXabyWbdDfQi0n8g9NKeQzaZ1IgmkkTBt69beyg9eJphfnzDzDchIx88EnIPtAIKs4d1hd5sK0ahqyirKBVXZAxNCyWdNfXoT39DJimtKa07aJsxeZ0Xq2MfnSlWuI8uZacLG2KhipSDXqmfwS4Gs9fZBV86f0CfQzyWMeyz819D2G9we0uurdokvPutU_L5_PSxeC2X7y9vi_my1IxDLk0PIKzpOMxYbXrGedsyxo0VjeVIhVYdomW65RoRemWEFkwIzZUGbIDXU9Kd9-oYUopopXZZDbflqNxGApWDEbmWgxE5GJGUyZORE8r-obvotioeL0OPZwhPTx0cRpm0Q6_RuIg6SxPcJfwb1tx-aA
CitedBy_id crossref_primary_10_1007_s10100_024_00913_4
crossref_primary_10_1016_j_eswa_2023_120704
crossref_primary_10_1016_j_jclepro_2025_145273
crossref_primary_10_1108_JM2_09_2019_0230
crossref_primary_10_24857_rgsa_v18n2_116
crossref_primary_10_1007_s40747_020_00264_y
crossref_primary_10_1109_ACCESS_2021_3053046
crossref_primary_10_1016_j_cor_2021_105280
crossref_primary_10_1002_net_21796
crossref_primary_10_3934_jimo_2021196
Cites_doi 10.1016/j.cor.2015.01.008
10.1023/A:1023062915106
10.1080/00207543.2014.883470
10.1016/j.trc.2011.06.003
10.1016/j.cor.2014.01.011
10.1023/A:1021814225969
ContentType Journal Article
Copyright 2018 Elsevier B.V.
Copyright_xml – notice: 2018 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.endm.2018.02.009
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1571-0653
EndPage 354
ExternalDocumentID 10_1016_j_endm_2018_02_009
S1571065318300362
GrantInformation_xml – fundername: Center for Research and Development in Mathematics and Applications
– fundername: Foundation for Science and Technology
  grantid: UID/MAT/04106/2013; PD/BD/114185/2016
  funderid: https://doi.org/10.13039/501100001871
GroupedDBID --K
--M
.~1
0R~
1B1
1~.
1~5
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AASFE
AAXUO
ABAOU
ABJNI
ABMAC
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACXMD
ADBBV
ADEZE
ADGUI
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AIEXJ
AIGVJ
AIKHN
AITUG
AJMQA
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
M41
MHUIS
MO0
M~E
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c241t-db119fd841623db24477224df95f4e09ca8eef2c74cee1bad9c9299c4ac1e5143
IEDL.DBID .~1
ISSN 1571-0653
IngestDate Wed Oct 01 01:12:19 EDT 2025
Thu Apr 24 22:58:55 EDT 2025
Fri Feb 23 02:27:45 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Keywords Inventory routing
sample approximation algorithm
hybrid heuristic
stochastic programming
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c241t-db119fd841623db24477224df95f4e09ca8eef2c74cee1bad9c9299c4ac1e5143
OpenAccessLink http://hdl.handle.net/10773/24193
PageCount 10
ParticipantIDs crossref_citationtrail_10_1016_j_endm_2018_02_009
crossref_primary_10_1016_j_endm_2018_02_009
elsevier_sciencedirect_doi_10_1016_j_endm_2018_02_009
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2018-02-01
PublicationDateYYYYMMDD 2018-02-01
PublicationDate_xml – month: 02
  year: 2018
  text: 2018-02-01
  day: 01
PublicationDecade 2010
PublicationTitle Electronic notes in discrete mathematics
PublicationYear 2018
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Verweij, Ahmed, Kleywegt, Nemhauser, Shapiro (br0090) 2003; 24
Bertazzi, Bosco, Guerriero, Laganà (br0050) 2013; 27
Kaut, Wallace (br0060) 2007; 3
Pochet, Wolsey (br0070) 2006
Adulyasak, Cordeau, Jans (br0010) 2015; 55
Agra, Christiansen, Delgado, Hvattum (br0020) 2015; 61
Ahmed, King, Parija (br0040) 2003; 26
Agra, Christiansen, Hvattum, Rodrigues (br0030) 2016
Rahim, Zhong, Aghezzaf, Aouam (br0080) 2014; 52
Bertazzi (10.1016/j.endm.2018.02.009_br0050) 2013; 27
Pochet (10.1016/j.endm.2018.02.009_br0070) 2006
Rahim (10.1016/j.endm.2018.02.009_br0080) 2014; 52
Verweij (10.1016/j.endm.2018.02.009_br0090) 2003; 24
Adulyasak (10.1016/j.endm.2018.02.009_br0010) 2015; 55
Ahmed (10.1016/j.endm.2018.02.009_br0040) 2003; 26
Kaut (10.1016/j.endm.2018.02.009_br0060) 2007; 3
Agra (10.1016/j.endm.2018.02.009_br0030) 2016
Agra (10.1016/j.endm.2018.02.009_br0020) 2015; 61
References_xml – volume: 27
  start-page: 89
  year: 2013
  end-page: 107
  ident: br0050
  article-title: A stochastic inventory routing problem with stock-out
  publication-title: Transportation Research Part C: Emerging Technologies
– volume: 52
  start-page: 4351
  year: 2014
  end-page: 4363
  ident: br0080
  article-title: Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates
  publication-title: International Journal of Production Research
– volume: 61
  start-page: 18
  year: 2015
  end-page: 30
  ident: br0020
  article-title: A maritime inventory routing problem with stochastic sailing and port times
  publication-title: Computers and Operations Research
– volume: 24
  start-page: 289
  year: 2003
  end-page: 333
  ident: br0090
  article-title: The sample average approximation method applied to stochastic routing problems: A computational study
  publication-title: Computational Optimization and Applications
– volume: 55
  start-page: 141
  year: 2015
  end-page: 152
  ident: br0010
  article-title: The production routing problem: A review of formulations and solution algorithms
  publication-title: Computers and Operations Research
– volume: 26
  start-page: 3
  year: 2003
  end-page: 24
  ident: br0040
  article-title: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
  publication-title: Journal of Global Optimization
– year: 2006
  ident: br0070
  article-title: Production Planning by Mixed Integer Programming
– start-page: 18
  year: 2016
  end-page: 34
  ident: br0030
  article-title: A MIP based local search heuristic for a stochastic maritime inventory routing problem
  publication-title: Computational Logistics: 7th International Conference, ICCL 2016, Proceedings
– volume: 3
  start-page: 257
  year: 2007
  end-page: 271
  ident: br0060
  article-title: Evaluation of scenario-generation methods for stochastic programming
  publication-title: Pacific Journal of Optimization
– start-page: 18
  year: 2016
  ident: 10.1016/j.endm.2018.02.009_br0030
  article-title: A MIP based local search heuristic for a stochastic maritime inventory routing problem
– volume: 61
  start-page: 18
  year: 2015
  ident: 10.1016/j.endm.2018.02.009_br0020
  article-title: A maritime inventory routing problem with stochastic sailing and port times
  publication-title: Computers and Operations Research
  doi: 10.1016/j.cor.2015.01.008
– volume: 26
  start-page: 3
  issue: 1
  year: 2003
  ident: 10.1016/j.endm.2018.02.009_br0040
  article-title: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
  publication-title: Journal of Global Optimization
  doi: 10.1023/A:1023062915106
– volume: 52
  start-page: 4351
  issue: 14
  year: 2014
  ident: 10.1016/j.endm.2018.02.009_br0080
  article-title: Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates
  publication-title: International Journal of Production Research
  doi: 10.1080/00207543.2014.883470
– volume: 27
  start-page: 89
  year: 2013
  ident: 10.1016/j.endm.2018.02.009_br0050
  article-title: A stochastic inventory routing problem with stock-out
  publication-title: Transportation Research Part C: Emerging Technologies
  doi: 10.1016/j.trc.2011.06.003
– year: 2006
  ident: 10.1016/j.endm.2018.02.009_br0070
– volume: 55
  start-page: 141
  year: 2015
  ident: 10.1016/j.endm.2018.02.009_br0010
  article-title: The production routing problem: A review of formulations and solution algorithms
  publication-title: Computers and Operations Research
  doi: 10.1016/j.cor.2014.01.011
– volume: 3
  start-page: 257
  year: 2007
  ident: 10.1016/j.endm.2018.02.009_br0060
  article-title: Evaluation of scenario-generation methods for stochastic programming
  publication-title: Pacific Journal of Optimization
– volume: 24
  start-page: 289
  issue: 2
  year: 2003
  ident: 10.1016/j.endm.2018.02.009_br0090
  article-title: The sample average approximation method applied to stochastic routing problems: A computational study
  publication-title: Computational Optimization and Applications
  doi: 10.1023/A:1021814225969
SSID ssj0038175
Score 2.1632285
Snippet We consider a stochastic single item production-inventory-routing problem with a single producer and multiple clients. At the clients, demand is allowed to be...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 345
SubjectTerms hybrid heuristic
Inventory routing
sample approximation algorithm
stochastic programming
Title A hybrid heuristic for a stochastic production-inventory-routing problem
URI https://dx.doi.org/10.1016/j.endm.2018.02.009
Volume 64
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: GBLVA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 20190331
  omitProxy: true
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: ACRLP
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 20190331
  omitProxy: true
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: AIKHN
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect (Elsevier)
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: .~1
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 20191231
  omitProxy: true
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: M~E
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1571-0653
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: AKRWK
  dateStart: 19990301
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07a8MwEBYhXbr0XZo-goZuRY3lSHE0htDgvkJpG8gmbEkmKcUJIRmy9Lf3zpZDCyVDJ2MhgTmf777D331HyLVyWcCNajMFxRcTgHBZKq1jqCsD9VCWqUKd_3nYiUfiYSzHNdKvemGQVuljfxnTi2jtV1remq35dNp64xKyY0eiUwY-DgsR4RSD268NzQMF6GShmRohw0e2feNMyfFyucVudN4tdTvV38npR8IZHJA9jxRpr3yYQ1Jz-RHZr6YwUP9RHpO4Rydr7LuiE7cqdZcpIFGaUMB1ZpIUC_NS2BVeApsWNPPZYs0WsxWSnqkfKnNCRoO7937M_HwEZiDvLplNOVeZxR-HYdumkKgBKofCZkpmwgXKJF3nstBEAjIhTxOrDIAhZURiuEOgdErq-Sx3Z4RGUEihzoSMDACkyMAObqESslGWtnkqGoRXhtHGi4fjDItPXbHEPjQaU6MxdRBqMGaD3GzOzEvpjK27ZWVv_csBNMT2LefO_3nuguziXUnAviT15WLlrgBfLNNm4UBNstPrvz694PX-MR5-A1dW0Kc
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07b8IwELYQHdql76r06aFb5RInMcEjQkVpCywFic1K_BBUVUAIBpb-9p5jB7VSxdDVsaXocr77TvnuO4QeuDYBlTwiHIovEgPCJTlTmlhdGaiHjOGlOv9g2ErH8euETWqoW_XCWFqlj_0uppfR2q80vTWbi9ms-U4ZZMcWs04ZuDi8F7MwsRXY09eW52EV6FgpmppYig-LfOeMI3npQtl2dNp2wp387-z0I-P0jtGhh4q4497mBNV0cYqOqjEM2N_KM5R28HRjG6_wVK-d8DIGKIozDMBOTrNyYeGUXeErkFnJM58vN2Q5X1vWM_ZTZc7RuPc86qbED0ggEhLviqicUm6U_XMYRiqHTA1YOYyV4czEOuAya2ttQpnEkAppnikuAQ1xGWeSaouULlC9mBf6EuEEKikrNMESCQgpkbCDKiiFVGLyiOZxA9HKMEJ69XA7xOJTVDSxD2GNKawxRRAKMGYDPW7PLJx2xs7drLK3-OUBAoL7jnNX_zx3j_bT0aAv-i_Dt2t0YJ84NvYNqq-Wa30LYGOV35XO9A3S3NCn
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=A+hybrid+heuristic+for+a+stochastic+production-inventory-routing+problem&rft.jtitle=Electronic+notes+in+discrete+mathematics&rft.au=Agra%2C+Agostinho&rft.au=Requejo%2C+Cristina&rft.au=Rodrigues%2C+Filipe&rft.date=2018-02-01&rft.issn=1571-0653&rft.eissn=1571-0653&rft.volume=64&rft.spage=345&rft.epage=354&rft_id=info:doi/10.1016%2Fj.endm.2018.02.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_endm_2018_02_009
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0653&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0653&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0653&client=summon