The freight consolidation and containerization problem

•Introduced a new freight transportation problem.•Proposed a linear programming formulation for the problem.•Designed a customized memetic algorithm to solve problem instances of practical size.•Generated benchmark instances for the problem based on typical values encountered in practice.•Demonstrat...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 234; číslo 1; s. 37 - 48
Hlavní autoři:	Qin, Hu, Zhang, Zizhen, Qi, Zhuxuan, Lim, Andrew
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.04.2014 Elsevier Sequoia S.A
Témata:	China Consolidation Containerization Containers Costs Freight consolidation Freight forwarding Integer programming Mathematical models Memetic algorithm Packing Parcels Ports Route optimization Shipments Studies Third party Third-party logistics Transportation problem (Operations research) Warehouses United States > US China Shanghai China Memetic algorithm Third-party logistics Packing Containerization Freight consolidation
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	•Introduced a new freight transportation problem.•Proposed a linear programming formulation for the problem.•Designed a customized memetic algorithm to solve problem instances of practical size.•Generated benchmark instances for the problem based on typical values encountered in practice.•Demonstrated our approach is superior to CPLEX for large instances. In today’s global free market, third-party logistics providers (3PLs) are becoming increasingly important. This paper studies a problem faced by a 3PL operating a warehouse in Shanghai, China, under contract with a major manufacturer of children’s clothing based in the United States. At the warehouse, the 3PL receives textile parcel shipments from the suppliers located in China; each shipment is destined for different retail stores located across the United Sates. These shipments must be consolidated and loaded into containers of varying sizes and costs, and then sent along shipping routes to different destination ports. An express company, such as UPS and FedEx, unloads the shipments from the containers at the destination ports and distributes them to their corresponding stores or retailers by parcel delivery. The objective is to find an allocation that minimizes the total container transportation and parcel delivery costs. We formulate the problem into an integer programming model, and also propose a memetic algorithm approach to solve the problem practically. A demonstration of a good solution to this problem was a decisive factor in the awarding of the contract to the 3PL in question.
AbstractList	•Introduced a new freight transportation problem.•Proposed a linear programming formulation for the problem.•Designed a customized memetic algorithm to solve problem instances of practical size.•Generated benchmark instances for the problem based on typical values encountered in practice.•Demonstrated our approach is superior to CPLEX for large instances. In today’s global free market, third-party logistics providers (3PLs) are becoming increasingly important. This paper studies a problem faced by a 3PL operating a warehouse in Shanghai, China, under contract with a major manufacturer of children’s clothing based in the United States. At the warehouse, the 3PL receives textile parcel shipments from the suppliers located in China; each shipment is destined for different retail stores located across the United Sates. These shipments must be consolidated and loaded into containers of varying sizes and costs, and then sent along shipping routes to different destination ports. An express company, such as UPS and FedEx, unloads the shipments from the containers at the destination ports and distributes them to their corresponding stores or retailers by parcel delivery. The objective is to find an allocation that minimizes the total container transportation and parcel delivery costs. We formulate the problem into an integer programming model, and also propose a memetic algorithm approach to solve the problem practically. A demonstration of a good solution to this problem was a decisive factor in the awarding of the contract to the 3PL in question. In today's global free market, third-party logistics providers (3PLs) are becoming increasingly important. This paper studies a problem faced by a 3PL operating a warehouse in Shanghai, China, under contract with a major manufacturer of children's clothing based in the United States. At the warehouse, the 3PL receives textile parcel shipments from the suppliers located in China; each shipment is destined for different retail stores located across the United Sates. These shipments must be consolidated and loaded into containers of varying sizes and costs, and then sent along shipping routes to different destination ports. An express company, such as UPS and FedEx, unloads the shipments from the containers at the destination ports and distributes them to their corresponding stores or retailers by parcel delivery. The objective is to find an allocation that minimizes the total container transportation and parcel delivery costs. We formulate the problem into an integer programming model, and also propose a memetic algorithm approach to solve the problem practically. A demonstration of a good solution to this problem was a decisive factor in the awarding of the contract to the 3PL in question. In today's global free market, third-party logistics providers (3PLs) are becoming increasingly important. This paper studies a problem faced by a 3PL operating a warehouse in Shanghai, China, under contract with a major manufacturer of children's clothing based in the United States. At the warehouse, the 3PL receives textile parcel shipments from the suppliers located in China; each shipment is destined for different retail stores located across the United Sates. These shipments must be consolidated and loaded into containers of varying sizes and costs, and then sent along shipping routes to different destination ports. An express company, such as UPS and FedEx, unloads the shipments from the containers at the destination ports and distributes them to their corresponding stores or retailers by parcel delivery. The objective is to find an allocation that minimizes the total container transportation and parcel delivery costs. We formulate the problem into an integer programming model, and also propose a memetic algorithm approach to solve the problem practically. A demonstration of a good solution to this problem was a decisive factor in the awarding of the contract to the 3PL in question. [PUBLICATION ABSTRACT]
Author	Lim, Andrew Qi, Zhuxuan Zhang, Zizhen Qin, Hu
Author_xml	– sequence: 1 givenname: Hu surname: Qin fullname: Qin, Hu email: tigerqin@hust.edu.cn, tigerqin1980@gmail.com organization: School of Management, Huazhong University of Science and Technology, No. 1037, Luoyu Road, Wuhan, China – sequence: 2 givenname: Zizhen surname: Zhang fullname: Zhang, Zizhen email: zzzhang@cityu.edu.hk, zhangzizhen@gmail.com organization: Department of Management Sciences, City University of Hong Kong, Tat Chee Avenue, Kowloon Tong, Hong Kong – sequence: 3 givenname: Zhuxuan surname: Qi fullname: Qi, Zhuxuan email: zhuxuan.qi900330@aliyun.com organization: School of Labor and Human Resources, Renmin University of China, Beijing 100872, China – sequence: 4 givenname: Andrew surname: Lim fullname: Lim, Andrew email: lim.andrew@cityu.edu.hk organization: Department of Management Sciences, City University of Hong Kong, Tat Chee Avenue, Kowloon Tong, Hong Kong
BookMark	eNp9kM9LwzAUgINMcJv-A54GXry05iVt0oIXGf6CgZd5Dln66lK6ZCadoH-9rfW0w06Bx_cled-MTJx3SMg10BQoiLsmxcaHlFHgKS1TCvkZmUIhWSIKQSdkSrmUCWMgL8gsxobSHoF8SsR6i4s6oP3YdgvjXfStrXRnvVtoVw2TTluHwf6Mw33wmxZ3l-S81m3Eq_9zTt6fHtfLl2T19vy6fFglJoO8S5jMsUBZ5xVyyLRmxtRMSs5MyTTjlNVZXWIhuDEsRwooKyZNwSvYIBci53NyO97bv_t5wNipnY0G21Y79IeoQEjISs5y3qM3R2jjD8H1v1OQSSiBSmA9VYyUCT7GgLUytvtbrQvatgqoGoKqRg1B1RBU0VL1tXqVHan7YHc6fJ-W7kcJ-0pfFoOKxqIzWNmAplOVt6f0X9xykH0
CODEN	EJORDT
CitedBy_id	crossref_primary_10_1007_s43615_024_00404_3 crossref_primary_10_1016_j_ejor_2025_01_024 crossref_primary_10_26552_com_C_2021_1_A54_A61 crossref_primary_10_1007_s10479_024_05876_y crossref_primary_10_1016_j_tre_2020_101970 crossref_primary_10_1016_j_cie_2021_107844 crossref_primary_10_1016_j_rtbm_2024_101254 crossref_primary_10_1108_IMDS_05_2015_0192 crossref_primary_10_1109_TASE_2018_2795254 crossref_primary_10_1016_j_jclepro_2020_123270 crossref_primary_10_1016_j_ejor_2022_12_042 crossref_primary_10_1016_j_tranpol_2022_12_006 crossref_primary_10_1080_00207543_2016_1193246 crossref_primary_10_1016_j_cie_2015_04_023 crossref_primary_10_1057_jors_2015_50 crossref_primary_10_1080_13675567_2020_1782863 crossref_primary_10_1016_j_cor_2024_106600 crossref_primary_10_1080_01605682_2018_1527191 crossref_primary_10_3390_g9020025 crossref_primary_10_1016_j_cor_2023_106443 crossref_primary_10_1016_j_trd_2020_102253 crossref_primary_10_3390_math11081819 crossref_primary_10_1108_IJPPM_05_2022_0231 crossref_primary_10_1016_j_cie_2020_106299 crossref_primary_10_1016_j_ejor_2018_12_043 crossref_primary_10_1016_j_cor_2025_107095 crossref_primary_10_1016_j_omega_2025_103397
Cites_doi	10.1007/BF00226291 10.1287/opre.42.2.274 10.1137/0215016 10.1007/s10589-009-9276-z 10.1016/S0377-2217(01)00227-2 10.1016/j.cor.2008.12.016 10.1016/S1366-5545(03)00037-1 10.1016/j.ejor.2005.07.033 10.1137/060670328 10.1016/j.ejor.2006.06.056 10.1287/mnsc.1060.0607 10.1023/A:1021837611236 10.1016/j.ijpe.2007.05.017 10.1002/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G 10.1287/trsc.37.1.1.12822 10.1016/S0377-2217(02)00247-3 10.1016/j.cor.2006.10.014 10.1016/j.cor.2009.06.014 10.1287/opre.1080.0583 10.1016/S1366-5545(03)00005-X 10.1287/opre.1070.0488 10.1287/mnsc.47.10.1408.10258 10.1016/j.ejor.2005.03.057 10.1287/opre.38.1.99 10.1108/09600030010307975 10.1007/s00773-008-0035-0 10.1108/09600030610714607 10.1016/j.ejor.2009.07.016 10.1016/j.cor.2006.10.021
ContentType	Journal Article
Copyright	2013 Elsevier B.V. Copyright Elsevier Sequoia S.A. Apr 1, 2014
Copyright_xml	– notice: 2013 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Apr 1, 2014
DBID	AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9
DOI	10.1016/j.ejor.2013.09.015
DatabaseName	CrossRef 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 Materials Business File Materials Research Database
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 Materials Research Database Materials Business File
DatabaseTitleList	Materials Research Database Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business
EISSN	1872-6860
EndPage	48
ExternalDocumentID	3169323551 10_1016_j_ejor_2013_09_015 S0377221713007704
Genre	Feature
GeographicLocations	United States--US China Shanghai China
GeographicLocations_xml	– name: Shanghai China – name: China – name: United States--US
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AALRI AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD 7SC 7TB 8FD AGCQF FR3 JQ2 L7M L~C L~D 7TA JG9
ID	FETCH-LOGICAL-c415t-275e8e7f5de314aa2ccf27732c92a2302f4f9e863cc25e01e7d27c83d1be36653
ISICitedReferencesCount	31
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000330148600004&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	Thu Oct 02 20:50:21 EDT 2025 Sun Sep 07 03:30:07 EDT 2025 Sat Nov 29 01:41:09 EST 2025 Tue Nov 18 22:35:30 EST 2025 Fri Feb 23 02:32:29 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Memetic algorithm Third-party logistics Packing Containerization Freight consolidation
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c415t-275e8e7f5de314aa2ccf27732c92a2302f4f9e863cc25e01e7d27c83d1be36653
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
PQID	1471910712
PQPubID	45678
PageCount	12
ParticipantIDs	proquest_miscellaneous_1671493253 proquest_journals_1471910712 crossref_citationtrail_10_1016_j_ejor_2013_09_015 crossref_primary_10_1016_j_ejor_2013_09_015 elsevier_sciencedirect_doi_10_1016_j_ejor_2013_09_015
PublicationCentury	2000
PublicationDate	2014-04-01 2014-4-00 20140401
PublicationDateYYYYMMDD	2014-04-01
PublicationDate_xml	– month: 04 year: 2014 text: 2014-04-01 day: 01
PublicationDecade	2010
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	European journal of operational research
PublicationYear	2014
Publisher	Elsevier B.V Elsevier Sequoia S.A
Publisher_xml	– name: Elsevier B.V – name: Elsevier Sequoia S.A
References	Moscato (b0150) 1999 Friesen, Langston (b0060) 1986; 15 Ahuja, Magnanti, Orlin (b0005) 1993 Jeong, Lee, Bookbinder (b0085) 2007; 41 Liu, Li, Chan (b0115) 2003; 39 Popken (b0165) 1994; 42 Dror, Hartman (b0045) 2007; 53 Marasco (b0130) 2008; 113 Holland (b0080) 1975 Martín, Román (b0135) 2004; 40 Moon, Kim, Choi, Seo (b0145) 2002; 140 Cunha, Silva (b0035) 2007; 179 Osogami, Okano (b0160) 2003; 9 Drezner, Hamacher (b0040) 2004 Leung, Hui, Wang, Chen (b0110) 2009; 57 Song, Hsu, Cheung (b0180) 2008; 56 Takano, Arai (b0190) 2009; 14 Back, Fogel, Michalewicz (b0015) 1999 Falkenauer (b0055) 1996; 2 Goldberg (b0065) 1989 Ta, Choo, Sum (b0185) 2000; 30 Croxton, Gendron, Magnanti (b0030) 2003; 37 Alves, Valério de Carvalho (b0010) 2007; 183 Wang, Zantow, Lai, Wang (b0195) 2006; 36 Haouari, Serairi (b0070) 2009; 36 Correia, Gouveia, Saldanha-da Gama (b0025) 2008; 35 Haouari, Serairi (b0075) 2011; 48 Kara, Tansel (b0095) 2001; 47 Kang, Park (b0090) 2003; 147 Ngueveu, Prins, Wolfler Calvo (b0155) 2010; 37 Lu, Hao (b0125) 2010; 203 Mitchell (b0140) 1998 Kratica, Stanimirovic, Tosic, Filipovic (b0105) 2007; 182 Simchi-Levi (b0170) 1994; 41 Epstein, Levin (b0050) 2008; 38 Klincewicz (b0100) 1990; 38 Coffman, Garey, Johnson (b0020) 1996 Sivanandam, Deepa (b0175) 2008 Loh, Golden, Wasil (b0120) 2008; 35 Goldberg (10.1016/j.ejor.2013.09.015_b0065) 1989 Haouari (10.1016/j.ejor.2013.09.015_b0075) 2011; 48 Ta (10.1016/j.ejor.2013.09.015_b0185) 2000; 30 Drezner (10.1016/j.ejor.2013.09.015_b0040) 2004 Kara (10.1016/j.ejor.2013.09.015_b0095) 2001; 47 Popken (10.1016/j.ejor.2013.09.015_b0165) 1994; 42 Simchi-Levi (10.1016/j.ejor.2013.09.015_b0170) 1994; 41 Moon (10.1016/j.ejor.2013.09.015_b0145) 2002; 140 Dror (10.1016/j.ejor.2013.09.015_b0045) 2007; 53 Croxton (10.1016/j.ejor.2013.09.015_b0030) 2003; 37 Haouari (10.1016/j.ejor.2013.09.015_b0070) 2009; 36 Mitchell (10.1016/j.ejor.2013.09.015_b0140) 1998 Liu (10.1016/j.ejor.2013.09.015_b0115) 2003; 39 Cunha (10.1016/j.ejor.2013.09.015_b0035) 2007; 179 Alves (10.1016/j.ejor.2013.09.015_b0010) 2007; 183 Lu (10.1016/j.ejor.2013.09.015_b0125) 2010; 203 Wang (10.1016/j.ejor.2013.09.015_b0195) 2006; 36 Kang (10.1016/j.ejor.2013.09.015_b0090) 2003; 147 Osogami (10.1016/j.ejor.2013.09.015_b0160) 2003; 9 Epstein (10.1016/j.ejor.2013.09.015_b0050) 2008; 38 Kratica (10.1016/j.ejor.2013.09.015_b0105) 2007; 182 Leung (10.1016/j.ejor.2013.09.015_b0110) 2009; 57 Marasco (10.1016/j.ejor.2013.09.015_b0130) 2008; 113 Falkenauer (10.1016/j.ejor.2013.09.015_b0055) 1996; 2 Klincewicz (10.1016/j.ejor.2013.09.015_b0100) 1990; 38 Jeong (10.1016/j.ejor.2013.09.015_b0085) 2007; 41 Ngueveu (10.1016/j.ejor.2013.09.015_b0155) 2010; 37 Sivanandam (10.1016/j.ejor.2013.09.015_b0175) 2008 Martín (10.1016/j.ejor.2013.09.015_b0135) 2004; 40 Takano (10.1016/j.ejor.2013.09.015_b0190) 2009; 14 Holland (10.1016/j.ejor.2013.09.015_b0080) 1975 Correia (10.1016/j.ejor.2013.09.015_b0025) 2008; 35 Ahuja (10.1016/j.ejor.2013.09.015_b0005) 1993 Coffman (10.1016/j.ejor.2013.09.015_b0020) 1996 Song (10.1016/j.ejor.2013.09.015_b0180) 2008; 56 Loh (10.1016/j.ejor.2013.09.015_b0120) 2008; 35 Moscato (10.1016/j.ejor.2013.09.015_b0150) 1999 Back (10.1016/j.ejor.2013.09.015_b0015) 1999 Friesen (10.1016/j.ejor.2013.09.015_b0060) 1986; 15
References_xml	– volume: 35 start-page: 2103 year: 2008 end-page: 2113 ident: b0025 article-title: Solving the variable size bin packing problem with discretized formulations publication-title: Computers & Operations Research – year: 2004 ident: b0040 article-title: Facility location: Applications and theory – year: 1998 ident: b0140 article-title: An introduction to genetic algorithms – volume: 57 start-page: 402 year: 2009 end-page: 412 ident: b0110 article-title: A 0–1 LP model for the integration and consolidation of air cargo shipments publication-title: Operations Research – volume: 39 start-page: 325 year: 2003 end-page: 339 ident: b0115 article-title: Mixed truck delivery systems with both hub-and-spoke and direct shipment publication-title: Transportation Research Part E: Logistics and Transportation Review – year: 1989 ident: b0065 article-title: Genetic algorithms in search, optimization, and machine learning – volume: 37 start-page: 1877 year: 2010 end-page: 1885 ident: b0155 article-title: An effective memetic algorithm for the cumulative capacitated vehicle routing problem publication-title: Computers & Operations Research – year: 1996 ident: b0020 publication-title: Approximation algorithms for bin packing: A survey – volume: 56 start-page: 1264 year: 2008 end-page: 1277 ident: b0180 article-title: Distribution coordination between suppliers and customers with a consolidation center publication-title: Operations Research – volume: 179 start-page: 747 year: 2007 end-page: 758 ident: b0035 article-title: A genetic algorithm for the problem of configuring a hub-and-spoke network for an LTL trucking company in Brazil publication-title: European Journal of Operational Research – year: 1975 ident: b0080 article-title: Adaptation in natural and artificial systems – volume: 47 start-page: 1408 year: 2001 end-page: 1420 ident: b0095 article-title: The latest arrival hub location problem publication-title: Management Science – volume: 15 start-page: 222 year: 1986 end-page: 230 ident: b0060 article-title: Variable sized bin packing publication-title: SIAM Journal on Computing – volume: 2 start-page: 5 year: 1996 end-page: 30 ident: b0055 article-title: A hybrid grouping genetic algorithm for bin packing publication-title: Journal of Heuristics – volume: 41 start-page: 523 year: 2007 end-page: 536 ident: b0085 article-title: The European freight railway system as a hub-and-spoke network publication-title: Transportation Research Part A: Policy and Practice – volume: 36 start-page: 793 year: 2006 end-page: 819 ident: b0195 article-title: Strategic postures of third-party logistics providers in mainland China publication-title: International Journal of Physical Distribution & Logistics Management – volume: 14 start-page: 256 year: 2009 end-page: 274 ident: b0190 article-title: A genetic algorithm for the hub-and-spoke problem applied to containerized cargo transport publication-title: Journal of Marine Science and Technology – volume: 147 start-page: 365 year: 2003 end-page: 372 ident: b0090 article-title: Algorithms for the variable sized bin packing problem publication-title: European Journal of Operational Research – volume: 113 start-page: 127 year: 2008 end-page: 147 ident: b0130 article-title: Third-party logistics: A literature review publication-title: International Journal of Production Economics – year: 2008 ident: b0175 article-title: Introduction to genetic algorithms – volume: 203 start-page: 241 year: 2010 end-page: 250 ident: b0125 article-title: A memetic algorithm for graph coloring publication-title: European Journal of Operational Research – volume: 40 start-page: 135 year: 2004 end-page: 150 ident: b0135 article-title: Analyzing competition for hub location in intercontinental avition markets publication-title: Transportation Research Part E: Logistics and Transportation Review – volume: 48 start-page: 345 year: 2011 end-page: 368 ident: b0075 article-title: Relaxations and exact solution of the variable sized bin packing problem publication-title: Computational Optimization and Applications – volume: 140 start-page: 606 year: 2002 end-page: 617 ident: b0145 article-title: An efficient genetic algorithm for the traveling salesman problem with precedence constraints publication-title: European Journal of Operational Research – volume: 53 start-page: 78 year: 2007 end-page: 87 ident: b0045 article-title: Shipment consolidation: Who pays for it and how much? publication-title: Management Science – volume: 9 start-page: 29 year: 2003 end-page: 49 ident: b0160 article-title: Local search algorithms for the bin packing problem and their relationships to various construction heuristics publication-title: Journal of Heuristics – volume: 41 start-page: 579 year: 1994 end-page: 585 ident: b0170 article-title: New worst-case results for the bin-packing problem publication-title: Naval Research Logistics – volume: 37 start-page: 1 year: 2003 end-page: 22 ident: b0030 article-title: Models and methods for merge-in-transit operations publication-title: Transportation Science – volume: 42 start-page: 274 year: 1994 end-page: 286 ident: b0165 article-title: An algorithm for the multiattribute, multicommodity flow problem with freight consolidation and inventory costs publication-title: Operations Research – volume: 183 start-page: 1333 year: 2007 end-page: 1352 ident: b0010 article-title: Accelerating column generation for variable sized bin-packing problems publication-title: European Journal of Operational Research – volume: 36 start-page: 2877 year: 2009 end-page: 2884 ident: b0070 article-title: Heuristics for the variable sized bin-packing problem publication-title: Computers & Operations Research – volume: 35 start-page: 2283 year: 2008 end-page: 2291 ident: b0120 article-title: Solving the one-dimensional bin packing problem with a weight annealing heuristic publication-title: Computers & Operations Research – volume: 38 start-page: 99 year: 1990 end-page: 109 ident: b0100 article-title: Solving a freight transport problem using facility location techniques publication-title: Operations Research – start-page: 219 year: 1999 end-page: 223 ident: b0150 article-title: Memetic algorithms: A short introduction publication-title: New ideas in optimization – volume: 182 start-page: 15 year: 2007 end-page: 28 ident: b0105 article-title: Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem publication-title: European Journal of Operational Research – volume: 38 start-page: 411 year: 2008 end-page: 428 ident: b0050 article-title: An APTAS for generalized cost variable-sized bin packing publication-title: SIAM Journal on Computing – year: 1999 ident: b0015 article-title: Basic algorithms and operators – volume: 30 start-page: 35 year: 2000 end-page: 54 ident: b0185 article-title: Transportation concerns of foreign firms in China publication-title: International Journal of Physical Distribution & Logistics Management – year: 1993 ident: b0005 article-title: Network flows: Theory, algorithms, and applications – year: 1999 ident: 10.1016/j.ejor.2013.09.015_b0015 – volume: 2 start-page: 5 year: 1996 ident: 10.1016/j.ejor.2013.09.015_b0055 article-title: A hybrid grouping genetic algorithm for bin packing publication-title: Journal of Heuristics doi: 10.1007/BF00226291 – volume: 42 start-page: 274 year: 1994 ident: 10.1016/j.ejor.2013.09.015_b0165 article-title: An algorithm for the multiattribute, multicommodity flow problem with freight consolidation and inventory costs publication-title: Operations Research doi: 10.1287/opre.42.2.274 – volume: 15 start-page: 222 year: 1986 ident: 10.1016/j.ejor.2013.09.015_b0060 article-title: Variable sized bin packing publication-title: SIAM Journal on Computing doi: 10.1137/0215016 – volume: 48 start-page: 345 year: 2011 ident: 10.1016/j.ejor.2013.09.015_b0075 article-title: Relaxations and exact solution of the variable sized bin packing problem publication-title: Computational Optimization and Applications doi: 10.1007/s10589-009-9276-z – volume: 140 start-page: 606 year: 2002 ident: 10.1016/j.ejor.2013.09.015_b0145 article-title: An efficient genetic algorithm for the traveling salesman problem with precedence constraints publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00227-2 – start-page: 219 year: 1999 ident: 10.1016/j.ejor.2013.09.015_b0150 article-title: Memetic algorithms: A short introduction – volume: 36 start-page: 2877 year: 2009 ident: 10.1016/j.ejor.2013.09.015_b0070 article-title: Heuristics for the variable sized bin-packing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2008.12.016 – volume: 40 start-page: 135 year: 2004 ident: 10.1016/j.ejor.2013.09.015_b0135 article-title: Analyzing competition for hub location in intercontinental avition markets publication-title: Transportation Research Part E: Logistics and Transportation Review doi: 10.1016/S1366-5545(03)00037-1 – year: 2008 ident: 10.1016/j.ejor.2013.09.015_b0175 – volume: 183 start-page: 1333 year: 2007 ident: 10.1016/j.ejor.2013.09.015_b0010 article-title: Accelerating column generation for variable sized bin-packing problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.07.033 – volume: 38 start-page: 411 year: 2008 ident: 10.1016/j.ejor.2013.09.015_b0050 article-title: An APTAS for generalized cost variable-sized bin packing publication-title: SIAM Journal on Computing doi: 10.1137/060670328 – volume: 182 start-page: 15 year: 2007 ident: 10.1016/j.ejor.2013.09.015_b0105 article-title: Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.06.056 – volume: 41 start-page: 523 year: 2007 ident: 10.1016/j.ejor.2013.09.015_b0085 article-title: The European freight railway system as a hub-and-spoke network publication-title: Transportation Research Part A: Policy and Practice – volume: 53 start-page: 78 year: 2007 ident: 10.1016/j.ejor.2013.09.015_b0045 article-title: Shipment consolidation: Who pays for it and how much? publication-title: Management Science doi: 10.1287/mnsc.1060.0607 – volume: 9 start-page: 29 year: 2003 ident: 10.1016/j.ejor.2013.09.015_b0160 article-title: Local search algorithms for the bin packing problem and their relationships to various construction heuristics publication-title: Journal of Heuristics doi: 10.1023/A:1021837611236 – year: 1996 ident: 10.1016/j.ejor.2013.09.015_b0020 – volume: 113 start-page: 127 year: 2008 ident: 10.1016/j.ejor.2013.09.015_b0130 article-title: Third-party logistics: A literature review publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2007.05.017 – volume: 41 start-page: 579 year: 1994 ident: 10.1016/j.ejor.2013.09.015_b0170 article-title: New worst-case results for the bin-packing problem publication-title: Naval Research Logistics doi: 10.1002/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G – volume: 37 start-page: 1 year: 2003 ident: 10.1016/j.ejor.2013.09.015_b0030 article-title: Models and methods for merge-in-transit operations publication-title: Transportation Science doi: 10.1287/trsc.37.1.1.12822 – volume: 147 start-page: 365 year: 2003 ident: 10.1016/j.ejor.2013.09.015_b0090 article-title: Algorithms for the variable sized bin packing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00247-3 – volume: 35 start-page: 2103 year: 2008 ident: 10.1016/j.ejor.2013.09.015_b0025 article-title: Solving the variable size bin packing problem with discretized formulations publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.10.014 – year: 1989 ident: 10.1016/j.ejor.2013.09.015_b0065 – year: 1975 ident: 10.1016/j.ejor.2013.09.015_b0080 – volume: 37 start-page: 1877 year: 2010 ident: 10.1016/j.ejor.2013.09.015_b0155 article-title: An effective memetic algorithm for the cumulative capacitated vehicle routing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.06.014 – volume: 57 start-page: 402 year: 2009 ident: 10.1016/j.ejor.2013.09.015_b0110 article-title: A 0–1 LP model for the integration and consolidation of air cargo shipments publication-title: Operations Research doi: 10.1287/opre.1080.0583 – volume: 39 start-page: 325 year: 2003 ident: 10.1016/j.ejor.2013.09.015_b0115 article-title: Mixed truck delivery systems with both hub-and-spoke and direct shipment publication-title: Transportation Research Part E: Logistics and Transportation Review doi: 10.1016/S1366-5545(03)00005-X – volume: 56 start-page: 1264 year: 2008 ident: 10.1016/j.ejor.2013.09.015_b0180 article-title: Distribution coordination between suppliers and customers with a consolidation center publication-title: Operations Research doi: 10.1287/opre.1070.0488 – year: 2004 ident: 10.1016/j.ejor.2013.09.015_b0040 – year: 1998 ident: 10.1016/j.ejor.2013.09.015_b0140 – volume: 47 start-page: 1408 year: 2001 ident: 10.1016/j.ejor.2013.09.015_b0095 article-title: The latest arrival hub location problem publication-title: Management Science doi: 10.1287/mnsc.47.10.1408.10258 – volume: 179 start-page: 747 year: 2007 ident: 10.1016/j.ejor.2013.09.015_b0035 article-title: A genetic algorithm for the problem of configuring a hub-and-spoke network for an LTL trucking company in Brazil publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.03.057 – volume: 38 start-page: 99 year: 1990 ident: 10.1016/j.ejor.2013.09.015_b0100 article-title: Solving a freight transport problem using facility location techniques publication-title: Operations Research doi: 10.1287/opre.38.1.99 – year: 1993 ident: 10.1016/j.ejor.2013.09.015_b0005 – volume: 30 start-page: 35 year: 2000 ident: 10.1016/j.ejor.2013.09.015_b0185 article-title: Transportation concerns of foreign firms in China publication-title: International Journal of Physical Distribution & Logistics Management doi: 10.1108/09600030010307975 – volume: 14 start-page: 256 year: 2009 ident: 10.1016/j.ejor.2013.09.015_b0190 article-title: A genetic algorithm for the hub-and-spoke problem applied to containerized cargo transport publication-title: Journal of Marine Science and Technology doi: 10.1007/s00773-008-0035-0 – volume: 36 start-page: 793 year: 2006 ident: 10.1016/j.ejor.2013.09.015_b0195 article-title: Strategic postures of third-party logistics providers in mainland China publication-title: International Journal of Physical Distribution & Logistics Management doi: 10.1108/09600030610714607 – volume: 203 start-page: 241 year: 2010 ident: 10.1016/j.ejor.2013.09.015_b0125 article-title: A memetic algorithm for graph coloring publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.07.016 – volume: 35 start-page: 2283 year: 2008 ident: 10.1016/j.ejor.2013.09.015_b0120 article-title: Solving the one-dimensional bin packing problem with a weight annealing heuristic publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.10.021
SSID	ssj0001515
Score	2.2740562
Snippet	•Introduced a new freight transportation problem.•Proposed a linear programming formulation for the problem.•Designed a customized memetic algorithm to solve... In today's global free market, third-party logistics providers (3PLs) are becoming increasingly important. This paper studies a problem faced by a 3PL...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	37
SubjectTerms	China Consolidation Containerization Containers Costs Freight consolidation Freight forwarding Integer programming Mathematical models Memetic algorithm Packing Parcels Ports Route optimization Shipments Studies Third party Third-party logistics Transportation problem (Operations research) Warehouses
Title	The freight consolidation and containerization problem
URI	https://dx.doi.org/10.1016/j.ejor.2013.09.015 https://www.proquest.com/docview/1471910712 https://www.proquest.com/docview/1671493253
Volume	234
WOSCitedRecordID	wos000330148600004&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/eLvHCXMwtV3db9MwELegQ2g88FGGKAwUJMTLFDTbSRw_TqjTQFVhUoeqvViJa2utUNq1Dar46znHlyzrtGk88BJFrhOnvvP57nz3O0I-0jTJU2ajkGrOwmgSgxyMwFgBYWg1TTObV3BNPwdiOEzHY_kDUwhWVTkBURTpZiMX_5XU0AbEdqmz_0Du5qXQAPdAdLgC2eF6b8LbZeXxdDHlMNjU103CFLbCOQPgQ3z-5QFWlLnVQ4_aKjQsa78hAgQ1juRTj0NwUt7wQp9P_1xc5ZqdVpED5xflpmxFAvlyzq3ASvRB0HboCuZeCREy5rMwa7nK0EvZZiAvJT3MC-63HmjzhiT3ToXZZzObO9hWyis4Wp_6eR02e_hdHZ8NBmrUH48-LS5DV1HMnbxjeZWHZIeJWKYdsnP0tT_-1uzTTpWrzpjw2zGlykf_bQ97m9qytYFXWsnoOXmK5kRw5NngBXlgii55XGczdMmzumpHgEK8S560IChfkgTYJUB2Ca6xSwDsEmyzS4DsskfOjvujLych1tIINaho6xCmwKRG2HhiOI2yjGltmRCcackyMENhuVpp0oRrzWJzSI2YMKFTPqG54UkS81ekU8wL85oEcSRNIoU2MZeR1SzPrdQwCtja2lId9Qitp0ppBJp39U5-qTqicKbc9Co3vepQKpjeHjlonll4mJU7e8c1BRQqil4BVMA9dz63X5NL4Qpage0rKOjMgrIe-dD8DELWnZxlhZmX0CcR8O84i_mbe_R5S3avFsk-6ayXpXlHHunf6-lq-R7Z8C_PS59W
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+consolidation+and+containerization+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Qin%2C+Hu&rft.au=Zhang%2C+Zizhen&rft.au=Qi%2C+Zhuxuan&rft.au=Lim%2C+Andrew&rft.date=2014-04-01&rft.issn=0377-2217&rft.volume=234&rft.issue=1&rft.spage=37&rft.epage=48&rft_id=info:doi/10.1016%2Fj.ejor.2013.09.015&rft.externalDBID=NO_FULL_TEXT
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