شما هنوز به سایت وارد نشده اید.
جمعه 02 آذر 1403
ورود به سایت
آمار سایت
بازدید امروز: 4,940
بازدید دیروز: 28,942
بازدید کل: 157,606,312
کاربران عضو: 0
کاربران مهمان: 527
کاربران حاضر: 527
Variable neighborhood search for the inventory routing and scheduling problem in a supply chain
Abstract:

The inventory, routing and scheduling decisions are three major driving factors for supply chain performance. Since they are related to one another in a supply chain, they should be determined simultaneously to improve the decision quality. In the past, the inventory policy, vehicle routing and vehicle scheduling are determined sequentially and separately. Hence, the total cost (inventory, routing and vehicle costs) would increase. In this paper, an integrated model for the inventory routing and scheduling problem (IRSP) is proposed. Since searching for the optimal solution for this model is a non-polynomial NP) problem, a metaheuristic, variable neighborhood search (VNS), is proposed. The proposed method was compared with other existing methods. The experimental results indicate that the proposed method is better than other methods in terms of average cost per day.

Keywords: Metaheuristic Variable neighborhood search (VNS) Inventory routing and scheduling problem (IRSP) Supply chain Integrated model NP-hard
Author(s): .
Source: Expert Systems with Applications 39 (2012) 4149–4159
Subject: لجستیک
Category: مقاله مجله
Release Date: 2012
No of Pages: 11
Price(Tomans): 0
بر اساس شرایط و ضوابط ارسال مقاله در سایت مدیر، این مطلب توسط یکی از نویسندگان ارسال گردیده است. در صورت مشاهده هرگونه تخلف، با تکمیل فرم گزارش تخلف حقوق مؤلفین مراتب را جهت پیگیری اطلاع دهید.