Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
About
Download Photo HD

About

Ana Viana holds a PhD in Electrical and Computers Engineering (University of Porto, 2004).

She is Head of the Centre for Industrial Engineering and Management of INESC TEC and Coordinator Professor at the Polytechnic of Porto, School of Engineering.

Her research interests focus on Combinatorial Optimisation, both on the development of exact and (meta-)heuristics approaches.

She led several research projects with public funding and publishes regularly in reference scientific journals of her area of activity.

Interest
Topics
Details

Details

012
Publications

2020

A comparison of matching algorithms for kidney exchange programs addressing waiting time

Authors
Monteiro, T; Klimentova, X; Pedroso, JP; Viana, A;

Publication
Central European Journal of Operations Research

Abstract

2019

Maximizing the expected number of transplants in kidney exchange programs with branch-and-price

Authors
Alvelos, F; Klimentova, X; Viana, A;

Publication
Annals of Operations Research

Abstract
In this paper, we propose a branch-and-price approach for solving the problem of maximizing the expected number of transplants in Kidney Exchange Programs (KEPs). In these programs, the decision on which transplants will be conducted is usually made with the support of optimization models with the assumption that all operations will take place. However, after a plan of transplants is defined, a pair may leave the KEP or a more accurate compatibility evaluation exam may invalidate a transplant. To model these possible events we consider probabilities of failure of vertices and of arcs and the objective of maximizing the expected number of transplants. The proposed approach is based on the so-called cycle formulation, where decision variables are associated with cycles. Built on the concept of type of cycle a branch-and-price algorithm is conceived. One subproblem is defined for each type of cycle. We present computational results of the proposed branch-and-price algorithm and compare them with solving directly the cycle formulation (with a general purpose mixed integer programming solver—CPLEX) showing that the proposed approach is the only one suitable for larger instances. © 2017 Springer Science+Business Media, LLC

2018

Observability of power systems with optimal PMU placement

Authors
Carvalho, M; Klimentova, X; Viana, A;

Publication
Computers & Operations Research

Abstract

2018

Special issue on "Improving Healthcare: New challenges, new approaches"

Authors
Dias, JM; Rocha, H; Viana, A;

Publication
International Transactions in Operational Research

Abstract

2018

Stochastic last-mile delivery with crowdshipping

Authors
Gdowska, K; Viana, A; Pedroso, JP;

Publication
Transportation Research Procedia

Abstract
For the predicted growth of e-commerce, supply chains need to adapt to new conditions, so that delivery can be fast, cheap and reliable. The key to success is the last-mile product delivery (LMD) - the last stage of the supply chain, where the ordered product is delivered to the final consumer's location. One innovative proposal puts foundations in a new delivery model where a professional delivery fleet (PF) is supplemented partially or fully with crowdshipping. The main idea of crowdshipping is to involve ordinary people - in our case in-store shoppers - in the delivery of packages to other customers. In return, occasional couriers (OC) are offered a small compensation. In hitherto formulated problems it was assumed that OCs always accept delivery tasks assigned to them. In this paper we consider OCs as independent agents, which are free to reject assignments. The main contribution of the paper is an original bi-level methodology for matching and routing problem in LMD with OCs and the PF. The goal is to use crowdshipping to reduce the total delivery cost in a same-day last-mile delivery system with respect to occasional couriers' freedom to accept or reject the assigned delivery. We introduce probability to represent each OC's willingness to perform the delivery to a given final customer. We study the OCs' willingness to accept or reject delivery tasks assigned to them and the influence of their decision on the total delivery cost associated to both the OCs' compensation fees and the delivery cost generated by the PF used for the delivery of remaining parcels. © 2018 The Author(s).

Supervised
thesis

2019

A data-driven compensation scheme for last-mile delivery with crowdsourcing

Author
Miguel Moreira da Silva Lima Barbosa

Institution
UP-FCUP

2018

ANÁLISE DA REDE LOGÍSTICA E POLÍTICAS DE APROVISIONAMENTO NUMA EMPRESA DE DISTRIBUIÇÃO DE CONTADORES ELÉTRICOS

Author
VÍTOR NETO MAGALHÃES

Institution
IPP-ISEP

2017

Otimização do posicionamento de PMUs numa rede elétrica

Author
TIAGO RAFAEL PINTO MONTEIRO

Institution
IPP-ISEP

2015

Balancing and lot-sizing mixed-model lines in the footwear industry

Author
PARISA SADEGHI

Institution
IPP-ISEP

2015

Escalonamento de máquinas de cogeração utilizando programação inteira mista

Author
FÁBIO ONOFRE DA SILVA OLIVEIRA

Institution
IPP-ISEP