A variable neighborhood search algorithm for the (r∣p) hub–centroid problem under the price war

This study considers the ( r ∣ p ) hub–centroid problem under the price war, which was recently proposed in the literature. The objective is profit maximization by choosing the best hub and spoke topology, with the corresponding price structure, in a leader–follower setting. Because this bi–level op...

Full description

Saved in:
Bibliographic Details
Published inJournal of global optimization Vol. 83; no. 3; pp. 405 - 444
Main Authors Čvokić, Dimitrije D., Kochetov, Yury A., Plyasunov, Aleksandr V., Savić, Aleksandar
Format Journal Article
LanguageEnglish
Published New York Springer US 01.07.2022
Springer
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0925-5001
1573-2916
DOI10.1007/s10898-021-01036-9

Cover

Abstract This study considers the ( r ∣ p ) hub–centroid problem under the price war, which was recently proposed in the literature. The objective is profit maximization by choosing the best hub and spoke topology, with the corresponding price structure, in a leader–follower setting. Because this bi–level optimization problem is NP–hard, the use of metaheuristics is a natural choice for solving real–size instances. A variable neighborhood search algorithm is designed as a solution approach for the leader. The characterization of optimal routes under the price equilibrium is given in order to simplify and improve the algorithm. When it comes to the follower, we have shown how to reformulate in a linear fashion the initial non–linear model. The computational experiments are conducted on the CAB instances. The results of these experiments are thoroughly discussed, highlighting the effects of different parameters and providing some interesting managerial insights.
AbstractList This study considers the ( r ∣ p ) hub–centroid problem under the price war, which was recently proposed in the literature. The objective is profit maximization by choosing the best hub and spoke topology, with the corresponding price structure, in a leader–follower setting. Because this bi–level optimization problem is NP–hard, the use of metaheuristics is a natural choice for solving real–size instances. A variable neighborhood search algorithm is designed as a solution approach for the leader. The characterization of optimal routes under the price equilibrium is given in order to simplify and improve the algorithm. When it comes to the follower, we have shown how to reformulate in a linear fashion the initial non–linear model. The computational experiments are conducted on the CAB instances. The results of these experiments are thoroughly discussed, highlighting the effects of different parameters and providing some interesting managerial insights.
This study considers the [Formula omitted] hub-centroid problem under the price war, which was recently proposed in the literature. The objective is profit maximization by choosing the best hub and spoke topology, with the corresponding price structure, in a leader-follower setting. Because this bi-level optimization problem is NP-hard, the use of metaheuristics is a natural choice for solving real-size instances. A variable neighborhood search algorithm is designed as a solution approach for the leader. The characterization of optimal routes under the price equilibrium is given in order to simplify and improve the algorithm. When it comes to the follower, we have shown how to reformulate in a linear fashion the initial non-linear model. The computational experiments are conducted on the CAB instances. The results of these experiments are thoroughly discussed, highlighting the effects of different parameters and providing some interesting managerial insights.
This study considers the (r∣p) hub–centroid problem under the price war, which was recently proposed in the literature. The objective is profit maximization by choosing the best hub and spoke topology, with the corresponding price structure, in a leader–follower setting. Because this bi–level optimization problem is NP–hard, the use of metaheuristics is a natural choice for solving real–size instances. A variable neighborhood search algorithm is designed as a solution approach for the leader. The characterization of optimal routes under the price equilibrium is given in order to simplify and improve the algorithm. When it comes to the follower, we have shown how to reformulate in a linear fashion the initial non–linear model. The computational experiments are conducted on the CAB instances. The results of these experiments are thoroughly discussed, highlighting the effects of different parameters and providing some interesting managerial insights.
Audience Academic
Author Plyasunov, Aleksandr V.
Čvokić, Dimitrije D.
Savić, Aleksandar
Kochetov, Yury A.
Author_xml – sequence: 1
  givenname: Dimitrije D.
  orcidid: 0000-0001-7975-4224
  surname: Čvokić
  fullname: Čvokić, Dimitrije D.
  email: dimitrije.cvokic@pmf.unibl.org
  organization: Faculty of Natural Sciences and Mathematics, University of Banja Luka
– sequence: 2
  givenname: Yury A.
  surname: Kochetov
  fullname: Kochetov, Yury A.
  organization: Sobolev Institute of Mathematics, Novosibirsk State University
– sequence: 3
  givenname: Aleksandr V.
  surname: Plyasunov
  fullname: Plyasunov, Aleksandr V.
  organization: Sobolev Institute of Mathematics, Novosibirsk State University
– sequence: 4
  givenname: Aleksandar
  surname: Savić
  fullname: Savić, Aleksandar
  organization: Faculty of Mathematics, University of Belgrade
BookMark eNp9kb1qHDEUhUVwIGsnL5BKkCYpxrmSopFULiaJDYY0SS00mqsdmdnRRpqNcZfSvR8hb-YnsdYTMLgwKi6I892fc47J0ZQmJOQ9g1MGoD4XBtroBjhrgIFoG_OKrJhUouGGtUdkBYbLRgKwN-S4lCsAMFryFfFr-sfl6LoR6YRxM3QpDyn1tKDLfqBu3KQc52FLQ8p0HpB-zPe3_3af6LDv7v_eeZzmnGJPdznVHlu6n3pchLscPdJrl9-S18GNBd_9ryfk17evP8_Om8sf3y_O1peNF1LPje8cEz2EoDvkCrhHg571reywb7HzSplw2FtgZ6TmzLfKfJEYQHOpW6HECfmw9K27_N5jme1V2uepjrS8VdUfw7ipqtNFtXEj2jiFNGfn6-txG321NcT6v1ZQuwvOZAX0AvicSskYrI-zm2Oql7s4Wgb2kIFdMrA1A_uYgT3M4s_QasrW5ZuXIbFApYqnDeanM16gHgCLZZ06
CitedBy_id crossref_primary_10_1007_s10898_022_01186_4
crossref_primary_10_1007_s11590_022_01924_3
Cites_doi 10.1016/j.ins.2015.07.044
10.1007/s11590-015-0867-6
10.1016/j.ejor.2007.06.008
10.1007/s40314-019-1025-z
10.1142/S021926591940005X
10.1287/trsc.1120.0410
10.2307/1911955
10.2307/2224214
10.1134/S0005117914040080
10.1016/j.cor.2011.05.007
10.1134/S0005117914040110
10.1007/s10589-008-9170-0
10.1007/s10479-017-2508-1
10.1007/s11067-014-9276-0
10.2298/FIL2008463C
10.1134/S1990478915030102
10.1016/S0305-0548(02)00024-2
10.1016/S0453-4514(01)80019-3
10.1016/j.ejor.2015.09.008
10.1111/j.1937-5956.2007.tb00168.x
10.1016/S0305-0548(97)00031-2
10.1016/j.ejor.2013.06.006
10.1016/S0377-2217(87)80007-3
10.1016/j.cie.2013.01.012
10.1109/MCSE.2007.55
10.1007/978-1-4419-7572-0_12
10.1007/978-3-030-22629-9_10
10.1007/978-3-319-44914-2_2
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021
COPYRIGHT 2022 Springer
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021
– notice: COPYRIGHT 2022 Springer
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
L.-
L6V
L7M
L~C
L~D
M0C
M0N
M2O
M2P
M7S
MBDVC
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10898-021-01036-9
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Advanced Technologies & Aerospace Database
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology Collection (via ProQuest SciTech Premium Collection)
ProQuest One Community College
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest Research Library
SciTech Premium Collection (via ProQuest)
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Research Library
Science Database (via ProQuest SciTech Premium Collection)
Engineering Database (Proquest)
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Research Library
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList

ProQuest Business Collection (Alumni Edition)
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Sciences (General)
Computer Science
EISSN 1573-2916
EndPage 444
ExternalDocumentID A707943215
10_1007_s10898_021_01036_9
GrantInformation_xml – fundername: РоссиЙскиЙФондФундаментальныхИсследованиЙ
  grantid: http://dx.doi.org/10.13039/501100002261
  funderid: http://dx.doi.org/10.13039/501100002261
– fundername: Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja
  grantid: 174010
  funderid: http://dx.doi.org/10.13039/501100004564
