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

Mirko Ruokokoski (), Harri Ehtamo () and Panos M. Pardalos ()
Additional contact information
Mirko Ruokokoski: School of Science, Aalto University
Harri Ehtamo: School of Science, Aalto University
Panos M. Pardalos: University of Florida

Journal of Combinatorial Optimization, 2015, vol. 29, issue 4, No 6, 750-780

Abstract: Abstract In the static elevator dispatching problem the aim is to design a route for each capacitated elevator to satisfy a set of transportation requests such that a cost function is minimized while satisfying a number of constraints. This problem is a crucial part in the control of an elevator group. So far, the problem has been formulated in various algorithmic-dependent forms, where part of the constraints have been given only verbally. In this paper we present a mixed-integer linear programming formulation of the problem where all constraints are given in explicit mathematical form. This allows, e.g., polyhedral analysis of the problem. We also present some new valid inequalities to strengthen the formulation. Furthermore, we study the polyhedral structure of the problem in a generic case arising in the down-peak traffic pattern. In particular, we show which equalities define a minimal equality system for the polytope of the problem, which is defined as the convex hull of the feasible solutions. In addition, we provide the dimension of the polytope and analyze which valid inequalities derived are facet inducing.

Keywords: Elevator dispatching problem; Routing; Polyhedral results; Valid inequalities; 90B06; 90C11; 90C27; 90C57 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9620-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9620-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9620-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().