Abstract
Internet sales channels, especially e-brokers that compare prices in the market, have a major impact on car rentals. As costs are heavily correlated with unoccupied fleet, occupation considerations should be integrated with swift responses to the market prices. This work was developed alongside Guerin, a Portuguese car rental, to build a tool that quickly updates prices on e-brokers websites to increase total value. This paper describes the specificities of the problem and their implication on the solution, and presents an adaptative heuristic to update prices and the system’s architecture. © 2015, Springer International Publishing Switzerland.

Abstract
Cutting and packing problems generally address the cutting or packing of smaller items into a larger container object. Usually, the main methodologies used in the Circular Open Dimension Problem (CODP) are nonlinear programming methods or methods that combine different heuristics. The aim of this project is at devising and using an agent-based simulation approach to determine the length of the open rectangle in CODP; more specifically, we look into the Circular two-dimension Open Dimension Problem. Agents (circles, which can have different dimensions) were given a set of simple rules that allow them to be placed in the world (i.e. an open rectangle). These rules are inferred from the formal CODP formulation and from the behavior defined in the agents.

Abstract
Kidney exchange programs (KEPs) allow the exchange of kidneys between incompatible donor-recipient pairs. Optimization approaches can help KEPs in defining which transplants should be made among all incompatible pairs according to some objective. The most common objective is to maximize the number of transplants. In this paper, we propose an integer programming model which addresses the objective of maximizing the expected number of transplants, given that there are equal probabilities of failure associated with vertices and arcs. The model is compact, i.e. has a polynomial number of decision variables and constraints, and therefore can be solved directly by a general purpose integer programming solver (e.g. Cplex).

Abstract

Abstract

Abstract
In a restructured electricity sector, day-ahead markets can be modeled as a game where some players - the producers - submit their proposals. To analyze the companies' behavior we have used the concept of Nash equilibrium as a solution in these multi-agent interaction problems. In this paper, we present new and crucial adaptations of two well-known mechanisms, the adjustment process and the relaxation algorithm, in order to achieve the goal of computing Nash equilibria. The advantages of these approaches are highlighted and compared with those available in the literature.