Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems
The most common problem in vertical transportation using elevator group appears when a passenger wants to travel from a floor to other different floor in a building. The passenger makes a hall call by pressing a landing call button installed at the floor and located near the cars of the elevator gro...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2011 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/40534 |
| Acceso en línea: | http://hdl.handle.net/11441/40534 https://doi.org/10.1016/j.asoc.2010.05.023 |
| Access Level: | acceso abierto |
| Palabra clave: | Elevator Lift Tabu search Genetic algorithm Elevator group system Vertical transportation Car dispatching |
| id |
ES_4600ba8ed2bc17b0ea6fb40afa62e43a |
|---|---|
| oai_identifier_str |
oai:idus.us.es:11441/40534 |
| network_acronym_str |
ES |
| network_name_str |
España |
| repository_id_str |
|
| spelling |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systemsBolat, BernaCortés, PabloElevatorLiftTabu searchGenetic algorithmElevator group systemVertical transportationCar dispatchingThe most common problem in vertical transportation using elevator group appears when a passenger wants to travel from a floor to other different floor in a building. The passenger makes a hall call by pressing a landing call button installed at the floor and located near the cars of the elevator group. After that, the elevator controller receives the call and identifies which one of the elevators in the group is most suitable to serve the person having issued the call. In this paper, we have developed different elevator group controllers based on genetic and tabu search algorithms. Even though genetic algorithm has been previously considered in vertical transportation problems, the use of tabu search approaches is a novelty in vertical transportation and has not been considered previously. Tests have been carried out for high-rise buildings considering diverse sizes in the group of cars. Results indicate that the waiting time and journey time of passengers were significantly improved when dealing with such soft computing approaches. Also, a quickly evaluable solution quality function in the algorithms allows suitable computational times for industry implementation.ElsevierOrganización Industrial y Gestión de Empresas II2011info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/11441/40534https://doi.org/10.1016/j.asoc.2010.05.023reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésApplied Soft Computing, 11(2), 1792-1800https://doi.org/10.1016/j.asoc.2010.05.023info:eu-repo/semantics/openAccessoai:idus.us.es:11441/405342026-06-17T12:51:07Z |
| dc.title.none.fl_str_mv |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems |
| title |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems |
| spellingShingle |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems Bolat, Berna Elevator Lift Tabu search Genetic algorithm Elevator group system Vertical transportation Car dispatching |
| title_short |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems |
| title_full |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems |
| title_fullStr |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems |
| title_full_unstemmed |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems |
| title_sort |
Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems |
| dc.creator.none.fl_str_mv |
Bolat, Berna Cortés, Pablo |
| author |
Bolat, Berna |
| author_facet |
Bolat, Berna Cortés, Pablo |
| author_role |
author |
| author2 |
Cortés, Pablo |
| author2_role |
author |
| dc.contributor.none.fl_str_mv |
Organización Industrial y Gestión de Empresas II |
| dc.subject.none.fl_str_mv |
Elevator Lift Tabu search Genetic algorithm Elevator group system Vertical transportation Car dispatching |
| topic |
Elevator Lift Tabu search Genetic algorithm Elevator group system Vertical transportation Car dispatching |
| description |
The most common problem in vertical transportation using elevator group appears when a passenger wants to travel from a floor to other different floor in a building. The passenger makes a hall call by pressing a landing call button installed at the floor and located near the cars of the elevator group. After that, the elevator controller receives the call and identifies which one of the elevators in the group is most suitable to serve the person having issued the call. In this paper, we have developed different elevator group controllers based on genetic and tabu search algorithms. Even though genetic algorithm has been previously considered in vertical transportation problems, the use of tabu search approaches is a novelty in vertical transportation and has not been considered previously. Tests have been carried out for high-rise buildings considering diverse sizes in the group of cars. Results indicate that the waiting time and journey time of passengers were significantly improved when dealing with such soft computing approaches. Also, a quickly evaluable solution quality function in the algorithms allows suitable computational times for industry implementation. |
| publishDate |
2011 |
| dc.date.none.fl_str_mv |
2011 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/submittedVersion |
| format |
article |
| status_str |
submittedVersion |
| dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11441/40534 https://doi.org/10.1016/j.asoc.2010.05.023 |
| url |
http://hdl.handle.net/11441/40534 https://doi.org/10.1016/j.asoc.2010.05.023 |
| dc.language.none.fl_str_mv |
Inglés |
| language_invalid_str_mv |
Inglés |
| dc.relation.none.fl_str_mv |
Applied Soft Computing, 11(2), 1792-1800 https://doi.org/10.1016/j.asoc.2010.05.023 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf application/pdf |
| dc.publisher.none.fl_str_mv |
Elsevier |
| publisher.none.fl_str_mv |
Elsevier |
| dc.source.none.fl_str_mv |
reponame:idUS. Depósito de Investigación de la Universidad de Sevilla instname:Universidad de Sevilla (US) |
| instname_str |
Universidad de Sevilla (US) |
| reponame_str |
idUS. Depósito de Investigación de la Universidad de Sevilla |
| collection |
idUS. Depósito de Investigación de la Universidad de Sevilla |
| repository.name.fl_str_mv |
|
| repository.mail.fl_str_mv |
|
| _version_ |
1869407199539757056 |
| score |
15,301603 |