Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement

This study examines the winner determination problem (WDP) for the procurement of transportation service. The problem contains three important roles, namely, shippers, carriers, and third-party carriers. Shippers determine the service lanes that can be outsourced to carriers so that the transportati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Physica A Jg. 535; S. 122286
Hauptverfasser: Yang, Fang, Huang, Yao-Huei, Li, Jun
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.12.2019
Schlagworte:
ISSN:0378-4371, 1873-2119
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This study examines the winner determination problem (WDP) for the procurement of transportation service. The problem contains three important roles, namely, shippers, carriers, and third-party carriers. Shippers determine the service lanes that can be outsourced to carriers so that the transportation service cost may be reduced. The WDP can be formulated as a mixed integer linear programming (MILP) model. However, when solving a general MILP model, it is easy to fall into the imbalanced issue of branch-and-bound trees, such that the computational time becomes longer. This study proposes a deterministic model with a powerful and significant theoretical mechanism to conquer the imbalanced issue. Solving the proposed model can minimize the service costs subject to each lane being served by carriers and consider the quantity discount. The most important objective in this study is to identify an iterative algorithm that embeds the proposed model, which presents all alternative solutions for shippers to consider better options. Numerical experiment is also presented to confirm the usefulness of the proposed method. •An efficient formulation model is proposed.•The quantity-discount procurement in the auction is considered.•Optimal solution is obtained.•Identifying all alternative optimal solutions for the shipper to consider better options.•The proposed method with powerful theorem is also applicable to the expert and intelligent system.
AbstractList This study examines the winner determination problem (WDP) for the procurement of transportation service. The problem contains three important roles, namely, shippers, carriers, and third-party carriers. Shippers determine the service lanes that can be outsourced to carriers so that the transportation service cost may be reduced. The WDP can be formulated as a mixed integer linear programming (MILP) model. However, when solving a general MILP model, it is easy to fall into the imbalanced issue of branch-and-bound trees, such that the computational time becomes longer. This study proposes a deterministic model with a powerful and significant theoretical mechanism to conquer the imbalanced issue. Solving the proposed model can minimize the service costs subject to each lane being served by carriers and consider the quantity discount. The most important objective in this study is to identify an iterative algorithm that embeds the proposed model, which presents all alternative solutions for shippers to consider better options. Numerical experiment is also presented to confirm the usefulness of the proposed method. •An efficient formulation model is proposed.•The quantity-discount procurement in the auction is considered.•Optimal solution is obtained.•Identifying all alternative optimal solutions for the shipper to consider better options.•The proposed method with powerful theorem is also applicable to the expert and intelligent system.
ArticleNumber 122286
Author Li, Jun
Huang, Yao-Huei
Yang, Fang
Author_xml – sequence: 1
  givenname: Fang
  surname: Yang
  fullname: Yang, Fang
  email: yangfang@my.swjtu.edu.cn
  organization: School of Economics and Management, Southwest Jiaotong University, Chengdu, 610031, China
– sequence: 2
  givenname: Yao-Huei
  surname: Huang
  fullname: Huang, Yao-Huei
  email: yaohuei.huang@home.swjtu.edu.cn
  organization: Department of Information Management, Fu Jen Catholic University, New Taipei City, Taiwan
– sequence: 3
  givenname: Jun
  surname: Li
  fullname: Li, Jun
  email: lijun@my.swjtu.edu.cn
  organization: School of Economics and Management, Southwest Jiaotong University, Chengdu, 610031, China
BookMark eNqFkL1OwzAUhS1UJNrCE7D4BRL8kzTxwFBV_EmVWGC2EueaukrsYLtFlXh4EsLEANMdzvdd6ZwFmllnAaFrSlJK6Opmn_a7U6hSRqhIKWOsXJ2hOS0LnjBKxQzNCS_KJOMFvUCLEPaEEFpwNkef6zaCt1U0R8DBtYdonMVV--a8ibsOa-fxh7EWPG5gIDszsgPSe1e30A1h3OH3Q2WjiSfcmKDcwUbsNI6-sqF3Pk5CAH80CkZRHTx0YOMlOtdVG-Dq5y7R6_3dy-Yx2T4_PG3W20RxwmPCGAilM6XymtWKgxaUN1SoJhMlr3mVU67zTPASBiRvMsYo06osyobUuhyCJeLTX-VdCB607L3pKn-SlMhxQLmX3wPKcUA5DThY4pelzNRlaGbaf9zbyYWh1tGAl0EZsAoa40FF2Tjzp_8FbfyU1Q
CitedBy_id crossref_primary_10_1007_s10479_022_05029_z
crossref_primary_10_1007_s10898_021_01035_w
crossref_primary_10_1016_j_eswa_2023_122005
crossref_primary_10_1016_j_jclepro_2021_128833
crossref_primary_10_1016_j_engappai_2021_104424
crossref_primary_10_3389_fsufs_2025_1585053
crossref_primary_10_1038_s41598_025_94748_x
Cites_doi 10.1057/palgrave.jors.2602131
10.1016/j.trb.2015.03.019
10.1287/inte.32.5.4.30
10.1137/0123007
10.12660/joscmv3n1p55-66
10.1007/3-540-36626-1_3
10.1287/ijoc.2016.0716
10.1016/j.ejor.2006.11.024
10.1016/j.trc.2013.07.006
10.1016/j.cor.2018.08.010
10.1016/j.disopt.2012.10.001
10.1287/inte.33.1.23.12717
10.1002/j.2158-1592.2003.tb00048.x
10.1016/j.ijpe.2018.01.035
10.1016/j.physa.2018.03.062
10.1287/ijoc.1120.0527
10.1007/s11067-013-9214-6
10.1016/j.ejor.2006.01.010
10.1287/trsc.1090.0273
10.1007/BF00132502
10.1080/02331934.2013.877906
10.1016/j.tre.2009.02.002
10.1016/j.ejor.2006.01.034
10.1016/j.orl.2013.09.004
10.1016/j.cie.2018.05.042
ContentType Journal Article
Copyright 2019 Elsevier B.V.
Copyright_xml – notice: 2019 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.physa.2019.122286
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 1873-2119
ExternalDocumentID 10_1016_j_physa_2019_122286
S0378437119313251
GroupedDBID --K
--M
-DZ
-~X
.~1
0R~
1B1
1RT
1~.
1~5
4.4
457
4G.
7-5
71M
8P~
9JN
9JO
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAPFB
AAXUO
ABAOU
ABMAC
ABNEU
ABYKQ
ACAZW
ACDAQ
ACFVG
ACGFS
ACNCT
ACRLP
ADBBV
ADEZE
ADFHU
ADGUI
AEBSH
AEKER
AEYQN
AFFNX
AFKWA
AFTJW
AGHFR
AGTHC
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIIAU
AIKHN
AITUG
AIVDX
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
AXJTR
AXLSJ
BKOJK
BLXMC
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
IHE
IXIXF
J1W
K-O
KOM
M38
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OGIMB
OZT
P-8
P-9
P2P
PC.
Q38
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SPC
SPCBC
SPD
SSB
SSF
SSQ
SSW
SSZ
T5K
TN5
TWZ
WH7
XPP
YNT
ZMT
~02
~G-
29O
5VS
6TJ
9DU
AAFFL
AAQFI
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABFNM
ABJNI
ABWVN
ABXDB
ACLOT
ACNNM
ACROA
ACRPL
ADMUD
ADNMO
ADVLN
AEIPS
AFJKZ
AFODL
AGQPQ
AIIUN
AJWLA
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
BBWZM
BEHZQ
BEZPJ
BGSCR
BNTGB
BPUDD
BULVW
BZJEE
CITATION
EFKBS
FEDTE
FGOYB
HMV
HVGLF
HZ~
MVM
NDZJH
R2-
SEW
SPG
VOH
WUQ
XOL
YYP
ZY4
~HD
ID FETCH-LOGICAL-c303t-22e9cf4cc5b2bc3ef913d19cd4983b3a513f54938ecc55d42212fc878d0bf8493
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000498749000044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0378-4371
IngestDate Sat Nov 29 07:13:44 EST 2025
Tue Nov 18 22:33:50 EST 2025
Fri Feb 23 02:47:17 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Winner determination problem
Mixed integer linear programming model
Transportation service
Alternative solutions
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c303t-22e9cf4cc5b2bc3ef913d19cd4983b3a513f54938ecc55d42212fc878d0bf8493
ParticipantIDs crossref_primary_10_1016_j_physa_2019_122286
crossref_citationtrail_10_1016_j_physa_2019_122286
elsevier_sciencedirect_doi_10_1016_j_physa_2019_122286
PublicationCentury 2000
PublicationDate 2019-12-01
2019-12-00
PublicationDateYYYYMMDD 2019-12-01
PublicationDate_xml – month: 12
  year: 2019
  text: 2019-12-01
  day: 01
