نتایج جستجو برای: bi objective warehouse problem
تعداد نتایج: 1425513 فیلتر نتایج به سال:
Local Container Drayage Problem (LCDP) refers to the optimization of process planning and scheduling container trucks between a terminal customers offer door-to-door service in local area. The time required for (un)packing containers at customers’ sites are often relatively long uncertain due current work level unexpected deviations operational situations, which has significant influence on tra...
The use of underground spaces can lead to increased land productivity in cities. This paper addresses the issue of which of the four commercial, warehouse, public parking and passageways (two-floor streets) are optimal if we want to use the spaces below the streets of the city. Therefore, the selected 21 main street of districts 5 and 6 of Isfahan were selected as problem options. Using 2013 da...
In this study, a vendor-managed inventory model is developed for a single-vendor multiple-retailer single-warehouse (SV-MR-SV) supply chain problem based on the economic order quantity in which demands are stochastic and follow a uniform probability distribution. In order to reduce holding costs and to help balanced on-hand inventory cost between the vendor and the retailers, it is assumed that...
In this work we study a routing and scheduling problem for home care business. The is composed of two conflicting objectives, therefore it as bi-objective one. We obtain the Pareto frontier small size instances using AUGMECON2 method and, bigger cases, developed an heuristic algorithm. also obtained some preliminary results that show algorithm has good behaviour.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید