Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por CEGI

2021

Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm

Autores
Martin, M; Oliveira, JF; Silva, E; Morabito, R; Munari, P;

Publicação
EXPERT SYSTEMS WITH APPLICATIONS

Abstract
In this paper, we address the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP), which consists of cutting a larger cuboid block (object) to produce a limited number of smaller cuboid pieces (items) using orthogonal guillotine cuts only. This way, all cuts must be parallel to the object's walls and generate two cuboid sub-blocks, and there is a maximum number of copies that can be manufactured for each item type. The C3GCP arises in industrial manufacturing settings, such as the cutting of steel and foam for mattresses. To model this problem, we propose a new compact mixed-integer non-linear programming (MINLP) formulation by extending its two-dimensional version, and develop a mixed-integer linear programming (MILP) version. We also propose a new model for a particular case of the problem which considers 3-staged patterns. As a solution method, we extend the algorithm of Wang (1983) to the three-dimensional case. We emphasise that the C3GCP is different from 3D packing problems, namely from the Container Loading Problem, because of the guillotine cut constraints. All proposed approaches are evaluated through computational experiments using benchmark instances. The results show that the approaches are effective on different types of instances, mainly when the maximum number of copies per item type is small, a situation typically encountered in practical settings with low demand for each item type. These approaches can be easily embedded into existing expert systems for supporting the decision-making process.

2021

Carsharing: A review of academic literature and business practices toward an integrated decision-support framework

Autores
Golalikhani, M; Oliveira, BB; Carravilla, MA; Oliveira, JF; Antunes, AP;

Publicação
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW

Abstract
Designing a viable carsharing system in a competitive environment is challenging and often dependent on a myriad of decisions. This paper establishes and presents an integrated conceptual decision-support framework for carsharing systems, encompassing critical decisions that should be made by carsharing organizations and users. To identify the main decisions in a carsharing system, and the inputs and interactions among them, it is crucial to obtain a comprehensive understanding of the current state of the literature as well as the business practices and context. To this aim, a holistic and in-depth literature review is conducted to structure distinct streams of literature and their main findings. Then, we describe some of the key decisions and business practices that are often oversimplified in the literature. Finally, we propose a conceptual decision-support framework that systematizes the interactions between the usually isolated problems in the academic literature and business practices, integrating the perspectives of carsharing organizations and of their users. From the proposed framework, we identify relevant research gaps and ways to bridge them in the future, toward more realistic and applicable research.

2021

Understanding carsharing: A review of managerial practices towards relevant research insights

Autores
Golalikhani, M; Oliveira, BB; Carravilla, MA; Oliveira, JF; Pisinger, D;

Publicação
RESEARCH IN TRANSPORTATION BUSINESS AND MANAGEMENT

Abstract
The carsharing market has never been as competitive as it is now, and during the last years, we have been witnessing a boom in the number of carsharing organizations that appear, often accompanied by an also booming number of companies that disappear. Designing a viable carsharing system is challenging and often depends on local conditions as well as on a myriad of operational decisions that need to be supported by suitable decision support systems. Therefore, carsharing is being increasingly studied in the Operations Management (OM) literature. Nevertheless, often due to the limited transparency of this highly competitive sector and the recency of this business, there is still a "gap of understanding" of the scientific community concerning the business practices and contexts, often resulting in over-simplifications and relevant problems being overlooked. In this paper, we aim to close this "gap of understanding" by describing, conceptualizing, and analyzing the reality of 34 business to-consumer carsharing organizations. With the data collected, we propose a detailed description of the current business practices, such as the ones concerning pricing. From this, we highlight relevant "research insights" and structure all collected data organized by different OM topics, enabling knowledge to be further developed in this field.

2021

IO2021 analytics for a better world: livro de resumos

Autores
Moniz, Samuel (Ed.); Lopes, Isabel Cristina (Ed.); Geraldes, Carla A.S. (Ed.); Carravilla, Maria Antónia (Ed.); Póvoa, Ana Paula Barbosa (Ed.); Oliveira, José F. (Ed.);

Publicação

Abstract

2021

Robust Models for the Kidney Exchange Problem

Autores
Carvalho, M; Klimentova, X; Glorie, K; Viana, A; Constantino, M;

Publicação
INFORMS JOURNAL ON COMPUTING

Abstract
Kidney exchange programs aim at matching end-stage renal disease patients who have a willing but incompatible kidney donor with another donor. The programs comprise a pool of such incompatible patient-donor pairs and, whenever a donor from one pair is compatible with the patient of another pair, and vice versa, the pairs may be matched and exchange kidneys. This is typically a two-step process in which, first, a set of pairs is matched based on preliminary compatibility tests and, second, the matched pairs are notified and more accurate compatibility tests are performed to verify that actual transplantation can take place. These additional tests may reveal incompatibilities not previously detected. When that happens, the planned exchange will not proceed. Furthermore, pairs may drop out before the transplant, and thus the planned exchange is canceled. In this paper, we study the case in which a new set of pairs may be matched if incompatibilities are discovered or a pair withdraws from the program. The new set should be as close as possible to the initial set in order to minimize the material and emotional costs of the changes. Various recourse policies that determine the admissible second-stage actions are investigated. For each recourse policy, we propose a novel adjustable robust integer programming model. Wealso propose solution approaches to solve this model exactly. The approaches are validated through thorough computational experiments. Summary of Contribution: In the paper, we present an original work related to the modeling and optimization approaches for Kidney Exchange Programs (KEPs). Currently, KEPs represent an alternative way for patients suffering from renal failure to find a compatible (living) donor. The problem of determining an assignment of patients to (compatible) donors that maximizes the number of transplants in a KEP can be seen as a vertex-disjoint cycle packing problem. Thus, KEPs have been extensively studied in the literature of integer programming. In practice, the assignment determined to a KEP might not be implemented due to withdraws from the program (e.g., a more accurate compatible test shows a new incompatibility or a patient health condition unable him/her to participate on the KEP). In our paper, we model the problem of determining a robust solution to the KEP, i.e., a solution that minimizes the material and emotional costs of changing an assignment. In this way, we propose and design solution approaches for three recourse policies that anticipate withdraws. Through computational experiments we compare the three recourse policies and validate the practical interest of robust solutions.

2021

Fairness models for multi-agent kidney exchange programmes *

Autores
Klimentova, X; Viana, A; Pedroso, JP; Santos, N;

Publicação
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE

Abstract
Nowadays there are several countries running independent kidney exchange programmes (KEPs). These programmes allow a patient with kidney failure, having a willing healthy but incompatible donor, to receive a transplant from a similar pair where the donor is compatible with him. Since in general larger patient-donor pools allow for more patients to be matched, this prompts independent programmes (agents) to merge their pools and collaborate in order to increase the overall number of transplants. Such collaboration does however raise a problem: how to assign transplants to agents so that there is a balance between the contribution each agent brings to the merged pool and the benefit it gets from the collaboration. In this paper we propose a new Integer Programming model for multi-agent kidney exchange programmes (mKEPs). It considers the possible existence of multiple optimal solutions in each matching period of a KEP and, in consecutive matching periods, selects the optimal solution among the set of alternative ones in such a way that in the long-term the benefit each agent gets from participating in the mKEP is balanced accordingly to a given criterion. This is done by use of a memory mechanism. Extensive computational tests show the benefit of mKEPs, when compared to independent KEPs, in terms of potential increase in the number of transplants. Furthermore, they show that, under different policies, the number of additional transplants each agent receives can vary significantly. More importantly, results show that the proposed methodology consistently obtains more stable results than methodologies that do not use memory.

  • 48
  • 186