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.
The problem we address in this paper, is the minimization of the energy consumption of an electrical vehicle achievable on a given driving cycle. This can be formulated as an optimal control problem with a discrete switch control. In this paper, we present a new formulation of this problem by taking into account the electrical and mechanical parts of the vehicle. By using prototype optimal control...
This article tackles the multi-trip vehicle routing problem with time windows and limited duration. A trip is a timed route such that a succession of trips can be assigned to one vehicle. We provide an exact two-phase algorithm to solve it. The first phase enumerates possible ordered lists of clients which match the maximum trip duration criterion. The second phase uses a Branch and Price scheme to...
The best formulations for some combinatorial optimization problems are integer linear programming models with an exponential number of rows and/or columns, which are solved incrementally by generating missing rows and columns only when needed. As an alternative to row generation, some exponential formulations can be rewritten in a compact extended form, which have only a polynomial number of constraints...
Based on an eigenvalue study, the sufficient descent condition of an extended class of the Hager-Zhang nonlinear conjugate gradient methods is established. As an interesting result, it is shown that the search directions of the CG_Descent algorithm satisfy the sufficient descent condition $$d_k^Tg_k<-\frac{7}{8}||g_k||^2$$ d k T g k < - 7 8 | | g k | | 2 .
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.