Assignment formulation for the elevator dispatching problem with destination control and its performance analysis

DOI10.1016/J.EJOR.2016.01.019zbMATH Open1346.90520OpenAlexW2274680267MaRDI QIDQ322904FDOQ322904

Authors Mirko Ruokokoski, Janne Sorsa, Marja-Liisa Siikonen, Harri Ehtamo

Publication date 7 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2016.01.019

zbMATH Keywords

linear programmingassignment formulationcollective controldestination controlelevator dispatching problem

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results
• Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
• Real-time algorithms for the bilevel double-deck elevator dispatching problem
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. I: Formulation and simulations
• Two-at-a-strike: optimized dynamic scheduling for ADAC and elevators

Cites work

• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. I: Formulation and simulations
• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows

Cited in

(8)

• A method for the energy optimization of a multisource elevator
• Real-time algorithms for the bilevel double-deck elevator dispatching problem
• More Analyses for the Service Performance of Elevator Group Systems
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. I: Formulation and simulations
• Optimal parking of idle elevators under myopic and state-dependent policies
• Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm
• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results

This page was built for publication: Assignment formulation for the elevator dispatching problem with destination control and its performance analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322904)