GroupedDBID -52
-57
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29K
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
7WY
88I
8AO
8FE
8FG
8FL
8G5
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTAH
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
D-I
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GUQSH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IAO
IHE
IJ-
IKXTQ
ITC
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M0C
M0N
M2O
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SBE
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7X
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8T
Z8U
Z8W
Z92
ZMTXR
ZWQNP
ZY4
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
PUEGO
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L7M
L~C
L~D
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c358t-cba13d0ff8be2702ce9ec1d65bed6ebc779f00093eb95821c67945ef082586373
IEDL.DBID BENPR
ISSN 0925-5001
IngestDate Sat Aug 23 12:35:39 EDT 2025
Mon Oct 20 16:59:08 EDT 2025
Thu Apr 24 22:53:51 EDT 2025
Wed Oct 01 01:34:46 EDT 2025
Fri Feb 21 02:46:45 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Competitive hub location
Variable neighborhood search
Pricing
Reformulation
90B80
90C90
90C59
91B06
90B06
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c358t-cba13d0ff8be2702ce9ec1d65bed6ebc779f00093eb95821c67945ef082586373
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-7975-4224
PQID 2678989129
PQPubID 29930
PageCount 40
ParticipantIDs proquest_journals_2678989129
gale_infotracacademiconefile_A707943215
crossref_citationtrail_10_1007_s10898_021_01036_9
crossref_primary_10_1007_s10898_021_01036_9
springer_journals_10_1007_s10898_021_01036_9
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2022-07-01
PublicationDateYYYYMMDD 2022-07-01
PublicationDate_xml – month: 07
  year: 2022
  text: 2022-07-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
– name: Dordrecht
PublicationSubtitle An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering
PublicationTitle Journal of global optimization
PublicationTitleAbbrev J Glob Optim
PublicationYear 2022
Publisher Springer US
Springer
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer
– name: Springer Nature B.V
References Sasaki, Fukushima (CR33) 2001; 44
Alumur, Kara (CR2) 2008; 190
Čvokić (CR9) 2020; 34
O’Kelly (CR28) 1987; 32
Davydov, Kochetov, Mladenovic, Urosevic (CR12) 2014; 75
Farahani, Hekmatfar, Arabani, Nikbakhsh (CR14) 2013; 64
d’Aspremont, Gabszewicz, Thisse (CR11) 1979; 49
Bhadury, Eiselt, Jaramillo (CR3) 2003; 30
Kochetov, Panin, Plyasunov (CR22) 2015; 9
Bitran, Ferrer (CR4) 2007; 16
Hansen, Mladenović, Brimberg, Moreno Pérez, Gendreau, Potvin (CR15) 2019
Jankovic, Miskovic, Stanimirovic, Todosijevic (CR20) 2017; 259
Hsieh, Kao (CR18) 2019
Redondo, Fernández, García, Ortigosa (CR31) 2010; 45
Todosijevic, Urosevic, Mladenovic, Hanafi (CR34) 2017; 11
O’Kelly, Luna, de Camargo, Miranda (CR29) 2015; 15
Panin, Pashchenko, Plyasunov (CR30) 2014; 75
Sasaki (CR32) 2005; 48
CR8
Contreras, Laporte, Nickel, Saldanha da Gama (CR6) 2015
CR7
Alekseeva, Kochetov, El-Ghazali (CR1) 2013
Hekmatfar, Pishvaee, Zanjirani, Hekmatfar (CR16) 2009
Campbell, O’Kelly (CR5) 2012; 46
Čvokić, Stanimirovic (CR10) 2020; 39
CR21
Küçükaydın, Aras, Altınel (CR23) 2012; 39
Mladenović, Todosijević, Urošević (CR27) 2016; 326
Hotelling (CR17) 1929; 39
Mladenović, Hansen (CR26) 1997; 24
Mahmutogullari, Kara (CR25) 2016; 250
Lüer-Villagra, Marianov (CR24) 2013; 231
Dempe (CR13) 2002
Hunter (CR19) 2007; 9
J Bhadury (1036_CR3) 2003; 30
R Todosijevic (1036_CR34) 2017; 11
G Bitran (1036_CR4) 2007; 16
M Sasaki (1036_CR32) 2005; 48
A Lüer-Villagra (1036_CR24) 2013; 231
RZ Farahani (1036_CR14) 2013; 64
E Alekseeva (1036_CR1) 2013
I Contreras (1036_CR6) 2015
DD Čvokić (1036_CR10) 2020; 39
N Mladenović (1036_CR26) 1997; 24
H Hotelling (1036_CR17) 1929; 39
1036_CR7
JD Hunter (1036_CR19) 2007; 9
H Küçükaydın (1036_CR23) 2012; 39
1036_CR8
S Dempe (1036_CR13) 2002
1036_CR21
IA Davydov (1036_CR12) 2014; 75
S Alumur (1036_CR2) 2008; 190
O Jankovic (1036_CR20) 2017; 259
N Mladenović (1036_CR27) 2016; 326
M Sasaki (1036_CR33) 2001; 44
ME O’Kelly (1036_CR28) 1987; 32
J d’Aspremont (1036_CR11) 1979; 49
M Hekmatfar (1036_CR16) 2009
S Hsieh (1036_CR18) 2019
DD Čvokić (1036_CR9) 2020; 34
P Hansen (1036_CR15) 2019
J Campbell (1036_CR5) 2012; 46
ME O’Kelly (1036_CR29) 2015; 15
Y Kochetov (1036_CR22) 2015; 9
A Panin (1036_CR30) 2014; 75
I Mahmutogullari (1036_CR25) 2016; 250
JL Redondo (1036_CR31) 2010; 45
References_xml – year: 2015
  ident: CR6
  article-title: Hub Location Problems
  publication-title: Location Science
