The freight routing problem of time-definite freight delivery common carriers

The freight routing problem of time-definite common carriers is to minimize the sum of handling and transportation costs, while meeting service commitments and operational restrictions. There are two types of operational restrictions, capacity and directed in-tree rooted at each destination. Directe...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part B: methodological Vol. 35; no. 6; pp. 525 - 547
Main Author: Lin, Cheng-Chang
Format: Journal Article
Language:English
Published: Kidlington Elsevier Ltd 01.07.2001
Elsevier
Series:Transportation Research Part B: Methodological
Subjects:
Applied sciences
Exact sciences and technology
Ground, air and sea transportation, marine construction
Hub-and-spoke network
Implicit enumeration algorithm
Lagrangian relaxation
Road transportation and traffic
Time-definite freight delivery industry
Transportation planning, management and economics
Hub-and-spoke network
Implicit enumeration algorithm
Time-definite freight delivery industry
Lagrangian relaxation
Delivery (good)
Road transportation
Relaxation
Implicit enumeration method
Example
Routing
Numerical simulation
Mathematical model
Algorithm
Lagrange equation
Freight transportation
ISSN:0191-2615, 1879-2367
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The freight routing problem of time-definite common carriers is to minimize the sum of handling and transportation costs, while meeting service commitments and operational restrictions. There are two types of operational restrictions, capacity and directed in-tree rooted at each destination. Directed in-tree implicitly implies that there is a singular path for each origin–destination pair. The routing problem is an integrality constrained multi-commodity problem with side constraints. In this research, we study two approaches, the Lagrangian relaxation (LR) and implicit enumeration algorithm with ε-optimality (IE- ε). We use the third largest time-definite freight delivery common carrier in Taiwan for our numerical test. The result shows that the IE- ε outperforms the LR, both quantitatively and qualitatively. In addition, two major shortcomings of the LR approach are shown: it may fail to find any feasible solutions even though they exist, and it cannot determine whether the feasible set is empty or not.
AbstractList The freight routing problem of time-definite common carriers is to minimize the sum of handling and transportation costs, while meeting service commitments and operational restrictions. There are two types of operational restrictions, capacity and directed in-tree rooted at each destination. Directed in-tree implicitly implies that there is a singular path for each origin-destination pair. The routing problem is an integrality constrained multi-commodity problem with side constraints. In this research, we study two approaches, the Lagrangian relaxation (LR) and implicit enumeration algorithm with [var epsilon]-optimality (IE-[var epsilon]). We use the third largest time-definite freight delivery common carrier in Taiwan for our numerical test. The result shows that the IE-[var epsilon] outperforms the LR, both quantitatively and qualitatively. In addition, two major shortcomings of the LR approach are shown: it may fail to find any feasible solutions even though they exist, and it cannot determine whether the feasible set is empty or not.
The freight routing problem of time-definite common carriers is to minimize the sum of handling and transportation costs, while meeting service commitments and operational restrictions. There are two types of operational restrictions, capacity and directed in-tree rooted at each destination. Directed in-tree implicitly implies that there is a singular path for each origin–destination pair. The routing problem is an integrality constrained multi-commodity problem with side constraints. In this research, we study two approaches, the Lagrangian relaxation (LR) and implicit enumeration algorithm with ε-optimality (IE- ε). We use the third largest time-definite freight delivery common carrier in Taiwan for our numerical test. The result shows that the IE- ε outperforms the LR, both quantitatively and qualitatively. In addition, two major shortcomings of the LR approach are shown: it may fail to find any feasible solutions even though they exist, and it cannot determine whether the feasible set is empty or not.
Author Lin, Cheng-Chang
Author_xml – sequence: 1
  givenname: Cheng-Chang
  surname: Lin
  fullname: Lin, Cheng-Chang
  email: cclin@mail.ncku.edu.tw
  organization: Department of Transportation and Communication Management Science, National Cheng Kung University, 1 University Road, 701 Tainan, Taiwan, ROC
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1002964$$DView record in Pascal Francis
http://econpapers.repec.org/article/eeetransb/v_3a35_3ay_3a2001_3ai_3a6_3ap_3a525-547.htm$$DView record in RePEc
BookMark eNqFkc1qGzEUhUVIoU7aRyjMIot2MYl-xzNkUYpJm4SELOquhXx1FSvMjAZJMfjtI9slgS4awdFFcM4nOPeEHI9hREK-MHrOKGsuflPWsZo3TH2l9Bstp63lEZmxdt7VXDTzYzJ7tXwkJyk9FY-QlM3I_XKNlYvoH9e5iuE5-_GxmmJY9ThUwVXZD1hbdH70-c1osfcbjNsKwjCEsQITo8eYPpEPzvQJP_-dp-TPz6vl4rq-e_h1s_hxV4OkIteWc8sEMJTlaU0LsLJMguis6sCaxrWOA5dWKOmAdaJtrVshgmms4K1qxCm5PXAjTgh6in4wcasRMUczppXeaGGEKte2iFPKyvBFTdFUpLjSSs71Og8FdnaATSaB6V0hgE-vUEYp7xpZbJcHG8SQUkSnwWeTfRjLn74vPr3bht5vQ--q1pTq_Tb0Lq3-Sb_x_5_7fshhqXNTOtYJPI6A1keErG3w7xBeAL_NpFU
CODEN TRBMDY
CitedBy_id crossref_primary_10_1016_j_tre_2010_12_003
crossref_primary_10_1080_02533839_2013_815010
crossref_primary_10_1243_09544097JRRT295
crossref_primary_10_1007_s12063_011_0056_4
crossref_primary_10_1007_s11067_008_9070_y
crossref_primary_10_1016_j_tre_2008_02_002
crossref_primary_10_1080_03081060601075674
crossref_primary_10_1007_s11116_012_9391_z
crossref_primary_10_1016_j_trb_2013_04_002
crossref_primary_10_1016_j_tre_2008_02_001
crossref_primary_10_1108_17410381211253344
crossref_primary_10_1016_j_tre_2018_03_007
crossref_primary_10_1016_j_cor_2015_04_011
crossref_primary_10_1002_net_20139
crossref_primary_10_1016_j_trb_2009_09_002
crossref_primary_10_1287_trsc_2015_0631
crossref_primary_10_1016_j_apm_2011_09_063
crossref_primary_10_1016_j_foodcont_2011_04_029
crossref_primary_10_1016_j_tre_2005_05_006
crossref_primary_10_3141_2567_04
crossref_primary_10_1002_nav_20310
crossref_primary_10_1080_13675567_2011_553495
crossref_primary_10_1007_s10696_010_9066_z
crossref_primary_10_1080_10170669_2011_573004
crossref_primary_10_1016_j_trb_2023_102782
crossref_primary_10_1287_opre_1120_1065
crossref_primary_10_1016_S0969_6997_03_00019_X
crossref_primary_10_1287_trsc_2021_1114
crossref_primary_10_1287_trsc_2020_1009
crossref_primary_10_1016_j_tre_2007_01_006
crossref_primary_10_1016_j_asoc_2015_02_039
crossref_primary_10_1002_atr_1183
crossref_primary_10_1007_s11067_008_9065_8
crossref_primary_10_1016_j_tre_2008_12_004
crossref_primary_10_1016_j_cor_2012_02_015
crossref_primary_10_1016_S0191_2615_03_00013_4
crossref_primary_10_1016_j_ijpe_2009_05_030
crossref_primary_10_7232_JKIIE_2011_37_2_132
crossref_primary_10_1016_j_tre_2015_02_006
crossref_primary_10_1007_s10479_023_05450_y
crossref_primary_10_3141_1873_03
Cites_doi 10.1287/trsc.26.3.230
10.1287/opre.37.1.12
10.1287/trsc.24.4.245
10.1007/BF01580223
10.1287/trsc.27.2.102
10.1002/net.3230100403
10.1287/opre.14.1.45
ContentType Journal Article
Copyright 2001 Elsevier Science Ltd
2001 INIST-CNRS
Copyright_xml – notice: 2001 Elsevier Science Ltd
– notice: 2001 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DKI
X2L
DOI 10.1016/S0191-2615(00)00008-4
DatabaseName CrossRef
Pascal-Francis
RePEc IDEAS
RePEc
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Economics
Engineering
Applied Sciences
EISSN 1879-2367
EndPage 547
ExternalDocumentID eeetransb_v_3a35_3ay_3a2001_3ai_3a6_3ap_3a525_547_htm
1002964
10_1016_S0191_2615_00_00008_4
S0191261500000084
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
7-5
71M
8P~
9JO
AAAKF
AAAKG
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
ABDEX
ABDMP
ABFNM
ABLJU
ABMAC
ABMMH
ABPPZ
ABUCO
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNCT
ACRLP
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHRSL
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
APLSM
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HMY
HVGLF
HZ~
H~9
IHE
J1W
KOM
LY1
LY7
M3Y
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OHT
OZT
P-8
P-9
P2P
PC.
PRBVW
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SDP
SDS
SES
SET
SEW
SPCBC
SSB
SSD
SSO
SSS
SSZ
T5K
WUQ
XPP
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ADNMO
AEIPS
AFJKZ
AGQPQ
AIIUN
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
08R
0R
1
8P
AAPBV
ABFLS
ABPTK
ADALY
DKI
G-
HZ
IPNFZ
K
M
MS
STF
X
X2L
ID FETCH-LOGICAL-c403t-d22d13c1e4403da8ccbd14c39d59cda6f8f2c24d354fc19388dfbeeca6d328563
ISICitedReferencesCount 41
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000169396400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0191-2615
IngestDate Wed Aug 18 03:51:26 EDT 2021
Mon Jul 21 09:14:49 EDT 2025
Tue Nov 18 21:38:37 EST 2025
Sat Nov 29 05:58:12 EST 2025
Fri Feb 23 02:27:32 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords Hub-and-spoke network
Implicit enumeration algorithm
Time-definite freight delivery industry
Lagrangian relaxation
Delivery (good)
Road transportation
Relaxation
Implicit enumeration method
Example
Routing
Numerical simulation
Mathematical model
Algorithm
Lagrange equation
Freight transportation
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c403t-d22d13c1e4403da8ccbd14c39d59cda6f8f2c24d354fc19388dfbeeca6d328563
PageCount 23
ParticipantIDs repec_primary_eeetransb_v_3a35_3ay_3a2001_3ai_3a6_3ap_3a525_547_htm
pascalfrancis_primary_1002964
crossref_citationtrail_10_1016_S0191_2615_00_00008_4
crossref_primary_10_1016_S0191_2615_00_00008_4
elsevier_sciencedirect_doi_10_1016_S0191_2615_00_00008_4
PublicationCentury 2000
PublicationDate 2001-07-01
PublicationDateYYYYMMDD 2001-07-01
PublicationDate_xml – month: 07
  year: 2001
  text: 2001-07-01
  day: 01
PublicationDecade 2000
PublicationPlace Kidlington
PublicationPlace_xml – name: Kidlington
PublicationSeriesTitle Transportation Research Part B: Methodological
PublicationTitle Transportation research. Part B: methodological
PublicationYear 2001
Publisher Elsevier Ltd
Elsevier
Publisher_xml – name: Elsevier Ltd
– name: Elsevier
References Powell, Koskosidis (BIB9) 1992; 26
Leung, Magnanti, Singhal (BIB6) 1990; 24
Lin (BIB7) 1998; 27
Papadimitriou, Steiglitz (BIB8) 1982
Eckstein, Sheffi (BIB3) 1987; 1120
Handler, Zang (BIB4) 1980; 10
Tomlin (BIB12) 1966; 14
Ahuja, Magnanti, Orlin (BIB1) 1993
Held, Wolfe, Crowder (BIB5) 1974; 6
Suter, M.J., Nuggehalli, R.S., Zaret, D.R., 1996. Feeder schedules optimization system. Presented at the INFORMS Atlanta Fall Conference, Atlanta, USA
Powell, Sheffi (BIB10) 1989; 37
Barnhart, Sheffi (BIB2) 1993; 27
Powell (10.1016/S0191-2615(00)00008-4_BIB9) 1992; 26
Ahuja (10.1016/S0191-2615(00)00008-4_BIB1) 1993
Barnhart (10.1016/S0191-2615(00)00008-4_BIB2) 1993; 27
Papadimitriou (10.1016/S0191-2615(00)00008-4_BIB8) 1982
Tomlin (10.1016/S0191-2615(00)00008-4_BIB12) 1966; 14
Eckstein (10.1016/S0191-2615(00)00008-4_BIB3) 1987; 1120
Lin (10.1016/S0191-2615(00)00008-4_BIB7) 1998; 27
Powell (10.1016/S0191-2615(00)00008-4_BIB10) 1989; 37
Handler (10.1016/S0191-2615(00)00008-4_BIB4) 1980; 10
Leung (10.1016/S0191-2615(00)00008-4_BIB6) 1990; 24
10.1016/S0191-2615(00)00008-4_BIB11
Held (10.1016/S0191-2615(00)00008-4_BIB5) 1974; 6
References_xml – volume: 37
  start-page: 12
  year: 1989
  end-page: 29
  ident: BIB10
  article-title: Design and implementation of an interactive optimization system for network design in the motor carrier industry
  publication-title: Operations Research
