Project/scholarship details
- Project/scholarship ID
100645
- Reference
PTDC/EIA-EIA/100645/2008
- FundRef URI
- Funder
FCT - Fundação para a Ciência e a Tecnologia, I.P.
- Funder's country
Portugal
- Funding program
5876-PPCDTI
- Funding amount
94,719.00 €
- Start date
2010-04-08
- End date
2013-10-07
Documents
A hybrid column generation with GRASP and path relinking for the network load b...
Santos, Dorabella; Sousa, Amaro; Alvelos, Filipe Pereira eIn this paper, a hybrid meta-heuristic is proposed which combines the GRASP with path relinking method and Column Generation. The key idea of this method is to run a GRASP with path relinking search on a restricted search space, defined by Column Generation, instead of running the search on the complete search space of the problem. Moreover, column generation is used not only to compute the initial restricted s...
Uma heurística de melhor encaixe para um problema de empacotamento a duas dimen...
Pereira, José Miguel Ribeiro PinhãoDissertação de mestrado em Engenharia de Sistemas; Nesta dissertação é apresentada uma heurística de melhor encaixe para um problema de empacotamento a duas dimensões. Este problema faz parte de um conjunto mais vasto de problemas de corte e empacotamento que são estudados em Investigação Operacional, e têm aplicação prática nas mais diversas áreas industriais. São analisados diferentes modelos de empacotamento...
Improving branch-and-price for parallel machine scheduling
Lopes, Manuel; Alvelos, Filipe Pereira e; Lopes, Henrique Daniel OliveiraIn this paper we present a hybrid exact-heuristic method to improve a branch-and-price algorithm to solve the unrelated parallel machines with sequence-dependent setup times scheduling problem. As most of the computational time in the column generation (CG) process is spent in subproblems, two new heuristics to solve the subproblems are embedded in the branch-and-price (BP) framework with the aim to improve the...
A new branch-and-price approach for the kidney exchange problem
Klimentova, Xenia; Alvelos, Filipe Pereira e; Viana, AnaThe kidney exchange problem (KEP) is an optimization problem arising in the framework of transplant programs that allow exchange of kidneys between two or more incompatible patient-donor pairs. In this paper an approach based on a new decomposition model and branch-and-price is proposed to solve large KEP instances. The optimization problem considers, hierarchically, the maximization of the number of transplant...
A matheuristic based on column generation for parallel machine scheduling with ...
Alvelos, Filipe Pereira e; Lopes, Manuel; Lopes, Henrique Daniel OliveiraIn this paper we propose a heuristic approach based on column generation (CG) and a general purpose integer programming (GPIP) solver to address a scheduling problem. The problem consists in scheduling independent jobs with given processing times on unrelated parallel machines with sequence-dependent setup times. The objective is to minimize the total weighted tardiness. The proposed matheuristic (MH) takes adv...
Bus driver rostering by column generation metaheuristics
Barbosa, Vítor; Alvelos, Filipe Pereira e; Respício, AnaIn the Bus Driver Rostering Problem (BDRP) it is intended to define work schedules for workers such that costs are minimized. This problem has been addressed before by combining column generation and an evolutionary algorithm. In this paper, we show how this approach can be improved by including additional random constraints and limiting the time spent in column generation. Both approaches follow a general frame...
Report
Embed
<script type="text/javascript">
<!--
document.write('<div id="rcaap-widget"></div>');
document.write('<script type="text/javascript" src="https://www.rcaap.pt/snippet?resource=documents&project=FCT%2F5876-PPCDTI%2F100645&fields=id,titles,creators,issueDate,link,descriptions"></script>');
-->
</script>