– volume: 326
  start-page: 160
  year: 2016
  end-page: 171
  ident: CR27
  article-title: Less is more
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2015.07.044
– volume: 11
  start-page: 1109
  year: 2017
  end-page: 1121
  ident: CR34
  article-title: A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-015-0867-6
– volume: 190
  start-page: 1
  issue: 1
  year: 2008
  end-page: 21
  ident: CR2
  article-title: Network hub location problems: the state of the art
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2007.06.008
– volume: 39
  start-page: 40
  year: 2020
  ident: CR10
  article-title: A single allocation hub location and pricing problem
  publication-title: Comp. Appl. Math.
  doi: 10.1007/s40314-019-1025-z
– year: 2019
  ident: CR18
  article-title: A survey of hub location problems
  publication-title: J. Interconnect. Netw.
  doi: 10.1142/S021926591940005X
– volume: 46
  start-page: 153
  issue: 2
  year: 2012
  end-page: 169
  ident: CR5
  article-title: Twenty-five years of hub location research
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.1120.0410
– volume: 49
  start-page: 1145
  year: 1979
  end-page: 1150
  ident: CR11
  article-title: On Hotelling’s stability in competition
  publication-title: Econometrica
  doi: 10.2307/1911955
– volume: 39
  start-page: 41
  issue: 153
  year: 1929
  end-page: 57
  ident: CR17
  article-title: Stability in competition
  publication-title: Econ. J.
  doi: 10.2307/2224214
– year: 2002
  ident: CR13
  publication-title: Foundations of Bilevel Programming
– ident: CR8
– volume: 75
  start-page: 677
  issue: 4
  year: 2014
  end-page: 687
  ident: CR12
  article-title: Fast metaheuristics for the discrete ( )-centroid problem
  publication-title: Auto Remot Control
  doi: 10.1134/S0005117914040080
– ident: CR21
– volume: 48
  start-page: 158
  year: 2005
  end-page: 71
  ident: CR32
  article-title: Hub network design model in a competitive environment with flow threshold
  publication-title: J. Oper. Res. Soc. Japan
– year: 2013
  ident: CR1
  article-title: Matheuristics and exact methods for the discrete ( )-centroid problem
  publication-title: Metaheuristics for bi-level optimization
– volume: 39
  start-page: 437
  issue: 2
  year: 2012
  end-page: 448
  ident: CR23
  article-title: A leader-follower game in competitive facility location
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2011.05.007
– volume: 75
  start-page: 715
  issue: 4
  year: 2014
  end-page: 727
  ident: CR30
  article-title: Bilevel competitive facility location and pricing problems
  publication-title: Automat. Remote Control
  doi: 10.1134/S0005117914040110
– volume: 45
  start-page: 111
  issue: 1
  year: 2010
  end-page: 141
  ident: CR31
  article-title: Heuristics for the facility location and design -centroid problem on the plane
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-008-9170-0
– volume: 259
  start-page: 191
  issue: 1–2
  year: 2017
  end-page: 216
  ident: CR20
  article-title: Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems
  publication-title: Annals OR
  doi: 10.1007/s10479-017-2508-1