PublicationDecade 2010
PublicationTitle Physica A
PublicationYear 2019
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Hohner, Rich, Ng, Reid, Davenport, Kalagnanam, …, An (b19) 2003; 33
Lehmann, Müller, Sandholm (b11) 2006; 29
Yadati, Oliveira, Pardalos (b22) 2007; 9
Remli, Rekik (b17) 2013; 35
Gujo, Schwind (b15) 2007
Manerba, Mansini, Perboli (b24) 2018; 198
Guo, Lim, Zhu, Rodrigues (b13) 2003
Caplice, Sheffi (b6) 2006
Tsai (b20) 2006; 177
Chopra, Meindl (b1) 2007
Mirzaee, Naderi, Pasandideh (b26) 2018; 122
Caplice, Sheffi (b12) 2003; 24
Guo, Lim, Rodrigues, Zhu (b14) 2006; 57
Ledyard, Olson, Porter, Swanson, Torma (b7) 2002; 32
Li, Huang, Fang (b30) 2017; 29
Li, Huang, Fang (b29) 2013; 25
Tsai, Wang, Lin (b32) 2015; 64
Babayev (b36) 1997; 2
Yıldız, Vielma (b28) 2013; 41
Manerba, Perboli (b27) 2019; 101
Chen, AhmadBeygi, Cohn, Beil, Sinha (b4) 2009; 43
Martins, Xavier, de Souza Filho, Martins (b3) 2010; 3
GUROBI, Gurobi optimization, Inc., 2017
Kameshwaran, Narahari, Rosa, Kulkarni, Tew (b21) 2007; 179
Elmaghraby, Keskinocak (b8) 2004
Zhang, Ding, Li, Wang, Yao (b18) 2014; 14
Li, Yang, Wu, He, Zhao (b25) 2018; 505
Ma, Kwon, Lee (b16) 2010; 46
.
Zhang, Yao, Friesz, Sun (b5) 2015; 78
Ma (b10) 2008
Lu (b31) 2013; 10
Tsai, Lin, Hu (b34) 2008; 84
De Vries, Vohra (b9) 2003
Sanders (b2) 2012
Verma, Hemachandra, Narahari, Tew (b23) 2014; 28
Balas, Jeroslow (b33) 1972; 23
Hohner (10.1016/j.physa.2019.122286_b19) 2003; 33
10.1016/j.physa.2019.122286_b35
Guo (10.1016/j.physa.2019.122286_b14) 2006; 57
Balas (10.1016/j.physa.2019.122286_b33) 1972; 23
Caplice (10.1016/j.physa.2019.122286_b6) 2006
Elmaghraby (10.1016/j.physa.2019.122286_b8) 2004
Mirzaee (10.1016/j.physa.2019.122286_b26) 2018; 122
Chopra (10.1016/j.physa.2019.122286_b1) 2007
Sanders (10.1016/j.physa.2019.122286_b2) 2012
Babayev (10.1016/j.physa.2019.122286_b36) 1997; 2
Kameshwaran (10.1016/j.physa.2019.122286_b21) 2007; 179
Ledyard (10.1016/j.physa.2019.122286_b7) 2002; 32
Martins (10.1016/j.physa.2019.122286_b3) 2010; 3
Manerba (10.1016/j.physa.2019.122286_b24) 2018; 198
De Vries (10.1016/j.physa.2019.122286_b9) 2003
Guo (10.1016/j.physa.2019.122286_b13) 2003
Tsai (10.1016/j.physa.2019.122286_b32) 2015; 64
Yadati (10.1016/j.physa.2019.122286_b22) 2007; 9
Lehmann (10.1016/j.physa.2019.122286_b11) 2006; 29
Li (10.1016/j.physa.2019.122286_b29) 2013; 25
Caplice (10.1016/j.physa.2019.122286_b12) 2003; 24
Li (10.1016/j.physa.2019.122286_b30) 2017; 29
Zhang (10.1016/j.physa.2019.122286_b5) 2015; 78
Gujo (10.1016/j.physa.2019.122286_b15) 2007
Tsai (10.1016/j.physa.2019.122286_b20) 2006; 177
Tsai (10.1016/j.physa.2019.122286_b34) 2008; 84
Chen (10.1016/j.physa.2019.122286_b4) 2009; 43
Remli (10.1016/j.physa.2019.122286_b17) 2013; 35
Li (10.1016/j.physa.2019.122286_b25) 2018; 505
Lu (10.1016/j.physa.2019.122286_b31) 2013; 10
Ma (10.1016/j.physa.2019.122286_b16) 2010; 46
Yıldız (10.1016/j.physa.2019.122286_b28) 2013; 41
Ma (10.1016/j.physa.2019.122286_b10) 2008
Zhang (10.1016/j.physa.2019.122286_b18) 2014; 14
Manerba (10.1016/j.physa.2019.122286_b27) 2019; 101
Verma (10.1016/j.physa.2019.122286_b23) 2014; 28
References_xml – volume: 25
  start-page: 643
  year: 2013
  end-page: 653
  ident: b29
  article-title: A logarithmic method for reducing binary variables and inequality constraints in solving task assignment problems
  publication-title: INFORMS J. Comput.
– year: 2012
  ident: b2
  article-title: Supply Chain Management: A Global Perspective
– volume: 14
  start-page: 159
  year: 2014
  end-page: 181
  ident: b18
  article-title: A sampling-based stochastic winner determination model for truckload service procurement
  publication-title: Netw. Spat. Econ.
– volume: 41
  start-page: 654
  year: 2013
  end-page: 658
  ident: b28
  article-title: Incremental and encoding formulations for mixed integer programming
  publication-title: Oper. Res. Lett.
– volume: 3
  start-page: 55
  year: 2010
  end-page: 66
  ident: b3
  article-title: Transport management in small and medium-sized enterprises in Brazil
  publication-title: J. Oper. Supply Chain Manag.
– start-page: 245
  year: 2004
  end-page: 258
  ident: b8
  article-title: Combinatorial auctions in procurement
  publication-title: The Practice of Supply Chain Management: Where Theory and Application Converge
– volume: 177
  start-page: 982
  year: 2006
  end-page: 994
  ident: b20
  article-title: An optimization approach for supply chain management models with quantity discount policy
  publication-title: European J. Oper. Res.
– volume: 10
  start-page: 11
  year: 2013
  end-page: 24
  ident: b31
  article-title: A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
  publication-title: Discrete Optim.
– volume: 28
  start-page: 9
  year: 2014
  end-page: 315
  ident: b23
  article-title: Winner determination in multi-unit procurement auctions with volume discount bids and lead time constraints
  publication-title: Appl. Multi-Criteria Game Theory Approaches
