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

DOI10.1007/s10878-013-9620-1zbMath1312.90011OpenAlexW2026045445MaRDI QIDQ2343997

Harri Ehtamo, Panos M. Pardalos, Mirko Ruokokoski

Publication date: 11 May 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9620-1

zbMATH Keywords

valid inequalitiesroutingelevator dispatching problempolyhedral results

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (3)

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 ⋮ Real-time algorithms for the bilevel double-deck elevator dispatching problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• The precedence-constrained asymmetric traveling salesman polytope
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. I: Formulation and simulations
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm
• Optimal control of double-deck elevator group using genetic algorithm
• On a theorem of J. Schroder
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Solution of a Large-Scale Traveling-Salesman Problem
• Real-Time Destination-Call Elevator Group Control on Embedded Microcontrollers
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results