– volume: 6
  start-page: 62
  year: 1974
  end-page: 88
  ident: BIB5
  article-title: Validation of subgradient optimization
  publication-title: Mathematical Programming
– volume: 27
  start-page: 371
  year: 1998
  end-page: 406
  ident: BIB7
  article-title: The load planning of time-definite freight delivery common carriers
  publication-title: Transportation Planning Journal
– year: 1982
  ident: BIB8
  publication-title: Combinatorial Optimization: Algorithms and Complexity
– reference: Suter, M.J., Nuggehalli, R.S., Zaret, D.R., 1996. Feeder schedules optimization system. Presented at the INFORMS Atlanta Fall Conference, Atlanta, USA
– volume: 27
  start-page: 102
  year: 1993
  end-page: 117
  ident: BIB2
  article-title: A network-based primal-dual heuristic for the solution of multicommodity network flow problems
  publication-title: Transportation Science
– volume: 1120
  start-page: 12
  year: 1987
  end-page: 23
  ident: BIB3
  article-title: Optimization of group line-haul operations for motor carriers using twin trailers
  publication-title: Transportation Research Record
– volume: 10
  start-page: 293
  year: 1980
  end-page: 309
  ident: BIB4
  article-title: A dual algorithm for the constrained shortest path problem
  publication-title: Networks
