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

DOI10.1007/S10878-013-9620-1MaRDI QIDQ2343997zbMATH OpenOpenAlexFDO

Authors Mirko Ruokokoski, Harri Ehtamo, Panos M. Pardalos

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

elevator dispatching problempolyhedral resultsroutingvalid inequalities

Mathematics Subject Classification ID

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

Recommendations

• Assignment formulation for the elevator dispatching problem with destination control and its performance analysis
• 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
• Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
• Computational bounds for elevator control policies by large scale linear programming

Cites work

• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
• 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
• scientific article; zbMATH DE number 1749222 (Why is no real title available?)
• On a theorem of J. Schroder
• Optimal control of double-deck elevator group using genetic algorithm
• Real-time destination-call elevator group control on embedded microcontrollers
• Solution of a Large-Scale Traveling-Salesman Problem
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• The precedence-constrained asymmetric traveling salesman polytope

Cited in

(4)

• 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
• Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
• Current and future trends in vertical transportation

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2343997)