Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models

DOI10.1016/j.dam.2006.03.034zbMath1113.90019OpenAlexW1975310916MaRDI QIDQ2500540

Philipp Friese, Jörg Rambau

Publication date: 17 August 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.034

zbMATH Keywords

simulationpolicyonlinereal-timereoptimizationelevator group control

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (5)

Balancing profits and costs on trees ⋮ Computational bounds for elevator control policies by large scale linear programming ⋮ Real-Time Destination-Call Elevator Group Control on Embedded Microcontrollers ⋮ Profit-based latency problems on the line ⋮ Real-time algorithms for the bilevel double-deck elevator dispatching problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elevator group control using multiple reinforcement learning agents
• QOBJ modeling. A new approach in discrete event simulation
• News from the online traveling repairman.
• Dynamic vehicle routing: Status and prospects
• Dynamic fleet management as a logistics queueing network
• Diversion Issues in Real-Time Vehicle Dispatching
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Algorithms and Computation
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Euler is standing in line dial-a-ride problems with precedence-constraints
• On-line single-server dial-a-ride problems

This page was built for publication: Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models