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.039zbMath1075.90007OpenAlexW2114172661MaRDI QIDQ2485348

Mituhiko Araki, Yukihiro Uraguchi, Shunji Tanaka

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

zbMATH Keywords

Lagrangian relaxationTransportationBranch-and-bound algorithmDestination hall call registrationElevator operation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results

Cites Work

• Unnamed Item
• The pickup and delivery problem with time windows
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• The school bus routing problem: a case study
• The General Pickup and Delivery Problem

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