– start-page: 57
  year: 2019
  end-page: 97
  ident: CR15
  article-title: Variable Neighborhood Search
  publication-title: Handbook of Metaheuristics, International Series in Operations Research & Management Science 272
– volume: 15
  start-page: 917
  issue: 4
  year: 2015
  end-page: 945
  ident: CR29
  article-title: Hub location problems with price sensitive demands
  publication-title: Netw. Spat. Econ.
  doi: 10.1007/s11067-014-9276-0
– volume: 34
  start-page: 2463
  issue: 8
  year: 2020
  end-page: 2484
  ident: CR9
  article-title: A leader-follower single allocation hub location problem under fixed markups
  publication-title: Filomat.
  doi: 10.2298/FIL2008463C
– year: 2009
  ident: CR16
  article-title: Hub Location Problem
  publication-title: Facility Location
– volume: 9
  start-page: 392
  issue: 3
  year: 2015
  end-page: 401
  ident: CR22
  article-title: Comparison of metaheuristics for the bilevel facility location and mill pricing problem
  publication-title: J. Appl. Indus. Math.
  doi: 10.1134/S1990478915030102
– volume: 30
  start-page: 553
  year: 2003
  end-page: 565
  ident: CR3
  article-title: An alternating heuristic for medianoid and centroid problems in the plane
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(02)00024-2
– volume: 44
  start-page: 390
  issue: 4
  year: 2001
  end-page: 405
  ident: CR33
  article-title: Stackelberg hub location problem
  publication-title: J. Oper. Res. Soc. Japan
  doi: 10.1016/S0453-4514(01)80019-3
– ident: CR7
– volume: 250
  start-page: 214
  issue: 1
  year: 2016
  end-page: 225
  ident: CR25
  article-title: Hub location under competition
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2015.09.008
– volume: 16
  start-page: 93
  year: 2007
  end-page: 108
  ident: CR4
  article-title: On pricing and composition of bundles
  publication-title: Prod. Oper. Manag.
  doi: 10.1111/j.1937-5956.2007.tb00168.x
– volume: 24
  start-page: 1097
  year: 1997
  end-page: 1100
  ident: CR26
  article-title: Variable neighborhood search
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(97)00031-2
– volume: 231
  start-page: 734
  issue: 3
  year: 2013
  end-page: 744
  ident: CR24
  article-title: A competitive hub location and pricing problem
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2013.06.006
– volume: 32
  start-page: 393
  year: 1987
  end-page: 404
  ident: CR28
  article-title: A quadratic integer program for the location of interacting hub facilities
  publication-title: EJOR
  doi: 10.1016/S0377-2217(87)80007-3
– volume: 64
  start-page: 1096
  issue: 4
  year: 2013
  end-page: 1109
  ident: CR14
  article-title: Hub location problems: a review of models, classification, solution techniques, and applications
  publication-title: Comput Indus Eng
  doi: 10.1016/j.cie.2013.01.012
– volume: 9
  start-page: 90
  issue: 3
  year: 2007
  end-page: 95
  ident: CR19
  article-title: Matplotlib: a 2D graphics environment
  publication-title: Comput. Sci. Eng.
  doi: 10.1109/MCSE.2007.55
– volume: 326
  start-page: 160
  year: 2016
  ident: 1036_CR27
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2015.07.044
– volume: 75
  start-page: 715
  issue: 4
  year: 2014
  ident: 1036_CR30
  publication-title: Automat. Remote Control
  doi: 10.1134/S0005117914040110
– volume: 11
  start-page: 1109
  year: 2017
  ident: 1036_CR34
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-015-0867-6
– volume-title: Foundations of Bilevel Programming
  year: 2002
  ident: 1036_CR13
– volume: 16
  start-page: 93
  year: 2007
  ident: 1036_CR4
  publication-title: Prod. Oper. Manag.
  doi: 10.1111/j.1937-5956.2007.tb00168.x
– start-page: 57
  volume-title: Handbook of Metaheuristics, International Series in Operations Research & Management Science 272
  year: 2019
  ident: 1036_CR15
– volume: 259
  start-page: 191
  issue: 1–2
  year: 2017
  ident: 1036_CR20
  publication-title: Annals OR
  doi: 10.1007/s10479-017-2508-1
