Determination of the adjoint state evolution for the efficient operation of a hybrid electric vehicle

To minimize the fuel consumption in hybrid electric vehicles, it is necessary to define a strategy for the management of the power flows within the vehicle. Under the assumption that the velocity to be developed by the vehicle is known a priori, this problem may be posed as a nonlinear optimal control problem with control and state constraints. We find the solution to this problem using the optimality conditions given by the Pontryagin Maximum Principle. This leads to boundary value problems that we solve using a software tool named PASVA4. On real time operation, the velocity to be developed by the vehicle is not known in advance. We show how the adjoint state obtained from the former problem may be used as a weighing factor, called ‘‘equivalent consumption’’. This weighing factor may be used to design suboptimal real time algorithms for power management.Fil: Perez, Laura Virginia. Universidad Nacional de Rio Cuarto. Facultad de Ingeniería. Grupo de Electronica Aplicada; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: de Angelo, Cristian Hernan. Universidad Nacional de Rio Cuarto. Facultad de Ingeniería. Grupo de Electronica Aplicada; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Pereyra, Víctor. San Diego State University; Estados Unido

Diameter and Treewidth in Minor-Closed Graph Families

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show that treewidth is bounded by a function of the diameter in a minor-closed family, if and only if some apex graph does not belong to the family. In particular, the O(D) bound above can be extended to bounded-genus graphs. As a consequence, we extend several approximation algorithms and exact subgraph isomorphism algorithms from planar graphs to other graph families.Comment: 15 pages, 12 figure

The matching relaxation for a class of generalized set partitioning problems

This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints. We present two combinatorial relaxations based on computing maximum weighted matchings in suitable graphs. Besides providing dual bounds, the relaxations are also used on a variable reduction technique and a matheuristic. We show how that general method can be tailored to sample applications, and also perform a successful computational evaluation with benchmark instances of a problem in maritime logistics.Comment: 33 pages. A preliminary (4-page) version of this paper was presented at CTW 2016 (Cologne-Twente Workshop on Graphs and Combinatorial Optimization), with proceedings on Electronic Notes in Discrete Mathematic