– volume: 43
  start-page: 493
  year: 2009
  end-page: 510
  ident: b4
  article-title: Solving truckload procurement auctions over an exponential number of bundles
  publication-title: Transp. Sci.
– volume: 198
  start-page: 119
  year: 2018
  end-page: 132
  ident: b24
  article-title: The capacitated supplier selection problem with total quantity discount policy and activation costs under uncertainty
  publication-title: Int. J. Prod. Econ.
– start-page: 265
  year: 2007
  end-page: 275
  ident: b1
  article-title: Supply chain management
  publication-title: Das Summa Summarum Des Management
– volume: 24
  start-page: 109
  year: 2003
  end-page: 128
  ident: b12
  article-title: Optimization-based procurement for transportation services
  publication-title: J. Bus. Logist.
– year: 2008
  ident: b10
  article-title: Combinatorial auctions for truckload transportation procurement
– start-page: 303
  year: 2007
  end-page: 315
  ident: b15
  article-title: Bid formation in a combinatorial auction for logistics services
  publication-title: International Conference on Enterprise Information Systems
– volume: 179
  start-page: 518
  year: 2007
  end-page: 536
  ident: b21
  article-title: Multi-attribute electronic procurement using goal programming
  publication-title: European J. Oper. Res.
– volume: 9
  start-page: 51
  year: 2007
  end-page: 66
  ident: b22
  article-title: An approximate winner determination algorithm for hybrid procurement mechanisms logistics
  publication-title: Adv. Comput. Manag. Sci.
– start-page: 290
  year: 2003
  end-page: 294
  ident: b13
  article-title: Transportation bid analysis optimization with shipper input
  publication-title: Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence
– volume: 57
  start-page: 1472
  year: 2006
  end-page: 1481
  ident: b14
  article-title: Carrier assignment models in transportation procurement
  publication-title: J. Oper. Res. Soc.
– volume: 35
  start-page: 204
  year: 2013
  end-page: 217
  ident: b17
  article-title: A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes
  publication-title: Transp. Res. C
– volume: 101
  start-page: 29
  year: 2019
  end-page: 42
  ident: b27
  article-title: New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
  publication-title: Comput. Oper. Res.
– volume: 29
  start-page: 7
  year: 2006
  end-page: 318
  ident: b11
  article-title: The winner determination problem
  publication-title: Combinator. Auctions
– volume: 122
  start-page: 292
  year: 2018
  end-page: 302
  ident: b26
  article-title: A preemptive fuzzy goal programming model for generalized supplier selection and order allocation with incremental discount
  publication-title: Comput. Ind. Eng.
– volume: 33
  start-page: 23
  year: 2003
  end-page: 35
  ident: b19
  article-title: Combinatorial and quantity-discount procurement auctions benefit Mars, Incorporated and its suppliers
  publication-title: Interfaces
– volume: 2
  start-page: 313
  year: 1997
  end-page: 320
  ident: b36
  article-title: Piece-wise linear approximation of functions of two variables
  publication-title: J. Heuristics
– volume: 84
  start-page: 802
  year: 2008
  end-page: 809
  ident: b34
  article-title: Finding multiple solutions to general integer linear programs
  publication-title: European J. Oper. Res.
– volume: 23
  start-page: 61
  year: 1972
  end-page: 69
  ident: b33
  article-title: Canonical cuts on the unit hypercube
  publication-title: SIAM J. Appl. Math.
– volume: 505
  start-page: 512
  year: 2018
  end-page: 522
  ident: b25
  article-title: Discount pricing in word-of-mouth marketing: An optimal control approach
  publication-title: Physica A
– start-page: 284
  year: 2003
  end-page: 309
  ident: b9
  article-title: Combinatorial Auctions: A Survey, vol. 15(3)
– volume: 64
  start-page: 2601
  year: 2015
  end-page: 2618
  ident: b32
  article-title: A global optimization approach for solving three-dimensional open dimension rectangular packing problems
  publication-title: Optimization
