A Bi-Objective Scheduling Problem in a Home Care Business

  1. Méndez-Fernández, Isabel 12
  2. Lorenzo-Freire, Silvia 12
  3. González-Rueda, Ángel Manuel 12
  1. 1 Grupo MODES, Departamento de Matemáticas, Universidade da Coruña, 15071 A Coruña, Spain
  2. 2 Centro de Investigación TIC—CITIC, Universidade da Coruña, 15071 A Coruña, Spain
Actas:
The 4th XoveTIC Conference

Año de publicación: 2021

Tipo: Aportación congreso

DOI: 10.3390/ENGPROC2021007042 GOOGLE SCHOLAR lock_openAcceso abierto editor

Resumen

In this work we study a routing and scheduling problem for a home care business. The problem is composed of two conflicting objectives, therefore we study it as a bi-objective one. We obtain the Pareto frontier for small size instances using the AUGMECON2 method and, for bigger cases, we developed an heuristic algorithm. We also obtained some preliminary results that show the algorithm has good behaviour.

Referencias bibliográficas

  • Mavrotas, (2013), Appl. Math. Comput., 219, pp. 9652
  • 10.1287/trsc.1050.0135
  • 10.1287/opre.35.2.254