Repositorio Institucional
Repositorio Institucional
CONICET Digital
  • Inicio
  • EXPLORAR
    • AUTORES
    • DISCIPLINAS
    • COMUNIDADES
  • Estadísticas
  • Novedades
    • Noticias
    • Boletines
  • Ayuda
    • General
    • Datos de investigación
  • Acerca de
    • CONICET Digital
    • Equipo
    • Red Federal
  • Contacto
JavaScript is disabled for your browser. Some features of this site may not work without it.
  • INFORMACIÓN GENERAL
  • RESUMEN
  • ESTADISTICAS
 
Artículo

A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows

Lucci, MauroIcon ; Severin, Daniel EstebanIcon ; Zabala, Paula LorenaIcon
Fecha de publicación: 07/12/2021
Editorial: Wiley-liss, div John Wiley & Sons Inc.
Revista: International Transactions in Operational Research
ISSN: 0969-6016
e-ISSN: 1475-3995
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:
Ciencias de la Computación

Resumen

A simultaneous vehicle routing and crew scheduling problem (SVRCSP) consists of planning routes for a fleet of vehicles and scheduling their crews, with the particularity that the vehicle–crew correspondence is not fixed through time. This allows a greater planning flexibility and a more efficient use of the fleet, but in counterpart it requires high synchronization. In this work, an SVRCSP is presented, where long-distance pickup-and-delivery requests must be fulfilled over a multiday planning horizon, subject to several constraints such as multiple time windows, hour of services regulation, among others. Crews can be composed of one or two drivers and any of them can be relieved in a given set of locations. Also, they are allowed to travel between locations with noncompany shuttles. The objective is to minimize the cost of travel in company and noncompany vehicles, which depends on the distance, and the penalization for completing requests with delay. A two-stage sequential approach is applied: a set of truck routes is computed in the first stage and a set of driver routes consistent with the previous routes is obtained in the second stage. An algorithm based on the GRASP × ILS metaheuristic, embedded with a repair heuristic to facilitate the construction of initial solutions, is proposed and evaluated for the latter stage. High-quality solutions were found for instances generated with up to 3000 requests and a planning horizon of one to four weeks spread over 15 Argentine cities in less than an hour. Additionally, the possibility of carrying an additional driver reduced the cost of external shuttles by 2.25 times on average compared to individual crews and, in some cases, removed this cost completely.
Palabras clave: CREW SCHEDULING , GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE , VARIABLE NEIGHBORHOOD DESCENT , VEHICLE ROUTING
Ver el registro completo
 
Archivos asociados
Tamaño: 1005.Kb
Formato: PDF
.
Solicitar
Licencia
info:eu-repo/semantics/restrictedAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/159597
DOI: https://onlinelibrary.wiley.com/doi/10.1111/itor.13096
DOI: http://dx.doi.org/10.1111/itor.13096
Colecciones
Articulos(CCT - ROSARIO)
Articulos de CTRO.CIENTIFICO TECNOL.CONICET - ROSARIO
Citación
Lucci, Mauro; Severin, Daniel Esteban; Zabala, Paula Lorena; A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows; Wiley-liss, div John Wiley & Sons Inc.; International Transactions in Operational Research; 7-12-2021; 1-31
Compartir
Altmétricas
 
Estadísticas
Visualizaciones: 40
Descargas: 0

Enviar por e-mail
Separar cada destinatario (hasta 5) con punto y coma.
  • Facebook
  • Twitter
  • Instagram
  • YouTube
  • Sound Cloud

Los contenidos del CONICET están licenciados bajo Creative Commons Reconocimiento 2.5 Argentina License

Ministerio
https://www.conicet.gov.ar/ - CONICET

Inicio

Explorar

  • Autores
  • Disciplinas
  • Comunidades

Estadísticas

Novedades

  • Noticias
  • Boletines

Ayuda

Acerca de

  • CONICET Digital
  • Equipo
  • Red Federal

Contacto

Godoy Cruz 2290 (C1425FQB) CABA – República Argentina – Tel: +5411 4899-5400 repositorio@conicet.gov.ar
TÉRMINOS Y CONDICIONES