– volume: 190
  start-page: 1
  issue: 1
  year: 2008
  ident: 1036_CR2
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2007.06.008
– ident: 1036_CR21
  doi: 10.1007/978-1-4419-7572-0_12
– volume-title: Location Science
  year: 2015
  ident: 1036_CR6
– volume: 45
  start-page: 111
  issue: 1
  year: 2010
  ident: 1036_CR31
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-008-9170-0
– volume: 9
  start-page: 392
  issue: 3
  year: 2015
  ident: 1036_CR22
  publication-title: J. Appl. Indus. Math.
  doi: 10.1134/S1990478915030102
– volume: 15
  start-page: 917
  issue: 4
  year: 2015
  ident: 1036_CR29
  publication-title: Netw. Spat. Econ.
  doi: 10.1007/s11067-014-9276-0
– volume: 30
  start-page: 553
  year: 2003
  ident: 1036_CR3
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(02)00024-2
– volume: 64
  start-page: 1096
  issue: 4
  year: 2013
  ident: 1036_CR14
  publication-title: Comput Indus Eng
  doi: 10.1016/j.cie.2013.01.012
– volume: 46
  start-page: 153
  issue: 2
  year: 2012
  ident: 1036_CR5
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.1120.0410
– volume: 24
  start-page: 1097
  year: 1997
  ident: 1036_CR26
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(97)00031-2
– volume: 48
  start-page: 158
  year: 2005
  ident: 1036_CR32
  publication-title: J. Oper. Res. Soc. Japan
– volume: 39
  start-page: 437
  issue: 2
  year: 2012
  ident: 1036_CR23
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2011.05.007
– volume: 32
  start-page: 393
  year: 1987
  ident: 1036_CR28
  publication-title: EJOR
  doi: 10.1016/S0377-2217(87)80007-3
– volume: 44
  start-page: 390
  issue: 4
  year: 2001
  ident: 1036_CR33
  publication-title: J. Oper. Res. Soc. Japan
  doi: 10.1016/S0453-4514(01)80019-3
– volume: 75
  start-page: 677
  issue: 4
  year: 2014
  ident: 1036_CR12
  publication-title: Auto Remot Control
  doi: 10.1134/S0005117914040080
– ident: 1036_CR8
  doi: 10.1007/978-3-030-22629-9_10
– ident: 1036_CR7
  doi: 10.1007/978-3-319-44914-2_2
– volume: 39
  start-page: 40
  year: 2020
  ident: 1036_CR10
  publication-title: Comp. Appl. Math.
  doi: 10.1007/s40314-019-1025-z
– volume: 9
  start-page: 90
  issue: 3
  year: 2007
  ident: 1036_CR19
  publication-title: Comput. Sci. Eng.
  doi: 10.1109/MCSE.2007.55
– volume-title: Metaheuristics for bi-level optimization
  year: 2013
  ident: 1036_CR1
– volume-title: Facility Location
  year: 2009
  ident: 1036_CR16
– volume: 250
  start-page: 214
  issue: 1
  year: 2016
  ident: 1036_CR25
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2015.09.008
– year: 2019
  ident: 1036_CR18
  publication-title: J. Interconnect. Netw.
  doi: 10.1142/S021926591940005X
– volume: 39
  start-page: 41
  issue: 153
  year: 1929
  ident: 1036_CR17
  publication-title: Econ. J.
  doi: 10.2307/2224214
– volume: 231
  start-page: 734
  issue: 3
  year: 2013
  ident: 1036_CR24
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2013.06.006
– volume: 34
  start-page: 2463
  issue: 8
  year: 2020
  ident: 1036_CR9
  publication-title: Filomat.
  doi: 10.2298/FIL2008463C
– volume: 49
  start-page: 1145
  year: 1979
  ident: 1036_CR11
  publication-title: Econometrica
  doi: 10.2307/1911955