– volume: 29
  start-page: 108
  year: 2017
  end-page: 122
  ident: b30
  article-title: Linear reformulation of polynomial discrete programming for fast computation
  publication-title: INFORMS J. Comput.
– reference: .
– volume: 46
  start-page: 49
  year: 2010
  end-page: 60
  ident: b16
  article-title: A stochastic programming winner determination model for truckload procurement under shipper uncertainty
  publication-title: Transp. Res. E
– start-page: 539
  year: 2006
  end-page: 572
  ident: b6
  article-title: Combinatorial auctions for truckload transportation
  publication-title: Combinator. Auctions
– volume: 32
  start-page: 4
  year: 2002
  end-page: 12
  ident: b7
  article-title: The first use of a combined-value auction for transportation services
  publication-title: Interfaces
– reference: GUROBI, Gurobi optimization, Inc., 2017,
– volume: 78
  start-page: 16
  year: 2015
  end-page: 31
  ident: b5
  article-title: A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions
  publication-title: Transp. Res. B
– start-page: 265
  year: 2007
  ident: 10.1016/j.physa.2019.122286_b1
  article-title: Supply chain management
– volume: 57
  start-page: 1472
  issue: 12
  year: 2006
  ident: 10.1016/j.physa.2019.122286_b14
  article-title: Carrier assignment models in transportation procurement
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/palgrave.jors.2602131
– ident: 10.1016/j.physa.2019.122286_b35
– volume: 78
  start-page: 16
  year: 2015
  ident: 10.1016/j.physa.2019.122286_b5
  article-title: A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions
  publication-title: Transp. Res. B
  doi: 10.1016/j.trb.2015.03.019
– volume: 32
  start-page: 4
  issue: 5
  year: 2002
  ident: 10.1016/j.physa.2019.122286_b7
  article-title: The first use of a combined-value auction for transportation services
  publication-title: Interfaces
  doi: 10.1287/inte.32.5.4.30
– start-page: 245
  year: 2004
  ident: 10.1016/j.physa.2019.122286_b8
  article-title: Combinatorial auctions in procurement
– volume: 23
  start-page: 61
  issue: 1
  year: 1972
  ident: 10.1016/j.physa.2019.122286_b33
  article-title: Canonical cuts on the unit hypercube
  publication-title: SIAM J. Appl. Math.
  doi: 10.1137/0123007
– start-page: 303
  year: 2007
  ident: 10.1016/j.physa.2019.122286_b15
  article-title: Bid formation in a combinatorial auction for logistics services
– volume: 28
  start-page: 9
  year: 2014
  ident: 10.1016/j.physa.2019.122286_b23
  article-title: Winner determination in multi-unit procurement auctions with volume discount bids and lead time constraints
  publication-title: Appl. Multi-Criteria Game Theory Approaches
– volume: 3
  start-page: 55
  issue: 1
  year: 2010
  ident: 10.1016/j.physa.2019.122286_b3
  article-title: Transport management in small and medium-sized enterprises in Brazil
  publication-title: J. Oper. Supply Chain Manag.
  doi: 10.12660/joscmv3n1p55-66
– volume: 9
  start-page: 51
  issue: 1
  year: 2007
  ident: 10.1016/j.physa.2019.122286_b22
  article-title: An approximate winner determination algorithm for hybrid procurement mechanisms logistics
  publication-title: Adv. Comput. Manag. Sci.
  doi: 10.1007/3-540-36626-1_3
– volume: 29
  start-page: 108
  issue: 1
  year: 2017
  ident: 10.1016/j.physa.2019.122286_b30
  article-title: Linear reformulation of polynomial discrete programming for fast computation
  publication-title: INFORMS J. Comput.
  doi: 10.1287/ijoc.2016.0716
– volume: 84
  start-page: 802
  year: 2008
  ident: 10.1016/j.physa.2019.122286_b34
  article-title: Finding multiple solutions to general integer linear programs
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2006.11.024
– volume: 35
  start-page: 204
  year: 2013
  ident: 10.1016/j.physa.2019.122286_b17
  article-title: A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes
  publication-title: Transp. Res. C
  doi: 10.1016/j.trc.2013.07.006
