زمان‌بندي حمل و نقل كاميون‌ها در سيستم‌هاي بارانداز متقاطع چندگانه با پنجره زماني نرم با در نظر گرفتن عدم قطعيت در پارامترهاي زماني

Truck transportation scheduling in multi cross-dock systems with a soft time window with considering to uncertainty in time parameters

استراتژي لجستيك، يك مزيت مهم براي عمليات مديريت زنجيره تامين است كه نياز به برنامه‌ريزي متمركز عمليات براي كاهش زمان و تحويل به موقع محصول جهت افزايش سطح رضايتمندي مشتريان را به دنبال دارد. در اين مقاله هدف كمينه‌سازي زمان كل عمليات با لحاظ پارامترهاي زماني غير قطعي و با رويكرد پنجره زماني نرم در كل زنجيره تامين مي‌باشد و با استفاده از مدل برنامه‌ريزي خطي امكاني مدل برنامه ريزي رياضي فازي را به مدل قطعي تبديل مي‌نمايد. از آنجا كه مدل مقاله از نوع برنامه‌ريزي خطي عدد صحيح صفر و يك بوده و متعلق به مسائل با پيچيدگي NP-hard است زمان حل مسئله با افزايش ابعاد مساله به شدت و به صورت نمايي افزايش مي‌يابد. لذا براي پيدا كردن جواب‌هاي نزديك بهينه مساله از الگوريتم هاي ژنتيك ، الگوريتم شبيه‌سازي تبريد استفاده شده است.سپس اين الگوريتم‌ها با معيارهايي با يكديگر مقايسه شده و الگوريتم برتر در هر معيار مشخص گرديد.

Logistics strategy is an important advantage for supply chain management operations, which requires centralized planning of operations to reduce time and timely delivery of the product to increase the level of customer satisfaction. Cross-dock is an efficient method to control inventory flow that is essential in supply chain management. The other objectives of the cross dock are inventory reduction, increased levels of customer responsiveness and better control of the distribution operation. This paper focuses on the optimization of the transportation scheduling and the planning of the movement inbound and outbound trucks with a soft window, where time parameters are considered uncertain. Therefore, a mathematical model is presented with the goal of minimizing the total time of operation in the supply chain and using the possibility Linear programming model converts the mathematical model into a definite mathematical model. Since the article model is zero and one linear programming type of the integer and belongs to NP-hard issues, the time to solve them increases with increasing problem dimensions. Therefore, genetic algorithm and Simulated Annealing algorithm are used to find optimal solution problems. The parameters used in meta_ heuristic algorithms were determined by Taguchi method with mini-tab software and their optimal values were extracted. Then, according to constant parameters including the number of suppliers, customers, cross-dock, inbound and outbound trucks, and product types, sample problems were generated at three small, meddle and large production levels, and at each level, seven problem samples were generated and total of twenty one issues were solved.