Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm
DOI10.1016/J.EJOR.2004.04.039zbMATH Open1075.90007OpenAlexW2114172661MaRDI QIDQ2485348FDOQ2485348
Authors: Shunji Tanaka, Yukihiro Uraguchi, Mituhiko Araki
Publication date: 4 August 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.039
Recommendations
- Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. I: Formulation and simulations
- Computational bounds for elevator control policies by large scale linear programming
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- Real-time algorithms for the bilevel double-deck elevator dispatching problem
- Assignment formulation for the elevator dispatching problem with destination control and its performance analysis
Lagrangian relaxationTransportationBranch-and-bound algorithmDestination hall call registrationElevator operation
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (4)
- Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. I: Formulation and simulations
- Computational bounds for elevator control policies by large scale linear programming
- A method for the energy optimization of a multisource elevator
- Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results
This page was built for publication: Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485348)