Real-time algorithms for the bilevel double-deck elevator dispatching problem

Double-deck elevators consist of two elevator cars attached together and, thus, save building core space. In the destination control system (DCS), passengers register their destination floors in the elevator lobbies. In return, the DCS immediately assigns an elevator to each transportation request a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Janne Sorsa
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2019
Materias:	90B08 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/de3f0620f1094f01a410bc9a31abd645
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:de3f0620f1094f01a410bc9a31abd645
record_format	dspace
spelling	oai:doaj.org-article:de3f0620f1094f01a410bc9a31abd6452021-12-02T05:01:10ZReal-time algorithms for the bilevel double-deck elevator dispatching problem2192-440610.1007/s13675-018-0108-8https://doaj.org/article/de3f0620f1094f01a410bc9a31abd6452019-03-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S219244062100112Xhttps://doaj.org/toc/2192-4406Double-deck elevators consist of two elevator cars attached together and, thus, save building core space. In the destination control system (DCS), passengers register their destination floors in the elevator lobbies. In return, the DCS immediately assigns an elevator to each transportation request and signals it to the passenger. Based on the additional information, the DCS is able to increase handling capacity under incoming traffic conditions. However, the double-deck DCS does not yet function optimally in mixed lunch traffic, which consists of incoming, outgoing and interfloor traffic. In this paper, the double-deck DCS is further developed by introducing delayed elevator and deck assignments. With the delayed assignments, the serving elevator or deck of each request can be reassigned to another elevator or deck until the last moment. Such a double-deck DCS can better adapt to emerging requests and, as a result, can improve passenger service quality in lunch traffic dramatically. To enable real-time optimization in an elevator group control system, this paper formulates the double-deck elevator dispatching problem as a bilevel optimization problem and solves the problem fast with a genetic algorithm. Numerical experiments show that the bilevel algorithm outperforms the earlier single-level algorithm in both solution quality and computation times.Janne SorsaElsevierarticle90B08Applied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 7, Iss 1, Pp 79-122 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	90B08 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90B08 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Janne Sorsa Real-time algorithms for the bilevel double-deck elevator dispatching problem
description	Double-deck elevators consist of two elevator cars attached together and, thus, save building core space. In the destination control system (DCS), passengers register their destination floors in the elevator lobbies. In return, the DCS immediately assigns an elevator to each transportation request and signals it to the passenger. Based on the additional information, the DCS is able to increase handling capacity under incoming traffic conditions. However, the double-deck DCS does not yet function optimally in mixed lunch traffic, which consists of incoming, outgoing and interfloor traffic. In this paper, the double-deck DCS is further developed by introducing delayed elevator and deck assignments. With the delayed assignments, the serving elevator or deck of each request can be reassigned to another elevator or deck until the last moment. Such a double-deck DCS can better adapt to emerging requests and, as a result, can improve passenger service quality in lunch traffic dramatically. To enable real-time optimization in an elevator group control system, this paper formulates the double-deck elevator dispatching problem as a bilevel optimization problem and solves the problem fast with a genetic algorithm. Numerical experiments show that the bilevel algorithm outperforms the earlier single-level algorithm in both solution quality and computation times.
format	article
author	Janne Sorsa
author_facet	Janne Sorsa
author_sort	Janne Sorsa
title	Real-time algorithms for the bilevel double-deck elevator dispatching problem
title_short	Real-time algorithms for the bilevel double-deck elevator dispatching problem
title_full	Real-time algorithms for the bilevel double-deck elevator dispatching problem
title_fullStr	Real-time algorithms for the bilevel double-deck elevator dispatching problem
title_full_unstemmed	Real-time algorithms for the bilevel double-deck elevator dispatching problem
title_sort	real-time algorithms for the bilevel double-deck elevator dispatching problem
publisher	Elsevier
publishDate	2019
url	https://doaj.org/article/de3f0620f1094f01a410bc9a31abd645
work_keys_str_mv	AT jannesorsa realtimealgorithmsforthebileveldoubledeckelevatordispatchingproblem
_version_	1718400860019490816

Real-time algorithms for the bilevel double-deck elevator dispatching problem

Ejemplares similares