Milk-run Routing and Scheduling Subject to Fuzzy Pickup and Delivery Time Constraints: An Ordered Fuzzy Numbers Approach

被引:13
作者
Bocewicz, Grzegorz [1 ]
Banaszak, Zbigniew [1 ]
Rudnik, Katarzyna [2 ]
Witczak, Marcin [3 ]
Smutnicki, Czeslaw [4 ]
Wikarek, Jaroslaw [5 ]
机构
[1] Koszalin Univ Technol, Fac Elect & Comp Sci, Koszalin, Poland
[2] Opole Univ Technol, Fac Prod Engn & Logist, Opole, Poland
[3] Univ Zielona Gora, Inst Control & Computat Engn, Zielona Gora, Poland
[4] Wroclaw Univ Sci & Technol, Fac Elect, Wroclaw, Poland
[5] Kielce Univ Technol, Dept Informat Syst, Kielce, Poland
来源
2020 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ-IEEE) | 2020年
关键词
Routing; cyclic scheduling; logistic trains; fuzzy constraint satisfaction problem; ordered fuzzy number (OFN); SYSTEM; MODEL;
D O I
10.1109/fuzz48607.2020.9177733
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The design of logistic trains fleet oriented distributed and scalability-robust control policies that ensure deadlock-free operations is of crucial importance for efficient material handling systems. This study considers a multi-item assembly system where in-plant transport operations are organized in milk-run loops. A solution to a milk-run routing and scheduling problem subject to fuzzy pickup and delivery time constraints is developed. This type of problem can be treated in terms of a fuzzy constraint satisfaction problem, therefore, the main objective is to provide a reference model analytical formulas of which enable one to obtain solutions that do not require time-consuming computer simulations. Two versions of the model were parameterized assuming independent implementation of convex and ordered fuzzy numbers. The accuracy of both models was experimentally verified according to the results of multiple simulations. Results from this study provide an approach to avoid time consuming computer simulation-based calculations of logistic trains fleet schedules avoiding congestions while concurrently maintaining throughput at maximal achievable level.
引用
收藏
页数:10
相关论文
共 33 条
[1]  
[Anonymous], 2016, 14 IMHRC P KARLSR GE
[2]  
[Anonymous], 2013, Math. Appl, DOI DOI 10.14708/MA.V41I1.380
[3]  
[Anonymous], 2018, P 32 INT BUS INF MAN
[4]   Declarative Modeling of a Milk-Run Vehicle Routing Problem for Split and Merge Supply Streams Scheduling [J].
Bocewicz, G. ;
Nielsen, P. ;
Banaszak, Z. .
INFORMATION SYSTEMS ARCHITECTURE AND TECHNOLOGY, ISAT 2018, PT II, 2019, 853 :157-172
[5]   MILK-RUN ROUTING AND SCHEDULING SUBJECT TO A TRADE-OFF BETWEEN VEHICLE FLEET SIZE AND STORAGE CAPACITY [J].
Bocewicz, Grzegorz ;
Bozejko, Wojciech ;
Wojcik, Robert ;
Banaszak, Zbigniew .
MANAGEMENT AND PRODUCTION ENGINEERING REVIEW, 2019, 10 (03) :41-53
[6]   Production flows scheduling subject to fuzzy processing time constraints [J].
Bocewicz, Grzegorz ;
Nielsen, Izabela Ewa ;
Banaszak, Zbigniew Antoni .
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2016, 29 (10) :1105-1127
[7]  
Calkins H, 2017, J ARRYTHM, V33, P369, DOI 10.1016/j.joa.2017.08.001
[8]  
Caric Tonci, 2008, Vehicle Routing Problem, P15
[9]   Practical Application of OFN Arithmetics in a Crisis Control Center Monitoring [J].
Czerniak, Jacek M. ;
Dobrosielski, Wojciech T. ;
Apiecionek, Lukasz ;
Ewald, Dawid ;
Paprzycki, Marcin .
RECENT ADVANCES IN COMPUTATIONAL OPTIMIZATION, 2016, 655 :51-64
[10]   DELIVERY AND PICK-UP PROBLEM TRANSPORTATION - MILK RUN OR CONVENTIONAL SYSTEMS [J].
de Moura, Delmo Alves ;
Botter, Rui Carlos .
INDEPENDENT JOURNAL OF MANAGEMENT & PRODUCTION, 2016, 7 (03) :746-770