– volume: 26
  start-page: 230
  year: 1992
  end-page: 245
  ident: BIB9
  article-title: Shipment routing algorithms with tree constraints
  publication-title: Transportation Science
– volume: 14
  start-page: 45
  year: 1966
  end-page: 51
  ident: BIB12
  article-title: Minimum-cost multicommodity network flows
  publication-title: Operations Research
– year: 1993
  ident: BIB1
  publication-title: Network Flows: Theory, Algorithms, and Applications
– volume: 24
  start-page: 245
  year: 1990
  end-page: 260
  ident: BIB6
  article-title: Routing in point-to-point delivery systems: formulations and solution heuristics
  publication-title: Transportation Science
– volume: 26
  start-page: 230
  issue: 3
  year: 1992
  ident: 10.1016/S0191-2615(00)00008-4_BIB9
  article-title: Shipment routing algorithms with tree constraints
  publication-title: Transportation Science
  doi: 10.1287/trsc.26.3.230
– ident: 10.1016/S0191-2615(00)00008-4_BIB11
– year: 1993
  ident: 10.1016/S0191-2615(00)00008-4_BIB1
– volume: 27
  start-page: 371
  issue: 3
  year: 1998
  ident: 10.1016/S0191-2615(00)00008-4_BIB7
  article-title: The load planning of time-definite freight delivery common carriers
  publication-title: Transportation Planning Journal
– volume: 37
  start-page: 12
  issue: 1
  year: 1989
  ident: 10.1016/S0191-2615(00)00008-4_BIB10
  article-title: Design and implementation of an interactive optimization system for network design in the motor carrier industry
  publication-title: Operations Research
  doi: 10.1287/opre.37.1.12
– volume: 1120
  start-page: 12
  year: 1987
  ident: 10.1016/S0191-2615(00)00008-4_BIB3
  article-title: Optimization of group line-haul operations for motor carriers using twin trailers
  publication-title: Transportation Research Record
– volume: 24
  start-page: 245
  issue: 4
  year: 1990
  ident: 10.1016/S0191-2615(00)00008-4_BIB6
  article-title: Routing in point-to-point delivery systems: formulations and solution heuristics
  publication-title: Transportation Science
  doi: 10.1287/trsc.24.4.245
– volume: 6
  start-page: 62
  year: 1974
  ident: 10.1016/S0191-2615(00)00008-4_BIB5
  article-title: Validation of subgradient optimization
  publication-title: Mathematical Programming
  doi: 10.1007/BF01580223
– volume: 27
  start-page: 102
  issue: 2
  year: 1993
  ident: 10.1016/S0191-2615(00)00008-4_BIB2
  article-title: A network-based primal-dual heuristic for the solution of multicommodity network flow problems
  publication-title: Transportation Science
  doi: 10.1287/trsc.27.2.102
– volume: 10
  start-page: 293
  year: 1980
  ident: 10.1016/S0191-2615(00)00008-4_BIB4
  article-title: A dual algorithm for the constrained shortest path problem
  publication-title: Networks
  doi: 10.1002/net.3230100403
– volume: 14
  start-page: 45
  year: 1966
  ident: 10.1016/S0191-2615(00)00008-4_BIB12
  article-title: Minimum-cost multicommodity network flows
  publication-title: Operations Research
  doi: 10.1287/opre.14.1.45
– year: 1982
  ident: 10.1016/S0191-2615(00)00008-4_BIB8
SSID ssj0003401
Score 1.8219622
Snippet The freight routing problem of time-definite common carriers is to minimize the sum of handling and transportation costs, while meeting service commitments and...
SourceID repec
pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 525
SubjectTerms Applied sciences
Exact sciences and technology
Ground, air and sea transportation, marine construction
Hub-and-spoke network
Implicit enumeration algorithm
Lagrangian relaxation
Road transportation and traffic
Time-definite freight delivery industry
Transportation planning, management and economics
Title The freight routing problem of time-definite freight delivery common carriers
URI https://dx.doi.org/10.1016/S0191-2615(00)00008-4
http://econpapers.repec.org/article/eeetransb/v_3a35_3ay_3a2001_3ai_3a6_3ap_3a525-547.htm
Volume 35
WOSCitedRecordID wos000169396400001&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: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2367
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0003401
  issn: 0191-2615
  databaseCode: AIEXJ
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9MwGLZKhwQTQjBAFBjKgQNoykhsJ7GPYxoCBBMSQ-otpP5gkbo0SrNq-_d7HTtuCoKxAwe7qRU7bt7H9mP3_UDoFbCEBANRDoFt4JAqbQ6aWAy7FB6JbKZhBe2ilnzOjo_ZdMq_jkY_eluY1TyrKnZxwev_KmooA2Eb09kbiNs3CgVwDUKHHMQO-T8LXjfdiedeszhvrbl5FzamUwgoz1QolS4N2fQ3SjU3ChqXRsUcemocVptQdsshd_V-0C1mnJug031goU27986cLdh41P186pV9SvfPvqp-hp05w8ZZQ-z1Uv3xI49D2HMlw_nTuhtxOBlOhok1aXbramI9a_42ZdvTg2--aSDWJj4179isswDacJP9y_LllQoH-mo8zk1TeWR8n5o4m_QW2sJZwtkYbR18PJp-8qs1oZGLWWkfv7byervu0-soeuP68yf-cq8ulvBmtQ2HAludRtVKDLjKyQN0320yggMLjodopKoddKe3QV_uoO2BG8pH6AtAJnBICBxkAgeZYKGDDcj4G3vIBBYyQQ-Zx-j7-6OTww-hC7MRChqRNpQYy5iIWFH4KgsmxEzGVBAuEy5kkWqmscBUkoRqAXyfMalnSokilQSzJCVP0LhaVOopClJaZDgWTGBJaYojLtIMS5IKqiMNy-oE0f7l5cL5oDehUOb5X4U3Qfu-Wm2dsFxXgfWSyR2TtAwxB9RdV3V3Q5KDB0ZGRWGCDjvJ-nKlVGvG3yxf5aQgCWSXkMzwgY8SUgqphgTjIYdRkJ-2Z89u-oueo7vrAfkCjdvmXO2i22LVlsvmpQP1FTPBrqg
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=The+freight+routing+problem+of+time-definite+freight+delivery+common+carriers&rft.jtitle=Transportation+research.+Part+B%3A+methodological&rft.au=Lin%2C+Cheng-Chang&rft.date=2001-07-01&rft.issn=0191-2615&rft.volume=35&rft.issue=6&rft.spage=525&rft.epage=547&rft_id=info:doi/10.1016%2FS0191-2615%2800%2900008-4&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0191_2615_00_00008_4
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0191-2615&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0191-2615&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0191-2615&client=summon