A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands

The Time Capacitated Arc Routing Problem (TCARP) extends the classical Capacitated Arc Routing Problem by considering time-based capacities instead of traditional loading capacities. In the TCARP, the costs associated with traversing and servicing arcs, as well as the vehicle's capacity, are me...

Descripción completa

Detalles Bibliográficos
Autores: Keenan, Peter|||0000-0001-7612-6951, Panadero, Javier|||0000-0002-3793-3328, Juan, Ángel A|||0000-0003-1392-1776, Martí, Rafael|||0000-0001-7265-823X, McGarraghy, Seán
Tipo de recurso: artículo
Fecha de publicación:2021
País:España
Institución:Universitat Autònoma de Barcelona
Repositorio:Dipòsit Digital de Documents de la UAB
Idioma:inglés
OAI Identifier:oai:ddd.uab.cat:296792
Acceso en línea:https://ddd.uab.cat/record/296792
https://dx.doi.org/urn:doi:10.1016/j.cor.2021.105377
Access Level:acceso abierto
Palabra clave:Capacitated Arc Routing Problem
Simheuristics
Stochastic optimization
Time-based capacities
id ES_36fa5bdbafd3a06084e005df90886d64
oai_identifier_str oai:ddd.uab.cat:296792
network_acronym_str ES
network_name_str España
repository_id_str
spelling A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demandsKeenan, Peter|||0000-0001-7612-6951Panadero, Javier|||0000-0002-3793-3328Juan, Ángel A|||0000-0003-1392-1776Martí, Rafael|||0000-0001-7265-823XMcGarraghy, SeánCapacitated Arc Routing ProblemSimheuristicsStochastic optimizationTime-based capacitiesThe Time Capacitated Arc Routing Problem (TCARP) extends the classical Capacitated Arc Routing Problem by considering time-based capacities instead of traditional loading capacities. In the TCARP, the costs associated with traversing and servicing arcs, as well as the vehicle's capacity, are measured in time units. The increasing use of electric vehicles and unmanned aerial vehicles, which use batteries of limited duration, illustrates the importance of time-capacitated routing problems. In this paper, we consider the TCARP with stochastic demands, i.e.: the actual demands on each edge are random variables which specific values are only revealed once the vehicle traverses the arc. This variability affects the service times, which also become random variables. The main goal then is to find a routing plan that minimizes the expected total time required to service all customers. Since a maximum time capacity applies on each route, a penalty time-based cost arises whenever a route cannot be completed within that limit. In this paper, a strategic oscillation simheuristic algorithm is proposed to solve this stochastic problem. The performance of our algorithm is tested in a series of numerical experiments that extend the classical deterministic instances into stochastic ones. 22021-01-0120212021-01-01Articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://ddd.uab.cat/record/296792https://dx.doi.org/urn:doi:10.1016/j.cor.2021.105377reponame:Dipòsit Digital de Documents de la UABinstname:Universitat Autònoma de BarcelonaInglésengAgencia Estatal de Investigación https://doi.org/10.13039/501100011033 PID2019-111100RB-C21Agencia Estatal de Investigación https://doi.org/10.13039/501100011033 RED2018-102642-TAgencia Estatal de Investigación https://doi.org/10.13039/501100011033 PGC2018-0953322-B-C21open accesshttp://purl.org/coar/access_right/c_abf2Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, i la comunicació pública de l'obra, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original. No es permet la creació d'obres derivades.https://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessoai:ddd.uab.cat:2967922026-06-06T12:50:31Z
dc.title.none.fl_str_mv A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
title A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
spellingShingle A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
Keenan, Peter|||0000-0001-7612-6951
Capacitated Arc Routing Problem
Simheuristics
Stochastic optimization
Time-based capacities
title_short A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
title_full A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
title_fullStr A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
title_full_unstemmed A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
title_sort A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
dc.creator.none.fl_str_mv Keenan, Peter|||0000-0001-7612-6951
Panadero, Javier|||0000-0002-3793-3328
Juan, Ángel A|||0000-0003-1392-1776
Martí, Rafael|||0000-0001-7265-823X
McGarraghy, Seán
author Keenan, Peter|||0000-0001-7612-6951
author_facet Keenan, Peter|||0000-0001-7612-6951
Panadero, Javier|||0000-0002-3793-3328
Juan, Ángel A|||0000-0003-1392-1776
Martí, Rafael|||0000-0001-7265-823X
McGarraghy, Seán
author_role author
author2 Panadero, Javier|||0000-0002-3793-3328
Juan, Ángel A|||0000-0003-1392-1776
Martí, Rafael|||0000-0001-7265-823X
McGarraghy, Seán
author2_role author
author
author
author
dc.subject.none.fl_str_mv Capacitated Arc Routing Problem
Simheuristics
Stochastic optimization
Time-based capacities
topic Capacitated Arc Routing Problem
Simheuristics
Stochastic optimization
Time-based capacities
description The Time Capacitated Arc Routing Problem (TCARP) extends the classical Capacitated Arc Routing Problem by considering time-based capacities instead of traditional loading capacities. In the TCARP, the costs associated with traversing and servicing arcs, as well as the vehicle's capacity, are measured in time units. The increasing use of electric vehicles and unmanned aerial vehicles, which use batteries of limited duration, illustrates the importance of time-capacitated routing problems. In this paper, we consider the TCARP with stochastic demands, i.e.: the actual demands on each edge are random variables which specific values are only revealed once the vehicle traverses the arc. This variability affects the service times, which also become random variables. The main goal then is to find a routing plan that minimizes the expected total time required to service all customers. Since a maximum time capacity applies on each route, a penalty time-based cost arises whenever a route cannot be completed within that limit. In this paper, a strategic oscillation simheuristic algorithm is proposed to solve this stochastic problem. The performance of our algorithm is tested in a series of numerical experiments that extend the classical deterministic instances into stochastic ones.
publishDate 2021
dc.date.none.fl_str_mv 2
2021-01-01
2021
2021-01-01
dc.type.none.fl_str_mv Article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://ddd.uab.cat/record/296792
https://dx.doi.org/urn:doi:10.1016/j.cor.2021.105377
url https://ddd.uab.cat/record/296792
https://dx.doi.org/urn:doi:10.1016/j.cor.2021.105377
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Agencia Estatal de Investigación https://doi.org/10.13039/501100011033 PID2019-111100RB-C21
Agencia Estatal de Investigación https://doi.org/10.13039/501100011033 RED2018-102642-T
Agencia Estatal de Investigación https://doi.org/10.13039/501100011033 PGC2018-0953322-B-C21
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Dipòsit Digital de Documents de la UAB
instname:Universitat Autònoma de Barcelona
instname_str Universitat Autònoma de Barcelona
reponame_str Dipòsit Digital de Documents de la UAB
collection Dipòsit Digital de Documents de la UAB
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406001005854720
score 15,81155

Similares en LA Referencia