The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the problem of utilizing the pack of batteries serving current demands in Electric Vehicles. When serving a demand, the current allocation might be split among the batteries in the pack. Due to its internal chemistry structure, a battery's life depends on the discharge current used for supplying the requests. Any deviation from the (a-priori known) optimal discharge-current is associated...
This paper describes the way a multi-item, multi-plant Lot-Sizing problem with transfer costs and capacities may be reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean Relaxation, into a master Facility Location problem and a slave Minimal Cost Multi-commodity Flow problem. This decomposition framework gives rise in a natural way to the design of a relax/project...
This paper deals with the Dial and Ride Problem (DARP), while using randomized greedy insertion techniques together with constraint propagation techniques. Though it focuses here on the static version of Dial and Ride, it takes into account the fact that practical DARP has to be handled according to a dynamical point of view, and even, in some case, in real time contexts. So, the kind of algorithmic...
We consider the problem of scheduling linearly deteriorating jobs on a single machine. Between the jobs there are defined arbitrary precedence constraints and the objective is to minimize the maximum cost. For this problem we propose an exact algorithm and a heuristic. We also report preliminary results of computational experiments conducted in order to evaluate the quality of schedules generated...
We address in this paper the parallelization of a recursive algorithm for triangular matrix inversion (TMI) based on the ‘Divide and Conquer’ (D&C) paradigm. A series of different versions of an original sequential algorithm are first presented. A theoretical performance study permits to establish an accurate comparison between the designed algorithms. Afterwards, we develop an optimal parallel...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.