"Passeport Vacances" : an assignment problem with cost balancing

Beffa, Corentin (Haute école de gestion de Genève, HES-SO // Haute Ecole Spécialisée de Suisse Occidentale) ; Varone, Sacha (Haute école de gestion de Genève, HES-SO // Haute Ecole Spécialisée de Suisse Occidentale)

Passeport Vacances is an offer for school-aged children to discover a set of activities during holidays. For more than 30 years, it has been an established social function in several countries, including Germany and Switzerland. Proposed activities might occur several times during the Passeport Vacances. The assignment of activities to children is computed in order to maximize the children’s preferences, as well as to balance each child’s incurred cost, toward an equity goal. There are several sets of constraints associated with the assignment problem: no overlapping activities assigned to the same child, minimal and maximal ages per activity, minimum number of children for opening an activity, maximal size of a group for each activity, no similar activities assigned to the same child, no already assigned ‘lifetime’-activity per child, and at most one activity per period and per child. We propose a binary linear programming model that describes the assignment problem, report CPU computation issues regarding the model implementation, and report numerical results based on a state-of-the-art MIP solver. Tests where conducted with real data from the 2016 edition of Passeport Vacances in Morges.


Faculty:
Economie et Services
School:
HEG - Genève
Institute:
CRAG - Centre de Recherche Appliquée en Gestion
Subject(s):
Economie/gestion
Publisher:
[Poznań], PTI
Date:
2018-09
[Poznań]
PTI
Pagination:
7 p.
Published in:
Communication papers of the 2018 Federated Conference on Computer Science and Information Systems
Series Statement:
Annals of computer science and information systems, vol. 17
Author of the book:
Ganzha, M. ; (ed.)
Maciaszek, L. ; (ed.)
Paprzycki, M. ; (ed.)
DOI:
ISSN:
2300-5963
ISBN:
978-83-952357-0-2
Appears in Collection:



 Record created 2018-10-12, last modified 2019-11-28

Fulltext:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)