دانلود و نمایش مقالات مرتبط با Inventory routing problem::صفحه 1
بلافاصله پس از پرداخت دانلود کنید

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - Inventory routing problem

تعداد مقالات یافته شده: 1
ردیف عنوان نوع
1 The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains
مشکل موجودی مسیریابی اقلام حمل و نقل برگشت پذیر با پنجره های زمان و تحویل و تحویل همزمان در زنجیره تامین حلقه بسته-2017
Reducing environmental impact, related regulations and potential for operational benefits are the main reasons why companies share their returnable transport items (RTIs) among the different partners of a closed-loop supply chain. In this paper, we consider a producer, located at a depot, who has to distribute his products packed in RTIs to a set of customers. Customers define a time window wherein the service can begin. The producer is also in charge of the collection of empty RTIs for reuse in the next production cycle. Each partner has a storage area composed of both empty and loaded RTI stock, as characterized by initial levels and maximum storage capacity. As deliveries and returns are performed by a homogeneous fleet of vehicles that can carry simultaneously empty and loaded RTIs, this research addresses a pickup and delivery inventory-routing problem within time windows (PDIRPTW) over a planning horizon. A mixed-integer linear program is developed and tested on small-scale instances. To handle more realistic large-scale problems, a cluster first-route second matheuristic is proposed.
Keywords: Returnable transport item | Closed-loop supply chain | Inventory routing problem | Pickups and deliveries | Time windows
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 9321 :::::::: بازدید دیروز: 0 :::::::: بازدید کل: 9321 :::::::: افراد آنلاین: 57