SSID ssj0009852
Score 2.3381832
Snippet This study considers the ( r ∣ p ) hub–centroid problem under the price war, which was recently proposed in the literature. The objective is profit...
This study considers the [Formula omitted] hub-centroid problem under the price war, which was recently proposed in the literature. The objective is profit...
This study considers the (r∣p) hub–centroid problem under the price war, which was recently proposed in the literature. The objective is profit maximization by...
SourceID proquest
gale
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 405
SubjectTerms Algorithms
Centroids
Competition
Computer Science
Equilibrium
Experiments
Game theory
Heuristic methods
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Price wars
Profit maximization
Profits
Real Functions
Search algorithms
Topology
SummonAdditionalLinks – databaseName: SpringerLink Journals (ICM)
  dbid: U2A
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLZ4XODAY4AYDJQDEiCotD7SJccJgRASnJjELWrSBJBgm_aAK0fu_AT-Gb8Eu0s33hLHqm5a1XZsJ_k-A-yYrK7DhLvA5tIGSVoXgQ6dQ1uWAi3MYASjQvH8Ij1tJWdX_MqDwvrlafdyS7KYqT-A3QTBwSIqf4lGV07DLCc6L7TiVtScUO2Kos9OXUY84DgLe6jMz2N8CkdfJ-Vvu6NF0DlZggWfLbLmSL3LMGXbFVgsOzEw75gVmP9AK4hX52Mu1n4Flr1Un-15jun9FTBN9oBVMuGmWJtWR9EUiOCYjSyfZXfXnd7t4OaeYVLLcDS213t7fu3us5uhfnt6Kc50dm5z5hvSMMKijQS7RFPEHrPeKrROji-PTgPfbyEwMReDwOgsjPO6c0JbgqkZK60J85Rrm6dWm0ZDumIJxGpJ-FqTojNz66jKFGnciNdgpt1p23VgTpgGz12isxjrrYxrLnSeJERO73KZ2iqE5W9XxpORU0-MOzWhUSZVKVSVKlSlZBUOxs90R1Qcf0rvkjYV-SmObDIPN8DvI8Yr1SRqwCTGjKcKtVLhyjtwX0UYxKWQmA1V4bA0gsnt39-78T_xTZiLCFBRHACuwcygN7RbmOYM9HZh1e8PtfMn
  priority: 102
  providerName: Springer Nature
Title A variable neighborhood search algorithm for the (r∣p) hub–centroid problem under the price war
URI https://link.springer.com/article/10.1007/s10898-021-01036-9
https://www.proquest.com/docview/2678989129
Volume 83
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVEBS
  databaseName: EBSCOhost Mathematics Source - trial do 30.11.2025
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20241102
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: AMVHM
  dateStart: 20080329
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source
  providerName: EBSCOhost
– providerCode: PRVLSH
  databaseName: SpringerLink Journals
  customDbUrl:
  mediaType: online
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: AFBBN
  dateStart: 19910301
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1573-2916
  dateEnd: 20241102
  omitProxy: true
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20241102
  omitProxy: true
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: 8FG
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK - Czech Republic Consortium
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: AGYKE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://link.springer.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: SpringerLink Journals (ICM)
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: U2A
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.springerlink.com/journals/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3NTxNBFH-B9qIHI6ixCs0cSIToxu7HbGcOhCykhWhojLEJniY7X2KCbW2LXjly50_gP-Mv4b3tLBWNHHd3dnYz72vezPx-D2DLlB0dZ9xHzkoXZXlHRDr2HnVZCtQwgxGMEsXjQX40zD6c8JMVGNRYGDpWWfvEylHbsaE18vcJelUpJIanvcnPiKpG0e5qXUKjDKUV7G5FMbYKzYSYsRrQ3O8NPn1e0vCKqgZPRyY84uihA4wmgOkEwc0SSq-JplfeC1V_O-x_dk6rgNR_Ck_CTJIVC9GvwYobrcPjP_gF8er4jpR1tg5rwY5nbDuQTe88A1OwX5guE4CKjWiZFHWCmI7ZwgRYefYNR2F--oPh7JZhb2x7enN5Pdlhp-f65uKqOtw5_m5ZqEzDCJS2aDghviL2u5w-h2G_9-XgKAqFFyKTcjGPjC7j1Ha8F9oRXs046Uxsc66dzZ023a701VqI05KAtiZHq-bOU7op8rSbvoDGaDxyL4F5Ybrc-kyXKSZeJddcaJtlxFLvrcxdC-J6jJUJrORUHONMLfmUSS4K5aIquSjZgrd370wWnBwPtn5DolNksNizKQPuAP-PqK9UQRyBWYpTnxZs1NJVwZJnaql3LXhXS3z5-P_fffVwb6_hUUJIiurk7wY05tNzt4nzm7luw6roH7ahWRx-_dhrBxXGu8OkuAUmS_n6
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NbtNAEB6V9gAcKlpAhBbYA4hWYBHbu87uoUIBWqW0iRBqpd4W7x9FKkmapK24ceTOI_AePEyfhBln3fAjeuvR8nps7YznZ3e_bwAe27JpUi5C4p3yCS-aMjFpCGjLSqKFWYxgVCh2e0Vnn789EAdz8LPGwtCxytonVo7aDSytkb_I0KsqqTA8vRweJ9Q1inZX6xYaZWyt4DYqirEI7NjxX86whBtvbL9BfT_Jsq3NvdedJHYZSGwu5CSxpkxz1wxBGk_gLOuVt6krhPGu8Ma2WipUhb83ilCltkATFj5QbSWLvJWj3GuwwHOusPhbeLXZe_d-Rvsrq54_TZWJRGBEiLCdCN6TBG_LqJwnWmD1R2j8O0D8s1NbBcCtW7AYM1fWnpraEsz5_jLc_I3PEK-6FySw42VYin5jzNYiufX6bbBtdorlOQG2WJ-WZdEGiVmZTeeSlUcfcdYnh58ZZtMMpbG10fm3H8N1dnhizr9-rw6TDj45FjvhMALBTQcOiR-JnZWjO7B_JSq4C_P9Qd_fAxakbQkXuClzLPRKYYQ0jnNixQ9OFb4BaT3H2kYWdGrGcaRn_M2kF4160ZVetGrAs4tnhlMOkEtHPyXVaXIQKNmWEeeA30dUW7pNnIQ8x1SrAau1dnX0HGM9s_MGPK81Prv9__fev1zaI7je2evu6t3t3s4K3MgIxVGdOl6F-cnoxD_A3GpiHkYDZvDhqv-ZX9TKM-w
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NThRBEK4gJEYORFDjCkIfNEJ0ws5Pz3QfDNmAK4gQD5Jwa6f_wAR3190Fws2jdx_Bt_BxeBKqZnpYfyI3jpOZqZl0VVd1ddf3FcAzU7Z1nHEfOStdlOVtEenYe7RlKdDCDEYwShT39vPtg-zdIT-cgl8NFobKKhufWDlq2ze0R76eoFeVQmJ4WvehLOLDVndj8DWiDlJ00tq006hNZNddnGP6Nnq9s4W6fp4k3TcfN7ej0GEgMikX48joMk5t23uhHQGzjJPOxDbn2tncaVMU0ldJv9OSEKUmR_PlzlNeJfK0SFHuHZgpiMWdUOrdtxPCX1F1-2nLhEccY0EA7ATYniBgW0KJPBECyz-C4t-h4Z8z2ir0de_DXFizsk5tZPMw5XoLMPsbkyFe7V3Tv44WYD54jBFbDbTWaw_AdNgZJuYE1WI92pBF6yNOZVaPJCtPjnCMx8dfGK6jGUpjq8PL7z8Ha-z4VF9--1GVkfY_WxZ64DCCv9UPDogZiZ2Xw4dwcCsKeATTvX7PPQbmhSm49ZkuU0zxSq650DbLiA_fW5m7FsTNGCsT-M-pDceJmjA3k14U6kVVelGyBS-v3xnU7B83Pv2CVKfINaBkUwaEA_4fkWypDrERZikuslqw1GhXBZ8xUhMLb8GrRuOT2___7pObpa3AXZwp6v3O_u4i3EsIvlGVGy_B9Hh46p7iomqslyvrZfDptqfLFV-KMYY
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+variable+neighborhood+search+algorithm+for+the+%5BFormula+omitted%5D+hub-centroid+problem+under+the+price+war&rft.jtitle=Journal+of+global+optimization&rft.au=Cvokic%2C+Dimitrije+D&rft.au=Kochetov%2C+Yury+A&rft.au=Plyasunov%2C+Aleksandr+V&rft.au=Savic%2C+Aleksandar&rft.date=2022-07-01&rft.pub=Springer&rft.issn=0925-5001&rft.volume=83&rft.issue=3&rft.spage=405&rft_id=info:doi/10.1007%2Fs10898-021-01036-9&rft.externalDocID=A707943215
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon