Real-time algorithms for the bilevel double-deck elevator dispatching problem
From MaRDI portal
Publication:2329709
DOI10.1007/s13675-018-0108-8zbMath1423.90279OpenAlexW2900905090WikidataQ128952269 ScholiaQ128952269MaRDI QIDQ2329709
Publication date: 18 October 2019
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-018-0108-8
genetic algorithmbilevel optimizationdestination controlelevator dispatchingdelayed assignmentsdouble-deck elevator
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Assignment formulation for the elevator dispatching problem with destination control and its performance analysis
- Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
- Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- Evolutionary bi-objective optimisation in the elevator car routing problem
- Optimal control of double-deck elevator group using genetic algorithm
This page was built for publication: Real-time algorithms for the bilevel double-deck elevator dispatching problem