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

DOI10.1016/j.ejor.2016.01.019zbMath1346.90520OpenAlexW2274680267MaRDI QIDQ322904

Mirko Ruokokoski, Marja-Liisa Siikonen, Janne Sorsa, 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)

Related Items (2)

Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control ⋮ Real-time algorithms for the bilevel double-deck elevator dispatching problem

Cites Work

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

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