Cookies
Usamos cookies para melhorar nosso site e a sua experiência. Ao continuar a navegar no site, você aceita a nossa política de cookies. Ver mais
Aceitar Rejeitar
  • Menu
Sobre
Download foto HD

Sobre

Ana Viana é Doutorada em Engenharia Electrotécnica e de Computadores pela Univesidade do Porto (2004).

É coordenadora do Centro de Engenharia e Gestão Industrial do INESC TEC e Professora Coordenadora do Instituto Superior de Engenharia do Porto.

A sua principal área de investigação é Investigação Operacional, com foco em problemas de optimização combinatória. Como técnicas de resolução deste tipo de problemas explora quer abordagens baseadas em técnicas exactas, quer heurísticas.

Liderou vários projectos financiados por fundos públicos nas áreas de Saúde, Logística e Energia e publica regularmente em revistas científicas de referência, na sua área de actividade.

Tópicos
de interesse
Detalhes

Detalhes

012
Publicações

2020

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

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

Publicação
Central European Journal of Operations Research

Abstract

2019

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

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

Publicação
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

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

Publicação
Computers & Operations Research

Abstract

2018

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

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

Publicação
International Transactions in Operational Research

Abstract

2018

Stochastic last-mile delivery with crowdshipping

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

Publicação
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).

Teses
supervisionadas

2019

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

Autor
Miguel Moreira da Silva Lima Barbosa

Instituição
UP-FCUP

2018

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

Autor
VÍTOR NETO MAGALHÃES

Instituição
IPP-ISEP

2017

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

Autor
TIAGO RAFAEL PINTO MONTEIRO

Instituição
IPP-ISEP

2015

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

Autor
PARISA SADEGHI

Instituição
IPP-ISEP

2015

Desenvolvimento de Sequenciador para um Problema de Roteamento de Veículos

Autor
HÉLDER FILIPE DE CASTRO PINHEIRO

Instituição
IPP-ISEP