Modelling Cross-Docking in a Three-Level Supply Chain with Stochastic Service and Queuing System: MOWFA Algorithm

In today’s competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In many production environments, sending goods directly from the producer to the consumer brings many problems. Therefore, an efficient transport...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithms Vol. 15; no. 8; p. 265
Main Authors:	Rostami, Parinaz, Avakh Darestani, Soroush, Movassaghi, Mitra
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.08.2022
Subjects:	Algorithms Cost control Cost reduction cross-docks Docks Genetic algorithms Heuristic methods Integer programming Inventory Linear programming Logistics Mathematical models multi-objective simulated annealing algorithm multi-objective water flow algorithm non-dominated sorting genetic algorithm Optimization Probability theory Queuing theory Raw materials Scheduling Simulated annealing Sorting algorithms Statistical analysis Statistical tests Supply chain management Supply chains Taguchi methods Transportation systems Trucks Vehicles Warehouses Warehousing Warehousing management Water flow
ISSN:	1999-4893, 1999-4893
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	In today’s competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In many production environments, sending goods directly from the producer to the consumer brings many problems. Therefore, an efficient transport system should be established between producers and consumers. Such a system is designed in the field of supply chain management knowledge. Supply chain management is the evolutionary result of warehousing management and is one of the important infrastructural foundations of business implementation, in many of which the main effort is to shorten the time between the customer’s order and the actual delivery of the goods. In this research, the supply chain consists of three levels. Suppliers are placed on the first level, cross-docks on the second level, and factories on the third level. In this system, a number of suppliers send different raw materials to several different cross-docks. Each channel is assigned to a cross-dock for a specific product. The main goal of this article is to focus on optimizing the planning of incoming and outgoing trucks with the aim of minimizing the total operation time within the supply chain. The arrival rate of goods from suppliers to the cross-dock is stochastic with a general probability distribution. On the other hand, the time required to prepare and send the goods is random with a general probability distribution. The service time in each cross-dock depends on the number of its doors. Therefore, each cross-dock can be modeled as a G/G/m queueing system where m represents the number of doors. The mathematical model of the research has been developed based on these assumptions. Since the problem is NP-hard, the time to solve it increases drastically with the increase in the dimensions of the problem. Therefore, three metaheuristics, including multi-objective water flow, non-dominated sorting genetic, and a multi-objective simulated annealing algorithm have been used to find near-optimal solutions to the problem. After adjusting the parameters of the algorithms using the Taguchi method, the results obtained from the algorithms were analyzed with a statistical test and the performance of the algorithms was evaluated. The results vividly demonstrate that non-dominated sorting genetics is the best of all.
AbstractList	In today’s competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In many production environments, sending goods directly from the producer to the consumer brings many problems. Therefore, an efficient transport system should be established between producers and consumers. Such a system is designed in the field of supply chain management knowledge. Supply chain management is the evolutionary result of warehousing management and is one of the important infrastructural foundations of business implementation, in many of which the main effort is to shorten the time between the customer’s order and the actual delivery of the goods. In this research, the supply chain consists of three levels. Suppliers are placed on the first level, cross-docks on the second level, and factories on the third level. In this system, a number of suppliers send different raw materials to several different cross-docks. Each channel is assigned to a cross-dock for a specific product. The main goal of this article is to focus on optimizing the planning of incoming and outgoing trucks with the aim of minimizing the total operation time within the supply chain. The arrival rate of goods from suppliers to the cross-dock is stochastic with a general probability distribution. On the other hand, the time required to prepare and send the goods is random with a general probability distribution. The service time in each cross-dock depends on the number of its doors. Therefore, each cross-dock can be modeled as a G/G/m queueing system where m represents the number of doors. The mathematical model of the research has been developed based on these assumptions. Since the problem is NP-hard, the time to solve it increases drastically with the increase in the dimensions of the problem. Therefore, three metaheuristics, including multi-objective water flow, non-dominated sorting genetic, and a multi-objective simulated annealing algorithm have been used to find near-optimal solutions to the problem. After adjusting the parameters of the algorithms using the Taguchi method, the results obtained from the algorithms were analyzed with a statistical test and the performance of the algorithms was evaluated. The results vividly demonstrate that non-dominated sorting genetics is the best of all.
Audience	Academic
Author	Rostami, Parinaz Avakh Darestani, Soroush Movassaghi, Mitra
Author_xml	– sequence: 1 givenname: Parinaz surname: Rostami fullname: Rostami, Parinaz – sequence: 2 givenname: Soroush surname: Avakh Darestani fullname: Avakh Darestani, Soroush – sequence: 3 givenname: Mitra surname: Movassaghi fullname: Movassaghi, Mitra
BookMark	eNptkUtvEzEUhS1UJNrCgn9giRWLaf2aGZtdFChUSlWhFLG0rh-TOEzGqcdTlH-Ph6AKIeSFfa_P-Xzke4HOhjh4hN5ScsW5ItdAayIJa-oX6JwqpSohFT_76_wKXYzjjpCmVg09R4930fm-D8MGL1Mcx-pjtD_mKgwY8MM2eV-t_JPv8Xo6HPojXm6hXP0MeYvXOdotjDlYvPbpKViPYXD46-SnmbA-jtnvP-C7--83C7zoNzEV1_41etlBP_o3f_ZL9O3m08PyS7W6_3y7XKwqy1WbK8ENN9KAoJ1hHYPGQqcsd4o4ymQnjQLSMsZU7WXjKTOmlk7UTDhCnSOMX6LbE9dF2OlDCntIRx0h6N-NmDYaUsnee22kssIWuFRKKN8akA64INQyZnltC-vdiXVI8XHyY9a7OKWhxNesJQ1phGxFUV2dVBso0DB0MSewZTm_D7bMqQulv2hFTQUncja8Pxns_PXJd88xKdHzOPXzOIv2-h-tDRlyiEN5JPT_cfwCdNeiBA
CitedBy_id	crossref_primary_10_3390_math12050736 crossref_primary_10_1016_j_eswa_2022_118741 crossref_primary_10_1016_j_jer_2023_100015
Cites_doi	10.1016/j.compchemeng.2014.06.015 10.1016/j.compchemeng.2015.04.039 10.1016/j.cor.2018.01.022 10.1016/j.omega.2018.12.004 10.1016/j.tre.2020.102210 10.1016/j.cie.2020.106391 10.1016/j.cie.2016.03.023 10.1016/j.ijpe.2019.02.017 10.1016/j.jclepro.2018.12.106 10.1016/j.cor.2021.105271 10.1016/j.tre.2020.102060 10.1007/s40092-017-0203-0 10.1016/j.ress.2018.01.007 10.1109/ICACSIS.2016.7872734 10.1016/j.cor.2021.105526 10.1016/j.cie.2021.107299 10.1007/s10845-008-0125-1 10.1016/j.cie.2018.02.012 10.1016/j.cie.2020.106832 10.1016/j.cor.2020.105205 10.1016/j.cie.2018.03.007 10.1016/j.asoc.2018.11.029 10.1016/j.ejor.2018.11.033 10.1016/j.omega.2012.01.005 10.5772/9717 10.1016/j.ejor.2019.04.028 10.1016/j.cor.2021.105513 10.1016/j.cie.2009.06.006 10.1016/j.ejor.2006.10.047 10.1016/j.apm.2015.03.005 10.1016/j.ejor.2007.10.051 10.1016/j.cie.2018.01.009 10.1007/s10845-016-1229-7 10.1080/713682769 10.1016/j.apm.2019.01.047 10.1016/j.cie.2021.107240 10.1109/CIRA.2007.382928 10.1016/j.compchemeng.2015.02.003 10.1016/j.cie.2016.01.018
ContentType	Journal Article
Copyright	COPYRIGHT 2022 MDPI AG 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: COPYRIGHT 2022 MDPI AG – notice: 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	AAYXX CITATION 3V. 7SC 7TB 7XB 8AL 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO FR3 GNUQQ HCIFZ JQ2 K7- KR7 L6V L7M L~C L~D M0N M7S P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U DOA
DOI	10.3390/a15080265
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Database Suite (ProQuest) ProQuest Technology Collection ProQuest One ProQuest Central Korea Engineering Research Database ProQuest Central Student SciTech Collection (ProQuest) ProQuest Computer Science Collection Computer Science Database (ProQuest) Civil Engineering Abstracts ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Engineering Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection Civil Engineering Abstracts ProQuest Computing Engineering Database ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni)
DatabaseTitleList	CrossRef Publicly Available Content Database
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1999-4893
ExternalDocumentID	oai_doaj_org_article_b89c4cc3d89949e7ba8da3401c22c35c A745143084 10_3390_a15080265
GroupedDBID	23M 2WC 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ABUWG ACUHS ADBBV AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS AMVHM ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO E3Z ESX GNUQQ GROUPED_DOAJ HCIFZ IAO ICD ITC J9A K6V K7- KQ8 L6V M7S MODMG M~E OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS TR2 TUS 3V. 7SC 7TB 7XB 8AL 8FD 8FK FR3 JQ2 KR7 L7M L~C L~D M0N P62 PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c397t-43b3b8ba41fb2f2a6caf9c3d90d128f8b9a0722295e86e12bb58d4524d01dd023
IEDL.DBID	DOA
ISICitedReferencesCount	7
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000846311100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1999-4893
IngestDate	Fri Oct 03 12:50:29 EDT 2025 Fri Jul 25 12:11:47 EDT 2025 Tue Nov 04 17:55:59 EST 2025 Tue Nov 18 21:41:31 EST 2025 Sat Nov 29 07:08:13 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	8
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c397t-43b3b8ba41fb2f2a6caf9c3d90d128f8b9a0722295e86e12bb58d4524d01dd023
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
OpenAccessLink	https://doaj.org/article/b89c4cc3d89949e7ba8da3401c22c35c
PQID	2706064874
PQPubID	2032439
ParticipantIDs	doaj_primary_oai_doaj_org_article_b89c4cc3d89949e7ba8da3401c22c35c proquest_journals_2706064874 gale_infotracacademiconefile_A745143084 crossref_primary_10_3390_a15080265 crossref_citationtrail_10_3390_a15080265
PublicationCentury	2000
PublicationDate	2022-08-01
PublicationDateYYYYMMDD	2022-08-01
PublicationDate_xml	– month: 08 year: 2022 text: 2022-08-01 day: 01
PublicationDecade	2020
PublicationPlace	Basel
PublicationPlace_xml	– name: Basel
PublicationTitle	Algorithms
PublicationYear	2022
Publisher	MDPI AG
Publisher_xml	– name: MDPI AG
References	Ahmadizar (ref_13) 2015; 39 Gelareh (ref_23) 2018; 91 Yu (ref_46) 2021; 129 Baniamerian (ref_27) 2019; 75 Seyedi (ref_28) 2019; 32 Musavi (ref_24) 2018; 8 ref_17 Mendez (ref_16) 2015; 80 Corsten (ref_30) 2019; 90 Goodarzi (ref_38) 2020; 20 Nahavandi (ref_18) 2018; 11 Qiu (ref_48) 2021; 147 Fard (ref_35) 2019; 213 Ardakani (ref_39) 2020; 11 Yu (ref_8) 2008; 184 Dulebenets (ref_31) 2019; 212 Nassief (ref_25) 2018; 94 Dondo (ref_11) 2015; 76 Ahkamiraad (ref_19) 2018; 119 Bachlaus (ref_4) 2008; 19 Castellucci (ref_43) 2021; 132 Apte (ref_3) 2000; 3 Nikzamir (ref_41) 2020; 142 Asian (ref_42) 2021; 157 Goodarzi (ref_36) 2020; 149 Shaelaie (ref_26) 2018; 118 Goodarzi (ref_45) 2021; 21 Baniamerian (ref_20) 2018; 14 Khorshidian (ref_34) 2019; 30 Hadipour (ref_33) 2019; 192 Rahbari (ref_32) 2019; 70 Molavi (ref_21) 2018; 117 Moghadam (ref_12) 2014; 69 Theophilus (ref_47) 2021; 156 Yu (ref_14) 2016; 94 Fonseca (ref_22) 2018; 275 Goodarzi (ref_44) 2021; 138 Smith (ref_49) 2022; 137 Agustina (ref_1) 2010; 2 Movassaghi (ref_37) 2020; 79 Amini (ref_15) 2016; 96 Vahdani (ref_10) 2010; 58 Valckenaers (ref_2) 2012; 40 Nogueira (ref_40) 2020; 143 Rijal (ref_29) 2019; 278 ref_5 ref_7 ref_6 Chen (ref_9) 2009; 193
References_xml	– volume: 69 start-page: 98 year: 2014 ident: ref_12 article-title: Vehicle routing scheduling problem with cross docking and split deliveries publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2014.06.015 – volume: 80 start-page: 15 year: 2015 ident: ref_16 article-title: A branch-and-price approach to evaluate the role of cross-docking operations in consolidated supply chains publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2015.04.039 – ident: ref_5 – volume: 94 start-page: 76 year: 2018 ident: ref_25 article-title: A comparison of formulations and relaxations for cross-dock door assignment problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.01.022 – volume: 91 start-page: 102015 year: 2018 ident: ref_23 article-title: A comparative study of formulations for a cross-dock door assignment problem publication-title: Omega doi: 10.1016/j.omega.2018.12.004 – volume: 147 start-page: 102210 year: 2021 ident: ref_48 article-title: The two-echelon production routing problem with cross-docking satellites publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2020.102210 – volume: 143 start-page: 106391 year: 2020 ident: ref_40 article-title: Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2020.106391 – volume: 96 start-page: 180 year: 2016 ident: ref_15 article-title: A bi-objective truck scheduling problem in a cross-docking center with probability of breakdown for trucks publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2016.03.023 – volume: 212 start-page: 236 year: 2019 ident: ref_31 article-title: A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2019.02.017 – volume: 213 start-page: 21 year: 2019 ident: ref_35 article-title: Assignment and scheduling trucks in cross-docking system with energy consumption consideration and trucks queuing publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2018.12.106 – volume: 132 start-page: 105271 year: 2021 ident: ref_43 article-title: Network scheduling problem with cross-docking and loading constraints publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2021.105271 – volume: 142 start-page: 102060 year: 2020 ident: ref_41 article-title: A healthcare logistic network considering stochastic emission of contamination: Bi-objective model and solution algorithm publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2020.102060 – volume: 14 start-page: 15 year: 2018 ident: ref_20 article-title: Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction publication-title: J. Ind. Eng. Int. doi: 10.1007/s40092-017-0203-0 – volume: 192 start-page: 106048 year: 2019 ident: ref_33 article-title: Redundancy allocation in series-parallel systems under warm standby and active components in repairable subsystems publication-title: Reliab. Eng. Syst. Saf. doi: 10.1016/j.ress.2018.01.007 – ident: ref_17 doi: 10.1109/ICACSIS.2016.7872734 – volume: 21 start-page: 1569 year: 2021 ident: ref_45 article-title: Reliable cross-docking location problem under the risk of disruptions publication-title: Oper. Res. – volume: 137 start-page: 105526 year: 2022 ident: ref_49 article-title: A multi-tiered vehicle routing problem with global cross-docking publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2021.105526 – volume: 157 start-page: 107299 year: 2021 ident: ref_42 article-title: A routing and scheduling problem for cross-docking networks with perishable products, heterogeneous vehicles and split delivery publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2021.107299 – volume: 19 start-page: 747 year: 2008 ident: ref_4 article-title: Designing an integrated multi-echelon agile supply chain network: A hybrid taguchi-particle swarm optimization approach publication-title: J. Intell. Manuf. doi: 10.1007/s10845-008-0125-1 – volume: 118 start-page: 67 year: 2018 ident: ref_26 article-title: Integration of parts transportation without cross docking in a supply chain publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2018.02.012 – volume: 149 start-page: 106832 year: 2020 ident: ref_36 article-title: A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2020.106832 – volume: 8 start-page: 2 year: 2018 ident: ref_24 article-title: A bi-objective model for pickup and delivery pollution routing problem with integration and consolidation shipments in cross-docking system publication-title: Iran. J. Oper. Res. – volume: 129 start-page: 105205 year: 2021 ident: ref_46 article-title: Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2020.105205 – volume: 90 start-page: 207 year: 2019 ident: ref_30 article-title: Integrating truck and workforce scheduling in a cross-dock: Analysis of different workforce coordination policies publication-title: J. Bus. Econ. – volume: 119 start-page: 76 year: 2018 ident: ref_19 article-title: Capacitated and multiple cross-docked vehicle routing problem with pickup, delivery, and time windows publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2018.03.007 – volume: 75 start-page: 441 year: 2019 ident: ref_27 article-title: Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2018.11.029 – volume: 20 start-page: 2397 year: 2020 ident: ref_38 article-title: Vehicle routing problem in a kanban controlled supply chain system considering cross-docking strategy publication-title: Oper. Res. – volume: 275 start-page: 139 year: 2018 ident: ref_22 article-title: A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2018.11.033 – volume: 11 start-page: 1 year: 2018 ident: ref_18 article-title: A Multi-Objective Imperialist Competitive Algorithm for Vehicle Routing Problem in Cross-docking Networks with Time Windows publication-title: J. Ind. Syst. Eng. – volume: 79 start-page: 2 year: 2020 ident: ref_37 article-title: Cross-docks scheduling with multiple doors using fuzzy approach publication-title: Eur. Transp. – volume: 40 start-page: 827 year: 2012 ident: ref_2 article-title: Cross-docking: State of the art publication-title: J. Omega doi: 10.1016/j.omega.2012.01.005 – volume: 2 start-page: 47 year: 2010 ident: ref_1 article-title: A Review: Mathematical Modles for Cross Docking Planning publication-title: Int. J. Eng. Bus. Manag. doi: 10.5772/9717 – volume: 278 start-page: 752 year: 2019 ident: ref_29 article-title: Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2019.04.028 – volume: 138 start-page: 105513 year: 2021 ident: ref_44 article-title: An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2021.105513 – volume: 58 start-page: 12 year: 2010 ident: ref_10 article-title: Scheduling trucks in cross-docking systems: Robust meta-heuristics publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2009.06.006 – volume: 184 start-page: 377 year: 2008 ident: ref_8 article-title: Scheduling of inbound and outbound trucks in cross docking systems with temporary storage publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.10.047 – volume: 39 start-page: 7065 year: 2015 ident: ref_13 article-title: Two-level vehicle routing with cross-docking in a three-echelon supply chain: A genetic algorithm approach publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2015.03.005 – ident: ref_6 – volume: 193 start-page: 59 year: 2009 ident: ref_9 article-title: Minimizing the makespan in a two-machine cross-docking flow shop problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.10.051 – volume: 117 start-page: 29 year: 2018 ident: ref_21 article-title: Truck scheduling in a cross docking systems with fixed due dates and shipment sorting publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2018.01.009 – volume: 30 start-page: 163 year: 2019 ident: ref_34 article-title: An intelligent truck scheduling and transportation planning optimization model for product portfolio in a cross-dock publication-title: J. Intell. Manuf. doi: 10.1007/s10845-016-1229-7 – volume: 11 start-page: 201 year: 2020 ident: ref_39 article-title: Truck-to-door sequencing in multi-door cross-docking system with dock repeat truck holding patter publication-title: Int. J. Ind. Eng. Comput. – volume: 3 start-page: 291 year: 2000 ident: ref_3 article-title: Effective Cross Docking for Improving Distribution Efficiencies publication-title: Int. J. Logist. Res. Appl. doi: 10.1080/713682769 – volume: 32 start-page: 296 year: 2019 ident: ref_28 article-title: Truck Scheduling in a Cross-Docking Terminal by Using Novel Robust Heuristics publication-title: Int. J. Eng. – volume: 70 start-page: 605 year: 2019 ident: ref_32 article-title: The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: Two robust bi-objective models publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2019.01.047 – volume: 156 start-page: 107240 year: 2021 ident: ref_47 article-title: Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2021.107240 – ident: ref_7 doi: 10.1109/CIRA.2007.382928 – volume: 76 start-page: 42 year: 2015 ident: ref_11 article-title: The heterogeneous vehicle routing and truck scheduling problem in a multi-door cross-dock system publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2015.02.003 – volume: 94 start-page: 6 year: 2016 ident: ref_14 article-title: Open vehicle routing problem with cross-docking publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2016.01.018
SSID	ssj0065961
Score	2.2992806
SecondaryResourceType	review_article
Snippet	In today’s competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In... In today's competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In...
SourceID	doaj proquest gale crossref
SourceType	Open Website Aggregation Database Enrichment Source Index Database
StartPage	265
SubjectTerms	Algorithms Cost control Cost reduction cross-docks Docks Genetic algorithms Heuristic methods Integer programming Inventory Linear programming Logistics Mathematical models multi-objective simulated annealing algorithm multi-objective water flow algorithm non-dominated sorting genetic algorithm Optimization Probability theory Queuing theory Raw materials Scheduling Simulated annealing Sorting algorithms Statistical analysis Statistical tests Supply chain management Supply chains Taguchi methods Transportation systems Trucks Vehicles Warehouses Warehousing Warehousing management Water flow
SummonAdditionalLinks	– databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NTxQxFH9R9OAFUDSsgGmMiVwadqad2Q4Xs27YeFDUAJFb069hSWAWdmdN_O95r9tZYoJcvE6byWve6_toX38_gA-1z0Sh6Npd1oLLUhhuvS15cJg7SOul77tINjE4Plbn59WPdOA2T22VnU-MjtpPHZ2RH-QE81Jiei0_3dxyYo2i29VEofEUnhFKQhZb9046T1wWVZkt0YQElvYHhrDPseYo_opBEar_Xw45Rpnxxv_KtwnrKb9kw6VBvIQnoXkFGx13A0tbeQtuiQQt4nGzEQnJMdrQqTm7bJhhp6jhwL9SQxGLvJ9_2GhicIiObdlJO3UTQwDPLLkaZhrPfi7Cgv6wBEE_ZN--_xoP2fDqAsVsJ9ev4Wx8dDr6whP9AneYpLRcCiusskZmtc3r3JTO1JUTvup7DGq1spXpDyIdeFBlyHJrC-VlkaN6M-8xF3gDa820CdvAfKhVwCnoLoIMDnOU0ivvsgpNJbNF6MF-pxDtEjY5UWRcaaxRSHd6pbsevF9NvVkCcjw06TNpdTWBMLTjh-nsQqctqa2qnHS4ICw5ZRUG1ihvBNabLs-dKFwPPpJNaNrpKIwz6cECLokws_RwICnb7CvZg93OJnRyAXN9bxBvHx_egRc5vamIXYW7sNbOFmEPnrvf7eV89i5a9B1JUQBf priority: 102 providerName: ProQuest
Title	Modelling Cross-Docking in a Three-Level Supply Chain with Stochastic Service and Queuing System: MOWFA Algorithm
URI	https://www.proquest.com/docview/2706064874 https://doaj.org/article/b89c4cc3d89949e7ba8da3401c22c35c
Volume	15
WOSCitedRecordID	wos000846311100001&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: DOA dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: M~E dateStart: 20080101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Computer Science Database (ProQuest) customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: K7- dateStart: 20080301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: M7S dateStart: 20080301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central Database Suite (ProQuest) customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: BENPR dateStart: 20080301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: PIMPY dateStart: 20080301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9NAEB6hwoELb0RoiVYICS6r2t61vcstjRKBoCHQIspptS-3lYpD0wSJC7-dmbUTgQTiwsUHe2yv57Ezs579BuBZE3JRKvrtLhvBZSUsd8FVPHqMHaQLMmQ-NZuoZzN1cqLnv7T6opqwDh64Y9y-U9pL70XAxEDqWDurghWYFfii8KL0NPtmtd4kU90cXJW6yjscIYFJ_b4l1HPMNsrfvE8C6f_bVJz8y_QO3OoDQzbqBnQXrsX2HtzeNF1gvQ3eh0vqXpaAtNmY3sHRTdByNztvmWXHKJrI31IlEEsNO7-z8Rkm_4zWW9nRauHPLCEzs36OYLYN7P06rukJHXr5S3b47tN0xEYXp4sl3vXlAXycTo7Hr3jfN4F7jC5WXAonnHJW5o0rmsJW3jYaOaizgN6oUU7brE59vKOqYl44V6ogywLlkoeATvwh7LSLNj4CFmKjIpKgnUcZPQYXVVDB5xplnLsyDuDFhp_G96Di1NviwmByQaw3W9YP4OmW9GuHpPEnogMSypaAwK_TCVQJ06uE-ZdKDOA5idSQieJgvO13GuAnEdiVGdWSwsRMyQHsbaRuetu9MgUBClWYyMnH_2M0u3CzoC0TqWhwD3ZWy3V8Ajf8t9X51XII1w8ms_mHYVJfPL6p-ZDqT4_o-GOC1-evD-effwI_wvj8
linkProvider	Directory of Open Access Journals
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1db9MwFLWmgQQvjE9RNsBCIHiJlthO4iAhVArVpnYFRBF7M_7KOmlLtzYF7U_xG7nXSYqQgLc98JpYUewcn3tvbJ9DyNPSJTyVuOwuSh6JjOvIOJNF3kLuIIwTLrbBbCKfTOThYfFhg_zozsLgtsqOEwNRu7nFf-S7DGVeMkivxeuz8whdo3B1tbPQaGAx8hffoWRbvtp_C9_3GWPDd9PBXtS6CkQWYm8dCW64kUaLpDSsZDqzuiwsd0XsgKtLaQod58Hl2svMJ8yYVDqRMnjrxLkgdACUf0VwmeO8GuVRx_xZWmRJo17EeRHvatRahxon_S3mBWuAvwWAENWGW__beNwkN9r8mfYbwN8iG766TbY6bwraUtUdco4mb0FvnA5wUCKIprgqQI8rqukUEOyjMW6YosHX9IIOZhpu4W9p-qme25lGAWvaUinVlaMfV36FT2hE3l_Sg_dfhn3aPzmCYalnp3fJ50vp-D2yWc0rf59Q50vpoQnQoRfeQg6WOelsUsBUSEzqe-RFBwBlW-11tAA5UVCDIVbUGis98mTd9KwRHPlTozeIonUD1AgPF-aLI9VSjjKysMJCh6CkFoXPjZZOc6inLWOWp7ZHniMGFTIZvIzV7YEM6BJqgql-LjCbjqXokZ0Og6qluKX6BcAH_779mFzbmx6M1Xh_Mtom1xmeHwk7KHfIZr1Y-Yfkqv1WHy8Xj8JsouTrZcP1JxTBXRo
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1db9MwFLWmDiFeGJ-iMMBCIHiJmthO6iAhVDoqqm2liCG2J-OvrJNGurUpaH-NX8e9TlKEBLztgdfEimLn-Nx7Y_scQp4WLuGpxGV3UfBIZFxHxpks8hZyB2GccLENZhP9yUQeHubTDfKjPQuD2ypbTgxE7eYW_5H3GMq8ZJBei17RbIuY7oxen51H6CCFK62tnUYNkV1_8R3Kt-Wr8Q5862eMjd4eDN9FjcNAZCEOV5HghhtptEgKwwqmM6uL3HKXxw54u5Am13E_OF57mfmEGZNKJ1IGPUicC6IHQP-bkJIL1iGb0_H-9KiNA1maZ0mtZcR5Hvc0Kq9DxZP-FgGDUcDfwkGIcaOt_3l0bpDrTWZNB_VUuEk2fHmLbLWuFbQhsdvkHO3fghI5HeIARRBncb2AnpRU0wPAto_2cCsVDY6nF3Q403ALf1jTj9XczjRKW9OGZKkuHf2w8it8Qi3__pLuv_88GtDB6TEMSzX7eod8upSO3yWdcl76e4Q6X0gPTYAovfAWsrPMSWeTHCZJYlLfJS9aMCjbqLKjOcipguoMcaPWuOmSJ-umZ7UUyZ8avUFErRugeni4MF8cq4aMlJG5FRY6BMW2yH3faOk0h0rbMmZ5arvkOeJRIcfBy1jdHNWALqFamBr0BebZsRRdst3iUTXkt1S_wHj_37cfk6uAUrU3nuw-INcYHiwJWyu3SadarPxDcsV-q06Wi0fN1KLky2Xj9Sfukmeb
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=Modelling+Cross-Docking+in+a+Three-Level+Supply+Chain+with+Stochastic+Service+and+Queuing+System%3A+MOWFA+Algorithm&rft.jtitle=Algorithms&rft.au=Parinaz+Rostami&rft.au=Soroush+Avakh+Darestani&rft.au=Mitra+Movassaghi&rft.date=2022-08-01&rft.pub=MDPI+AG&rft.eissn=1999-4893&rft.volume=15&rft.issue=8&rft.spage=265&rft_id=info:doi/10.3390%2Fa15080265&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_b89c4cc3d89949e7ba8da3401c22c35c
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1999-4893&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1999-4893&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1999-4893&client=summon