– volume: 101
  start-page: 29
  year: 2019
  ident: 10.1016/j.physa.2019.122286_b27
  article-title: New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2018.08.010
– volume: 10
  start-page: 11
  issue: 1
  year: 2013
  ident: 10.1016/j.physa.2019.122286_b31
  article-title: A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2012.10.001
– start-page: 290
  year: 2003
  ident: 10.1016/j.physa.2019.122286_b13
  article-title: Transportation bid analysis optimization with shipper input
– volume: 33
  start-page: 23
  issue: 1
  year: 2003
  ident: 10.1016/j.physa.2019.122286_b19
  article-title: Combinatorial and quantity-discount procurement auctions benefit Mars, Incorporated and its suppliers
  publication-title: Interfaces
  doi: 10.1287/inte.33.1.23.12717
– volume: 29
  start-page: 7
  year: 2006
  ident: 10.1016/j.physa.2019.122286_b11
  article-title: The winner determination problem
  publication-title: Combinator. Auctions
– start-page: 539
  year: 2006
  ident: 10.1016/j.physa.2019.122286_b6
  article-title: Combinatorial auctions for truckload transportation
  publication-title: Combinator. Auctions
– volume: 24
  start-page: 109
  issue: 2
  year: 2003
  ident: 10.1016/j.physa.2019.122286_b12
  article-title: Optimization-based procurement for transportation services
  publication-title: J. Bus. Logist.
  doi: 10.1002/j.2158-1592.2003.tb00048.x
– volume: 198
  start-page: 119
  year: 2018
  ident: 10.1016/j.physa.2019.122286_b24
  article-title: The capacitated supplier selection problem with total quantity discount policy and activation costs under uncertainty
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2018.01.035
– volume: 505
  start-page: 512
  year: 2018
  ident: 10.1016/j.physa.2019.122286_b25
  article-title: Discount pricing in word-of-mouth marketing: An optimal control approach
  publication-title: Physica A
  doi: 10.1016/j.physa.2018.03.062
– volume: 25
  start-page: 643
  issue: 4
  year: 2013
  ident: 10.1016/j.physa.2019.122286_b29
  article-title: A logarithmic method for reducing binary variables and inequality constraints in solving task assignment problems
  publication-title: INFORMS J. Comput.
  doi: 10.1287/ijoc.1120.0527
– volume: 14
  start-page: 159
  issue: 2
  year: 2014
  ident: 10.1016/j.physa.2019.122286_b18
  article-title: A sampling-based stochastic winner determination model for truckload service procurement
  publication-title: Netw. Spat. Econ.
  doi: 10.1007/s11067-013-9214-6
– volume: 179
  start-page: 518
  issue: 2
  year: 2007
  ident: 10.1016/j.physa.2019.122286_b21
  article-title: Multi-attribute electronic procurement using goal programming
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2006.01.010
– year: 2008
  ident: 10.1016/j.physa.2019.122286_b10
– volume: 43
  start-page: 493
  issue: 4
  year: 2009
  ident: 10.1016/j.physa.2019.122286_b4
  article-title: Solving truckload procurement auctions over an exponential number of bundles
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.1090.0273
– volume: 2
  start-page: 313
  year: 1997
  ident: 10.1016/j.physa.2019.122286_b36
  article-title: Piece-wise linear approximation of functions of two variables
  publication-title: J. Heuristics
  doi: 10.1007/BF00132502
– volume: 64
  start-page: 2601
  issue: 12
  year: 2015
  ident: 10.1016/j.physa.2019.122286_b32
  article-title: A global optimization approach for solving three-dimensional open dimension rectangular packing problems
  publication-title: Optimization
  doi: 10.1080/02331934.2013.877906
– start-page: 284
  year: 2003
  ident: 10.1016/j.physa.2019.122286_b9
– volume: 46
  start-page: 49
  issue: 1
  year: 2010
  ident: 10.1016/j.physa.2019.122286_b16
  article-title: A stochastic programming winner determination model for truckload procurement under shipper uncertainty
  publication-title: Transp. Res. E
  doi: 10.1016/j.tre.2009.02.002
– volume: 177
  start-page: 982
  issue: 2
  year: 2006
  ident: 10.1016/j.physa.2019.122286_b20
  article-title: An optimization approach for supply chain management models with quantity discount policy
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2006.01.034
– year: 2012
  ident: 10.1016/j.physa.2019.122286_b2
– volume: 41
  start-page: 654
  issue: 6
  year: 2013
  ident: 10.1016/j.physa.2019.122286_b28
  article-title: Incremental and encoding formulations for mixed integer programming
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2013.09.004
– volume: 122
  start-page: 292
  year: 2018
  ident: 10.1016/j.physa.2019.122286_b26
  article-title: A preemptive fuzzy goal programming model for generalized supplier selection and order allocation with incremental discount
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2018.05.042
SSID ssj0001732
Score 2.343652
Snippet This study examines the winner determination problem (WDP) for the procurement of transportation service. The problem contains three important roles, namely,...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 122286
SubjectTerms Alternative solutions
Mixed integer linear programming model
Transportation service
Winner determination problem
Title Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement
URI https://dx.doi.org/10.1016/j.physa.2019.122286
Volume 535
WOSCitedRecordID wos000498749000044&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: PRVESC
  databaseName: ScienceDirect database
  customDbUrl:
  eissn: 1873-2119
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001732
  issn: 0378-4371
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELZaaCUuVZ8qr8qH3rZB6zjZ2MdVBaI9IA4gLafIj7hdtM3CPnhI_HjGr2yWohUcuESRYztW5sv483g8g9B3LqRJpe4mklMBCxSmE6a4TEiW6qIrhGW1LtlEcXTEBgN-HLZipi6dQFHX7OaGX7yoqKEMhG2Pzj5D3E2nUAD3IHS4gtjh-iTB90fBxndVdeKbOmL0ZzwZzv7-c26F1y7hVkdHVxhXJaSW8ZbZy7mw53dv7QaOSyfhfAliIHTfYOrVjG2ogpmxTXWPPQIWxtKzYJo-EGG2dGgKhWdinBzOq2HjIDT0Z0bqtlmC8JaLRziOBcvTjPr8KlHV5jRvKUtirU-9R_W4Nymc71nzjo0ORfjeovZy1OwHs1njYxjd185L10lpOyl9J6_RelrkHJTgev_X_uB3M3WTgvptpzD2GKbKOQT-N5bHqUyLnpy8R-_CugL3PR4-oFdV_RG99TKYfkJ3LVTgiArcoAIDKrBHBV5CBQ6owBYVOKICR1TgscHLqMABFbiFis_o9GD_5OdhEhJvJAoYzSxJ04orkymVy1QqWhlOqCZc6YwzKqnICTV5ximD_z_PdZYC_zGKFUx3pWHw4Ataq8d19RXBmDlMI10lDVUZMZmksuI9rbWBdSxQ-02Uxm9YqhCV3iZHGZUr5LeJfjSNLnxQltXVe1E4ZeCVni-WALdVDbee955ttLH4E3bQ2mwyr3bRG3U1G04n3wLW7gGaR6I2
linkProvider Elsevier
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=Alternative+solution+algorithm+for+winner+determination+problem+with+quantity+discount+of+transportation+service+procurement&rft.jtitle=Physica+A&rft.au=Yang%2C+Fang&rft.au=Huang%2C+Yao-Huei&rft.au=Li%2C+Jun&rft.date=2019-12-01&rft.issn=0378-4371&rft.volume=535&rft.spage=122286&rft_id=info:doi/10.1016%2Fj.physa.2019.122286&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_physa_2019_122286
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0378-4371&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0378-4371&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0378-4371&client=summon