Abstract
When planning a selling season, a car rental company must decide on the number and type of vehicles in the fleet to meet demand. The demand for the rental products is uncertain and highly price-sensitive, and thus capacity and pricing decisions are interconnected. Moreover, since the products are rentals, capacity "returns". This creates a link between capacity with fleet deployment and other tools that allow the company to meet demand, such as upgrades, transferring vehicles between locations or temporarily leasing additional vehicles. We propose a methodology that aims to support decision-makers with different risk profiles plan a season, providing good solutions and outlining their ability to deal with uncertainty when little information about it is available. This matheuristic is based on a co-evolutionary genetic algorithm, where parallel populations of solutions and scenarios co-evolve. The fitness of a solution depends on the risk profile of the decision-maker and its performance against the scenarios, which is obtained by solving a mathematical programming model. The fitness of a scenario is based on its contribution in making the scenario population representative and diverse. This is measured by the impact the scenarios have on the solutions. Computational experiments show the potential of this methodology regarding the quality of the solutions obtained and the diversity and representativeness of the set of scenarios generated. Its main advantages are that no information regarding probability distributions is required, it supports different decision-making risk profiles, and it provides a set of good solutions for an innovative complex application.

Abstract
In this paper, we explore the use of reference values (predictors) for the optimal objective function value of hard combinatorial optimization problems, instead of bounds, obtained by data mining techniques, and that may be used to assess the quality of heuristic solutions for the problem. With this purpose, we resort to the rectangular two-dimensional strip-packing problem (2D-SPP), which can be found in many industrial contexts. Mostly this problem is solved by heuristic methods, which provide good solutions. However, heuristic approaches do not guarantee optimality, and lower bounds are generally used to give information on the solution quality, in particular, the area lower bound. But this bound has a severe accuracy problem. Therefore, we propose a data mining-based framework capable of assessing the quality of heuristic solutions for the 2D-SPP. A regression model was fitted by comparing the strip height solutions obtained with the bottom-left-fill heuristic and 19 predictors provided by problem characteristics. Random forest was selected as the data mining technique with the best level of generalisation for the problem, and 30,000 problem instances were generated to represent different 2D-SPP variations found in real-world applications. Height predictions for new problem instances can be found in the regression model fitted. In the computational experimentation, we demonstrate that the data mining-based framework proposed is consistent, opening the doors for its application to finding predictions for other combinatorial optimisation problems, in particular, other cutting and packing problems. However, how to use a reference value instead of a bound, has still a large room for discussion and innovative ideas. Some directions for the use of reference values as a stopping criterion in search algorithms are also provided.

Abstract
In this paper we present a Benders decomposition approach for the Berth Allocation Problem (BAP). Benders decomposition is a cutting plane method that has been widely used for solving large-scale mixed integer linear optimization problems. On the other hand, the Berth Allocation Problem is a NP-hard and large-scale problem that has been gaining relevance both from the practical and scientific points of view. In this work we address the discrete and dynamic version of the problem, and develop a new decomposition approach and apply it to a reformulation of the BAP based on the Heterogeneous Vehicle Routing Problem with Time Windows (HVRPTW) model. In a discrete and dynamic BAP each berth can moor one vessel at a time, and the vessels are not all available to moor at the beginning of the planning horizon (there is an availability time window). Computational tests are run to compare the proposed Benders Decomposition with a state-of-the-art commercial solver. © 2019, Springer Nature Switzerland AG.

Abstract
Cutting phases occur in many production processes when a larger object must be cut into multiple smaller pieces. Some examples of relevant industries being clothing, footwear, metalware and furniture. The cutting phase is composed of two stages. The first stage consists of finding a good layout for the set of small pieces that must be cut from the larger object and minimizing some objective such as raw-material waste (The Cutting and Packing Problem). Once this good layout has been established, it is provided as input for the second stage which consists of determining the path to cut the pieces which minimizes another objective, such as the total cutting time or distance (The Cutting Path Determination Problem). This second stage is crucial for efficient production planning. Only one linear mathematical model has previously been proposed for the Cutting Path Determination Problem. In this paper, this problem is addressed using two exact approaches based on the Rural Postman Problem (RPP) and the Traveling Salesman Problem (TSP). The RPP approach, in particular, is able to produce optimal solutions for instances containing more than 2000 edges in under 1 h.

Abstract
In recent years, cognitive robots have started to find their way into manufacturing halls. However, the full potential of these robots can only be exploited through (a) an integration of the robots with the Manufacturing Execution System (MES), (b) a new and simpler way of programming based on robot skills, automated task planning, and knowledge modeling, and (c) enabling the robots to function in a shared human/robot workspace with the ability to handle unexpected situations. The STAMINA project has built a robotic system that meets these objectives for an automotive kitting application, which has also been tested, validated, and demonstrated in a relevant environment (TRL6). This paper describes the STAMINA robot system and the evaluation of this system on a series of realistic kitting tasks. The structure of the system, evaluation methodology, and experimental results, are presented along with the insights and experiences gained from this work.

Abstract
This study proposes a model for (re-)designing machine layouts in already existing facilities with a multi-period time planning horizon. The model can be applied in several situations and at different moments of a layout life cycle, for example to design the initial layout of an existing facility, or to make some specific and local reconfigurations. This dynamic multiobjective model minimizes costs (production, material handling and reconfiguration costs), maximizes adjacency between machines, minimizes unsuitability (to combine characteristics of the machines and of the existing locations), and can allow changes between periods on the product mix or on the machine layout requirements (e.g., required area). The performance of the model was tested with a case study based on a real first-tier supplier of the automotive industry, thus showing the practical potential of the proposed approach.