This article deals with the intermodal transportation problem for the commodities delivery between different locations. The time – dependent shortest path planning, in which the travel time along each arc is a known function of the departure time along the arc, is a very important problem and arises in many practical application such as a routing system of a container used in the time – depende...

for the urban transportation because of their sustainability, High torque, low volume, zero emission and energy saving. Electric scooter can go certain limit of distance based on the battery capacity it consists. This paper presents the model construction of an energy regenerative electric scooter via MATLAB/SIMULINK so that one can evaluate the performance of the energy recycling technique for...

We consider the following transportation problem with both random and fuzzy factors. There exist m supply points and n demand points. For each route between supply point and demand point, unit transportation cost is a random variable according to a normal distribution and existence possibility denoting the preference choosing this route is attached. The probability that the total transportation...

Classical facility location models like the P -median problem (PMP) and the uncapacitated fixed-charge location problem (UFLP) implicitly assume that once constructed, the facilities chosen will always operate as planned. In reality, however, facilities “fail” from time to time due to poor weather, labor actions, changes of ownership, or other factors. Such failures may lead to excessive transp...

The studies on metal oxides and mixed system have shown, that some of them form a negative fixed charge at the interface when deposited on silicon substrate. After deposition of dielectric layers with negative fixed charge on p-type silicon substrate an inversion layer is formed, leading to a back surface field for the minority carriers and thereby reducing the surface recombination velocity. T...

An uncapacitated facility location problem considers a set of n warehouses W and a set of m stores S. Each warehouse w has a fixed cost fw, and the transportation cost from warehouse w to store s is given by cws. The problem is to find a subset of warehouses and an assignment of warehouses to stores in order to minimize the fixed and transportation costs. Observe that once the warehouses are se...

® The contents of this report reflect the views of the authors, who are responsible for the facts and the accuracy of the information presented herein. This document is disseminated under the sponsorship of the Department of Transportation University Transportation Centers Program, in the interest of information exchange. The Transportation Research Board of the National Academies has identifie...