A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem

Detalhes bibliográficos
Autor(a) principal: Respício, Ana
Data de Publicação: 2007
Outros Autores: Moz, Margarida, Pato, Margarida Vaz
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10400.5/1432
Resumo: The Bus Driver Rostering Problem (DRP) consists of assigning bus drivers to daily duties during a planning period. The problem considers hard constraints imposed by institutional and legal requirements. Solutions should as much as possible satisfy soft constraints that qualify rosters according to either the company's or the drivers' interests. A bi-objective version of the DRP is considered and two models are presented. Due to the high computational complexity of DRP, this paper proposes the Strength Pareto Utopic Memetic Algorithm (SPUMA) a new heuristic algorithm specially devised to tackle the problem. SPUMA genetic component combines utopic elitism with a strength Pareto fitness evaluation and includes an improvement procedure. Computational results show that SPUMA outperforms an adaptation of one of the state-of-the-art most competitive multi-objective evolutionary algorithms, SPEA2.
id RCAP_a2d51358f5e0eb7190b4d05d022ab7ab
oai_identifier_str oai:www.repository.utl.pt:10400.5/1432
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problemurban transit planningbus rosteringmulti-objective evolutionary algorithmmemetic algorithmThe Bus Driver Rostering Problem (DRP) consists of assigning bus drivers to daily duties during a planning period. The problem considers hard constraints imposed by institutional and legal requirements. Solutions should as much as possible satisfy soft constraints that qualify rosters according to either the company's or the drivers' interests. A bi-objective version of the DRP is considered and two models are presented. Due to the high computational complexity of DRP, this paper proposes the Strength Pareto Utopic Memetic Algorithm (SPUMA) a new heuristic algorithm specially devised to tackle the problem. SPUMA genetic component combines utopic elitism with a strength Pareto fitness evaluation and includes an improvement procedure. Computational results show that SPUMA outperforms an adaptation of one of the state-of-the-art most competitive multi-objective evolutionary algorithms, SPEA2.Centro de Investigação Operacional - Universidade de LisboaRepositório da Universidade de LisboaRespício, AnaMoz, MargaridaPato, Margarida Vaz2009-11-05T15:59:21Z20072007-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.5/1432engRespício, Ana, Margarida Moz e Margarida Vaz Pato. 2007. "A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem". Universidade de Lisboa – Centro de Investigação Operacional - CIO Working paper nº 13/2007info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-03-06T14:32:41Zoai:www.repository.utl.pt:10400.5/1432Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T16:49:34.169469Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
title A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
spellingShingle A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
Respício, Ana
urban transit planning
bus rostering
multi-objective evolutionary algorithm
memetic algorithm
title_short A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
title_full A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
title_fullStr A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
title_full_unstemmed A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
title_sort A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
author Respício, Ana
author_facet Respício, Ana
Moz, Margarida
Pato, Margarida Vaz
author_role author
author2 Moz, Margarida
Pato, Margarida Vaz
author2_role author
author
dc.contributor.none.fl_str_mv Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Respício, Ana
Moz, Margarida
Pato, Margarida Vaz
dc.subject.por.fl_str_mv urban transit planning
bus rostering
multi-objective evolutionary algorithm
memetic algorithm
topic urban transit planning
bus rostering
multi-objective evolutionary algorithm
memetic algorithm
description The Bus Driver Rostering Problem (DRP) consists of assigning bus drivers to daily duties during a planning period. The problem considers hard constraints imposed by institutional and legal requirements. Solutions should as much as possible satisfy soft constraints that qualify rosters according to either the company's or the drivers' interests. A bi-objective version of the DRP is considered and two models are presented. Due to the high computational complexity of DRP, this paper proposes the Strength Pareto Utopic Memetic Algorithm (SPUMA) a new heuristic algorithm specially devised to tackle the problem. SPUMA genetic component combines utopic elitism with a strength Pareto fitness evaluation and includes an improvement procedure. Computational results show that SPUMA outperforms an adaptation of one of the state-of-the-art most competitive multi-objective evolutionary algorithms, SPEA2.
publishDate 2007
dc.date.none.fl_str_mv 2007
2007-01-01T00:00:00Z
2009-11-05T15:59:21Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10400.5/1432
url http://hdl.handle.net/10400.5/1432
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Respício, Ana, Margarida Moz e Margarida Vaz Pato. 2007. "A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem". Universidade de Lisboa – Centro de Investigação Operacional - CIO Working paper nº 13/2007
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Centro de Investigação Operacional - Universidade de Lisboa
publisher.none.fl_str_mv Centro de Investigação Operacional - Universidade de Lisboa
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799130969631883264

Registros relacionados