نتایج جستجو برای: School bus routing problem

تعداد نتایج: 1183421  

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

Journal: :journal of operation and automation in power engineering 2014
k. mazlumi m. mohammad gholiha1 r. abbasi f. mazlumi

in this paper, a new method based on branch placement for the optimal positioning of phasor measurement units (pmus) in power systems is proposed. in this method, the pmus are in type of single-channel and are installed at the beginning of the branches. therefore, they are able to measure the bus voltages. also, the installation of the pmus on the branches increases the security of observabilit...

This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...

Journal: :VLSI Design 2007
Srinivasan Murali David Atienza Luca Benini Giovanni De Micheli

Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today’s NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in the network is reduced significantly, which translates to improved network performance or reduced network bandwidth requirements and power co...

K. Eshgee and M. Kazemi,

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

Journal: :International Journal for Research in Applied Science and Engineering Technology 2019

Journal: :Transportation Research Part C: Emerging Technologies 2019

1994
Steven Cheung Francis C. M. Lau

We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) to ordinary meshes can reduce the routing tame b y approximately one-third f o r permutation routing with locality. A matching time lower bound i s also proved. The result can be generalized to multi-packet routing.

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the Inventory Routing Problem, which is a combination of distribution and inventory management. This paper expands the classical In...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید