نتایج جستجو برای: routing problem time window bi
تعداد نتایج: 2657033 فیلتر نتایج به سال:
In this paper we consider the Vehicle Routing Problem with Hard Time Windows and Stochastic Service Times (VRPHTWSST). We can describe the problem as follows. Consider a directed graph G = (V,A) where V = {0, 1, . . . , n} is the node set, and A = {(i, j) | i, j ∈ N} is the arc set. Node 0 represents a depot where a fleet of homogeneous vehicles is initially located and Vc = {1, . . . , n} is t...
As an important support of the e-commerce industry, express delivery industry is particularly in national development. Low loading rates caused by numerous types containers and cost increases low unloading efficiency are still remaining issues process goods packing. This study introduced pallet with telescopic height as middle to address these proposed a distribution scheme based on constraints...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید