Model and algorithms for multi-period sea cargo mix problem

In this paper, we consider the sea cargo mix problem in international ocean container shipping industry. We describe the characteristics of the cargo mix problem for the carrier in a multi-period planning horizon, and formulate it as a multi-dimensional multiple knapsack problem (MDMKP). In particul...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 180; číslo 3; s. 1381 - 1393
Hlavní autoři:	Ang, James S.K., Cao, Chengxuan, Ye, Heng-Qing
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.08.2007 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	0–1 integer program Algorithms Applied sciences Cargos Container ships Exact sciences and technology Heuristic Heuristic algorithm Integer programming Knapsack problem Logistics Operational research. Management science Optimization algorithms Sea cargo mix Shipping industry Studies Sea cargo mix 0–1 integer program Heuristic algorithm Logistics Energy analysis Statistical analysis Numerical method Booking Modeling Optimization Knapsack problem Container Zero one programming 0-1 integer program Heuristic method Profit Mixed problem Planning Large scale system
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	In this paper, we consider the sea cargo mix problem in international ocean container shipping industry. We describe the characteristics of the cargo mix problem for the carrier in a multi-period planning horizon, and formulate it as a multi-dimensional multiple knapsack problem (MDMKP). In particular, the MDMKP is an optimization model that maximizes the total profit generated by all freight bookings accepted in a multi-period planning horizon subject to the limited shipping capacities. We propose two heuristic algorithms that can solve large scale problems with tens of thousands of decision variables in a short time. Finally, numerical experiments on a wide range of randomly generated problem instances are conducted to demonstrate the efficiency of the algorithms.
AbstractList	In this paper, we consider the sea cargo mix problem in international ocean container shipping industry. We describe the characteristics of the cargo mix problem for the carrier in a multi-period planning horizon, and formulate it as a multi-dimensional multiple knapsack problem (MDMKP). In particular, the MDMKP is an optimization model that maximizes the total profit generated by all freight bookings accepted in a multi-period planning horizon subject to the limited shipping capacities. We propose two heuristic algorithms that can solve large scale problems with tens of thousands of decision variables in a short time. Finally, numerical experiments on a wide range of randomly generated problem instances are conducted to demonstrate the efficiency of the algorithms. [PUBLICATION ABSTRACT] In this paper, we consider the sea cargo mix problem in international ocean container shipping industry. We describe the characteristics of the cargo mix problem for the carrier in a multi-period planning horizon, and formulate it as a multi-dimensional multiple knapsack problem (MDMKP). In particular, the MDMKP is an optimization model that maximizes the total profit generated by all freight bookings accepted in a multi-period planning horizon subject to the limited shipping capacities. We propose two heuristic algorithms that can solve large scale problems with tens of thousands of decision variables in a short time. Finally, numerical experiments on a wide range of randomly generated problem instances are conducted to demonstrate the efficiency of the algorithms.
Author	Cao, Chengxuan Ang, James S.K. Ye, Heng-Qing
Author_xml	– sequence: 1 givenname: James S.K. surname: Ang fullname: Ang, James S.K. email: bizangsk@nus.edu.sg – sequence: 2 givenname: Chengxuan surname: Cao fullname: Cao, Chengxuan email: bizccx@nus.edu.sg – sequence: 3 givenname: Heng-Qing surname: Ye fullname: Ye, Heng-Qing email: bizyehq@nus.edu.sg
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18579489$$DView record in Pascal Francis http://econpapers.repec.org/article/eeeejores/v_3a180_3ay_3a2007_3ai_3a3_3ap_3a1381-1393.htm$$DView record in RePEc
BookMark	eNp9UcFq3DAUFCWFbtL8QE-m0KOdJ9mWZNpLCU1TSOilOQtZekpkbMuVtKH5-2jZ0EIPEYzeQTPzxMwpOVnDioR8oNBQoPxianAKsWEAvIG-AcrekB2VgtVccjghO2iFqBmj4h05TWkCANrTfkc-3waLc6VXW-n5PkSfH5ZUuRCrZT9nX28YfbBVQl0ZHe9Dtfg_1RbDOOPynrx1ek54_jLPyN3Vt1-X1_XNz-8_Lr_e1KYTNNeWCaoHYzjng7aiM3aUaAU3FFBaGCkfnWOjgLEHzoV1grrRaInILRrh2jPy8ehb9v7eY8pqCvu4lpWKQdeC6HlXSLdHUsQNjdqiX3R8UlhOSQaTelStphLK_VRQkhJl-IK2YDs8tpIq2g6teshL8fv0slQno2cX9Wp8-utLZS-GTg6Fx448E0NKEd0_CqhDN2pShx-oQzcKelW6KSL5n8j4rLMPa47az69LvxylWBJ_9BhVMh5Xg9ZHNFnZ4F-TPwMMjauC
CODEN	EJORDT
CitedBy_id	crossref_primary_10_1002_sres_2185 crossref_primary_10_1007_s10708_008_9214_0 crossref_primary_10_1016_j_ejor_2015_10_008 crossref_primary_10_1016_j_tranpol_2012_08_004 crossref_primary_10_1016_j_cie_2012_03_008 crossref_primary_10_1109_TGCN_2024_3454190 crossref_primary_10_1016_j_trc_2011_08_001 crossref_primary_10_1016_j_jclepro_2017_07_145 crossref_primary_10_1016_j_comgeo_2024_102124 crossref_primary_10_1016_j_ejor_2016_04_025 crossref_primary_10_1016_j_cor_2021_105693 crossref_primary_10_1007_s10479_024_05827_7 crossref_primary_10_1080_03088839_2015_1037371 crossref_primary_10_1016_j_jairtraman_2018_02_005 crossref_primary_10_1016_j_ejor_2010_01_026 crossref_primary_10_1016_j_eswa_2012_01_003 crossref_primary_10_1016_j_swevo_2025_101971
Cites_doi	10.1080/03088839600000087 10.1287/trsc.25.3.201 10.1057/jors.1979.78 10.1016/S0377-2217(98)00120-9 10.1287/opre.45.5.758 10.1287/trsc.32.2.142 10.1016/S1366-5545(02)00018-2 10.1287/opre.47.4.570 10.1057/jors.1995.98 10.1016/0377-2217(78)90108-X 10.1287/mnsc.13.9.723 10.1287/mnsc.21.12.1417 10.1287/opre.41.1.102
ContentType	Journal Article
Copyright	2006 Elsevier B.V. 2007 INIST-CNRS Copyright Elsevier Sequoia S.A. Aug 1, 2007
Copyright_xml	– notice: 2006 Elsevier B.V. – notice: 2007 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Aug 1, 2007
DBID	AAYXX CITATION IQODW DKI X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D
DOI	10.1016/j.ejor.2006.05.012
DatabaseName	CrossRef Pascal-Francis RePEc IDEAS RePEc Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business Applied Sciences
EISSN	1872-6860
EndPage	1393
ExternalDocumentID	1225073451 eeeejores_v_3a180_3ay_3a2007_3ai_3a3_3ap_3a1381_1393_htm 18579489 10_1016_j_ejor_2006_05_012 S0377221706003675
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c471t-d271a9cc6669ad74cdb8ed76c10e8d0b16bff2b70b50667df71fbca8ee6dec7f3
ISICitedReferencesCount	22
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000245127200029&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0377-2217
IngestDate	Sun Aug 17 23:54:04 EDT 2025 Wed Aug 18 03:50:57 EDT 2021 Mon Jul 21 09:14:27 EDT 2025 Sat Nov 29 01:40:48 EST 2025 Tue Nov 18 22:43:52 EST 2025 Fri Feb 23 02:27:50 EST 2024
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Sea cargo mix 0–1 integer program Heuristic algorithm Logistics Energy analysis Statistical analysis Numerical method Booking Modeling Optimization Knapsack problem Container Zero one programming 0-1 integer program Heuristic method Profit Mixed problem Planning Large scale system
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c471t-d271a9cc6669ad74cdb8ed76c10e8d0b16bff2b70b50667df71fbca8ee6dec7f3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
OpenAccessLink	http://scholarbank.nus.edu.sg/handle/10635/44078
PQID	204307564
PQPubID	45678
PageCount	13
ParticipantIDs	proquest_journals_204307564 repec_primary_eeeejores_v_3a180_3ay_3a2007_3ai_3a3_3ap_3a1381_1393_htm pascalfrancis_primary_18579489 crossref_primary_10_1016_j_ejor_2006_05_012 crossref_citationtrail_10_1016_j_ejor_2006_05_012 elsevier_sciencedirect_doi_10_1016_j_ejor_2006_05_012
PublicationCentury	2000
PublicationDate	2007-08-01
PublicationDateYYYYMMDD	2007-08-01
PublicationDate_xml	– month: 08 year: 2007 text: 2007-08-01 day: 01
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationSeriesTitle	European Journal of Operational Research
PublicationTitle	European journal of operational research
PublicationYear	2007
Publisher	Elsevier B.V Elsevier Elsevier Sequoia S.A
Publisher_xml	– name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A
References	Crainic, Gendreau, Dejax (bib4) 1993; 41 Choong, Cole, Kutanoglu (bib3) 2002; 38 Martello, Toth (bib11) 1990 Shih (bib17) 1979; 30 Nauss (bib12) 1978; 2 Pisinger (bib14) 1999; 47 Koleser (bib8) 1967; 13 Toyoda (bib18) 1975; 21 Evans, Marlow (bib5) 1985 S. Khan, K.F. Li, E.G. Manning, The utility model for adaptive multimedia system, in: International Workshop on Multimedia Modeling, 1997, pp. 111–126 . Pisinger (bib13) 1997; 45 Pisinger (bib15) 1999; 114 Cheung, Chen (bib1) 1998; 32 Cho, Perakis (bib2) 1996; 23 Lai, Lam, Chan (bib9) 1995; 46 Garey, Johnson (bib6) 1979 E.F. Magirou, H.N. Psaraftis, N.M. Christodoulakis, Quantitative methods in shipping: A survey of current use and future trends, Athens University of Economics and Business, Report No. E115, 1992. Rana, Vickson (bib16) 1991; 25 Shih (10.1016/j.ejor.2006.05.012_bib17) 1979; 30 Choong (10.1016/j.ejor.2006.05.012_bib3) 2002; 38 Evans (10.1016/j.ejor.2006.05.012_bib5) 1985 10.1016/j.ejor.2006.05.012_bib7 Martello (10.1016/j.ejor.2006.05.012_bib11) 1990 Garey (10.1016/j.ejor.2006.05.012_bib6) 1979 Pisinger (10.1016/j.ejor.2006.05.012_bib15) 1999; 114 Cheung (10.1016/j.ejor.2006.05.012_bib1) 1998; 32 Crainic (10.1016/j.ejor.2006.05.012_bib4) 1993; 41 Lai (10.1016/j.ejor.2006.05.012_bib9) 1995; 46 Cho (10.1016/j.ejor.2006.05.012_bib2) 1996; 23 Pisinger (10.1016/j.ejor.2006.05.012_bib14) 1999; 47 Pisinger (10.1016/j.ejor.2006.05.012_bib13) 1997; 45 Nauss (10.1016/j.ejor.2006.05.012_bib12) 1978; 2 Rana (10.1016/j.ejor.2006.05.012_bib16) 1991; 25 Koleser (10.1016/j.ejor.2006.05.012_bib8) 1967; 13 10.1016/j.ejor.2006.05.012_bib10 Toyoda (10.1016/j.ejor.2006.05.012_bib18) 1975; 21
References_xml	– volume: 21 start-page: 1417 year: 1975 end-page: 1427 ident: bib18 article-title: A simplified algorithm for obtaining approximate solution to zero-one programming problems publication-title: Management Science – volume: 41 start-page: 102 year: 1993 end-page: 126 ident: bib4 article-title: Dynamic and stochastic models for the allocation of empty containers publication-title: Operations Research – year: 1979 ident: bib6 article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – volume: 38 start-page: 423 year: 2002 end-page: 438 ident: bib3 article-title: Empty container management for intermodal transportation networks publication-title: Transportation Research Part E – volume: 46 start-page: 687 year: 1995 end-page: 697 ident: bib9 article-title: Ship container logistics and allocation publication-title: Journal of the Operational Research Society – volume: 2 start-page: 125 year: 1978 end-page: 131 ident: bib12 article-title: The knapsack problem with multiple choice constraints publication-title: European Journal of Operational Research – volume: 25 start-page: 201 year: 1991 end-page: 214 ident: bib16 article-title: Routing container ships using Lagrangean relaxation and decomposition publication-title: Transportation Science – year: 1990 ident: bib11 article-title: Knapsack Problems: Algorithms and Computer Implementation – volume: 13 start-page: 723 year: 1967 end-page: 735 ident: bib8 article-title: A branch and bound algorithm for knapsack problem publication-title: Management Science – reference: S. Khan, K.F. Li, E.G. Manning, The utility model for adaptive multimedia system, in: International Workshop on Multimedia Modeling, 1997, pp. 111–126 . – volume: 23 start-page: 249 year: 1996 end-page: 259 ident: bib2 article-title: Optimal liner fleet routing strategies publication-title: Maritime Policy & Management – volume: 114 start-page: 528 year: 1999 end-page: 541 ident: bib15 article-title: An exact algorithm for large multiple knapsack problems publication-title: European Journal of Operational Research – year: 1985 ident: bib5 article-title: Quantitative Methods in Maritime Economics – reference: E.F. Magirou, H.N. Psaraftis, N.M. Christodoulakis, Quantitative methods in shipping: A survey of current use and future trends, Athens University of Economics and Business, Report No. E115, 1992. – volume: 45 start-page: 758 year: 1997 end-page: 767 ident: bib13 article-title: A minimal algorithm for the 0–1 Knapsack problem publication-title: Operations Research – volume: 47 start-page: 570 year: 1999 end-page: 575 ident: bib14 article-title: Core problems in Knapsack algorithms publication-title: Operations Research – volume: 32 start-page: 142 year: 1998 end-page: 162 ident: bib1 article-title: A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem publication-title: Transportation Science – volume: 30 start-page: 369 year: 1979 end-page: 378 ident: bib17 article-title: A branch and bound method for the multiconstraint zero-one knapsack problem publication-title: Journal of the Operational Society – year: 1979 ident: 10.1016/j.ejor.2006.05.012_bib6 – volume: 23 start-page: 249 issue: 3 year: 1996 ident: 10.1016/j.ejor.2006.05.012_bib2 article-title: Optimal liner fleet routing strategies publication-title: Maritime Policy & Management doi: 10.1080/03088839600000087 – ident: 10.1016/j.ejor.2006.05.012_bib10 – year: 1990 ident: 10.1016/j.ejor.2006.05.012_bib11 – year: 1985 ident: 10.1016/j.ejor.2006.05.012_bib5 – volume: 25 start-page: 201 issue: 3 year: 1991 ident: 10.1016/j.ejor.2006.05.012_bib16 article-title: Routing container ships using Lagrangean relaxation and decomposition publication-title: Transportation Science doi: 10.1287/trsc.25.3.201 – volume: 30 start-page: 369 issue: 4 year: 1979 ident: 10.1016/j.ejor.2006.05.012_bib17 article-title: A branch and bound method for the multiconstraint zero-one knapsack problem publication-title: Journal of the Operational Society doi: 10.1057/jors.1979.78 – volume: 114 start-page: 528 year: 1999 ident: 10.1016/j.ejor.2006.05.012_bib15 article-title: An exact algorithm for large multiple knapsack problems publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00120-9 – volume: 45 start-page: 758 year: 1997 ident: 10.1016/j.ejor.2006.05.012_bib13 article-title: A minimal algorithm for the 0–1 Knapsack problem publication-title: Operations Research doi: 10.1287/opre.45.5.758 – volume: 32 start-page: 142 issue: 2 year: 1998 ident: 10.1016/j.ejor.2006.05.012_bib1 article-title: A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem publication-title: Transportation Science doi: 10.1287/trsc.32.2.142 – volume: 38 start-page: 423 year: 2002 ident: 10.1016/j.ejor.2006.05.012_bib3 article-title: Empty container management for intermodal transportation networks publication-title: Transportation Research Part E doi: 10.1016/S1366-5545(02)00018-2 – volume: 47 start-page: 570 year: 1999 ident: 10.1016/j.ejor.2006.05.012_bib14 article-title: Core problems in Knapsack algorithms publication-title: Operations Research doi: 10.1287/opre.47.4.570 – volume: 46 start-page: 687 issue: 6 year: 1995 ident: 10.1016/j.ejor.2006.05.012_bib9 article-title: Ship container logistics and allocation publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1995.98 – volume: 2 start-page: 125 year: 1978 ident: 10.1016/j.ejor.2006.05.012_bib12 article-title: The knapsack problem with multiple choice constraints publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(78)90108-X – volume: 13 start-page: 723 year: 1967 ident: 10.1016/j.ejor.2006.05.012_bib8 article-title: A branch and bound algorithm for knapsack problem publication-title: Management Science doi: 10.1287/mnsc.13.9.723 – volume: 21 start-page: 1417 year: 1975 ident: 10.1016/j.ejor.2006.05.012_bib18 article-title: A simplified algorithm for obtaining approximate solution to zero-one programming problems publication-title: Management Science doi: 10.1287/mnsc.21.12.1417 – ident: 10.1016/j.ejor.2006.05.012_bib7 – volume: 41 start-page: 102 issue: 1 year: 1993 ident: 10.1016/j.ejor.2006.05.012_bib4 article-title: Dynamic and stochastic models for the allocation of empty containers publication-title: Operations Research doi: 10.1287/opre.41.1.102
SSID	ssj0001515
Score	2.0165513
Snippet	In this paper, we consider the sea cargo mix problem in international ocean container shipping industry. We describe the characteristics of the cargo mix...
SourceID	proquest repec pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	1381
SubjectTerms	0–1 integer program Algorithms Applied sciences Cargos Container ships Exact sciences and technology Heuristic Heuristic algorithm Integer programming Knapsack problem Logistics Operational research. Management science Optimization algorithms Sea cargo mix Shipping industry Studies
Title	Model and algorithms for multi-period sea cargo mix problem
URI	https://dx.doi.org/10.1016/j.ejor.2006.05.012 http://econpapers.repec.org/article/eeeejores/v_3a180_3ay_3a2007_3ai_3a3_3ap_3a1381-1393.htm https://www.proquest.com/docview/204307564
Volume	180
WOSCitedRecordID	wos000245127200029&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: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bj9JAFJ4gGKMxXlAjrm76YHxpSnqfNj6RDWQ1G9TAJvg0mU6nXMKWbrkE_4c_2DPM9IJmiT5I0gJThsKc75w5c-ZcEHpvMs-zE9c3HBZ5hpvYIfBcSA3mw_Tlegko7e6h2AQeDoPJJPzaaPwsYmF2S5ymwX4fZv-V1NAGxBahs_9A7vJLoQFeA9HhDGSH818RXlQ3k_H_dDldwdp_JnMuSN9BQ2Q2XsW6iJBkNJ-u9Jv5XldlZe400yuVFRrywniosgSV1uSecu0VXrf6qLKeXlBpjJ3xdLrfVli8hPfGN2Go-M6PTA-4dHxT9rAiJmbEb7erOdVH3V5NfDkYG7YtIzO7XIrXANuGH8gKApX8NWtAc2rS1HJkOZc_xLy0OCy6fLHK1YaSyL5qV5NasZE__EIG11dXZNyfjI-vyiUQiDMQcq5nfchuDVGLTOzZq8Is91DLxl4YNFGr96k_-VzO8EIJPOxOqX-ogrGk3-Dvv-kuhedxRtfAhomsn3K0wGnlPOOspueMn6EnaoGi9SSwnqMGT9voQREf0UZPizogmpoW2uhRLanlC_TxAEANAKhVANQAgFodgBqgRzsAUAMAagqAL9H1oD--uDRUiQ6DgVazMWIbWzRkDBbBIY2xy-Io4DH2mWXyIDYjy4-SxI6wGXnCmzpOsJVEjAac-zFnOHFeoWa6SvlrpNnUY9BP1BsIXWphmpjMAXU45GHEImZ3kFWMI2Eqf70oo7IkhaPigoixF4VVfWJ6BMa-g_SyTyazt5z8tFeQhyj9U-qVBHB3st_5ES2rWwUeTHdB2EFnBXGJYto1EUHpoK_7bgcNDvQuu3F4wC34muyIQ4E94PwDDsGC8DSHw4EjExeBQwgs4hwy29y8OXmbM_Sw4uG3qLnJt_wdus92m_k6P1cQ_wWNOM8C
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=Model+and+algorithms+for+multi-period+sea+cargo+mix+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Ang%2C+James+S+K&rft.au=Cao%2C+Chengxuan&rft.au=Heng-Qing+Ye&rft.date=2007-08-01&rft.pub=Elsevier+Sequoia+S.A&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=180&rft.issue=3&rft.spage=1381&rft_id=info:doi/10.1016%2Fj.ejor.2006.05.012&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=1225073451
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon