The Elevator Trip Origin-Destination Matrix Estimation Problem

References

• Barney G (2003) Elevator Traffic Handbook: Theory and Practice (Spon Press, London).Crossref, Google Scholar
• Bazaraa MS, Jarvis JJ, Sherali HD (2009) Linear Programming and Network Flows (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Bell MGH (1983) The estimation of an origin-destination matrix from traffic counts. Transportation Sci. 17(2):198–217.Link, Google Scholar
• Bell MGH (1991) The estimation of origin-destination matrices by constrained generalized least squares. Transportation Res. B 25(1):13–22.Crossref, Google Scholar
• Ben-Akiva ME, Macke PP, Hsu PS (1985) Alternative methods to estimate route-level trip tables and expand on-board surveys. Transportation Res. Record 1037:1–11.Google Scholar
• Cascetta E (1984) Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator. Transportation Res. B 18(4/5):289–299.Crossref, Google Scholar
• Cascetta E, Nguyen S (1988) A unified framework for estimating or updating origin/destination matrices from traffic counts. Transportation Res. B 22(6):437–455.Crossref, Google Scholar
• Chang X-W, Han Q (2008) Solving box-constrained integer least squares problems. IEEE Trans. Wireless Comm. 7(1):277–287.Crossref, Google Scholar
• Chang X-W, Yang X (2006) A new fast generalized sphere decoding algorithm for under-determined MIMO systems. Proc. 23rd Queen's Biennial Sympos. Comm., Kingston, Ontario, 18–21.Google Scholar
• Chang X-W, Yang X (2007a) An efficient regularization approach for underdetermined MIMO system decoding. Guizani M, Chen H-H, Zhang X, eds. Proc. 2007 Internat. Wireless Comm. Mobile Comput. Conf. (ACM, New York), 349–353.Crossref, Google Scholar
• Chang X-W, Yang X (2007b) An efficient tree search decoder with column reordering for underdetermined MIMO systems. Proc. IEEE GlobeCOM 2007, Washington, DC, 4375–4379.Crossref, Google Scholar
• Cui T, Tellambura C (2005) An efficient generalized sphere decoder for rank-deficient MIMO systems. IEEE Comm. Lett. 9(5): 423–425.Crossref, Google Scholar
• Damen MO, Abed-Meraim K, Belfiore J-C (2000) Generalized sphere decoder for asymmetrical space-time communication architecture. IEEE Electronics Lett. 36(2):166–167.Crossref, Google Scholar
• Damen MO, Gamal HE, Caire G (2003) On maximum-likelihood detection and the search for the closest lattice point. IEEE Trans. Inform. Theory 49(10):2389–2402.Crossref, Google Scholar
• Dayal P, Varanasi MK (2003) A fast generalized sphere decoder for optimum decoding of under-determined MIMO systems. Proc. 41st Annual Allerton Conf. Comm., Control, Comput., Monticello, IL, 1216–1225.Google Scholar
• Fincke U, Pohst M (1985) Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comput. 44(170):463–471.Crossref, Google Scholar
• Fisk C (1988) On combining maximum entropy trip matrix estimation with user optimal assignment. Transportation Res. B 22(1): 69–79.Crossref, Google Scholar
• Furth PG, Navick DS (1992) Bus route O-D matrix generation: Relationship between biproportional and recursive methods. Tranportation Res. Record 1338:14–21.Google Scholar
• Huang M, Xu L, Wang J, Gu S (2003) Predictive method for traffic flow of elevator systems based on neural networks. Proc. 4th Internat. Conf. Control and Automation, Montreal, 683–687.Google Scholar
• Imrak C, Özkirim M (2006) Determination of the next stopping floor in elevator traffic control by means of neural networks. J. Electr. Electronics Engrg. 6(1):27–33.Google Scholar
• Jianru W, Xiaowei J, Yingpei L, Hong S (2007) Elevator traffic-flow prediction based on wavelet network. Elevator World 55(12): 132–137.Google Scholar
• Kannan R (1983) Improved algorithms for integer programming and related lattice problems. Johnson DS, Fagin R, Fredman ML, Harel D, Karp RM, Lynch NA, Papadimitriou CHet al., eds. Proc. ACM Sympos. Theory Comput. (ACM, New York), 193–206.Crossref, Google Scholar
• Koehler J, Ottiger D (2002) An AI-based approach to destination control in elevators. AI Magazine 23(3):59–78.Google Scholar
• Ku W-Y (2011) Lattice preconditioning methods for the real relaxation based branch and bound method for integer least squares problems. Master's thesis, School of Computer Science, McGill University, Montreal.Google Scholar
• Lamond B, Stewart NF (1981) Bregman's balancing method. Transportation Res. B 15(4):239–248.Crossref, Google Scholar
• Lawson CL, Hanson RJ (1995) Solving Least Squares Problems (SIAM, Philadelphia).Crossref, Google Scholar
• Li B (2009) Markov models for Bayesian analysis about transit route origin-destination matrices. Transportation Res. B 43(3):301–310.Crossref, Google Scholar
• Li Y, Cassidy MJ (2007) A generalized and efficient algorithm for estimating transit route ODs from passenger counts. Transportation Res. B 41(1):114–125.Crossref, Google Scholar
• Luh PB, Xiong B, Chang SC (2008) Group elevator scheduling with advance information for normal and emergency modes. IEEE Trans. Automation Sci. Engrg. 5(2):245–258.Crossref, Google Scholar
• Lundgren JT, Peterson A (2008) A heuristic for the bilevel origin-destination-matrix estimation problem. Transportation Res. B 42(4):339–354.Crossref, Google Scholar
• Luo F, Xu Y-G, Cao J-Z (2005) Elevator traffic flow prediction with least-squares support vector machines. Proc. 4th Internat. Conf. Machine Learn. Cybernetics, Guangzhou, China, 4266–4270.Google Scholar
• Maher MJ (1983) Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach. Transportation Res. B 17(6):435–447.Crossref, Google Scholar
• Nguyen S (1984) Estimating origin-destination matrices from observed flows. Florian M, ed. Transportation Planning Models (North-Holland, Amsterdam), 363–380.Google Scholar
• Powell BA, Sirag DJ, Whitehall BL (2000) Artificial neural networks in elevator dispatching. Lift Report 27(2):44–57.Google Scholar
• Schnorr CP, Euchner M (1994) Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Programming 66(1-3):181–199.Crossref, Google Scholar
• Siikonen M-L (1997) Elevator group control with artificial intelligence. Research report A67, Helsinki University of Technology, Systems Analysis Laboratory, Aalto, Finland.Google Scholar
• Siikonen M-L, Kaakinen M (1993) Using artificial intelligence to improve passenger service quality. Barney GC, ed. Proc. Elevcon'93 (IAEE Publications, Bramhall, UK), 239–246.Google Scholar
• Siikonen M-L, Susi T, Hakonen H (2001) Passenger traffic flow simulation in tall buildings. Elevator World August:117–123.Google Scholar
• Spiess H (1987) A maximum likelihood model for estimating origin-destination matrices. Transportation Res. B 21(5):395–412.Crossref, Google Scholar
• Strakosch GR (1983) Vertical Transportation: Elevators and Escalators (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Tsygalnitsky S (1977) Simplified methods for transportation planning. Master's thesis, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Tyni T, Ylinen J (2001) Genetic algorithms in elevator car routing problem. Spector L, Goodman ED, Wu A, Langdon WB, Voigt H-M, Gen M, Sen Set al., eds. Proc. Genetic and Evolutionary Comput. Conf. (GECCO-2001) (Morgan Kaufmann, San Francisco), 1413–1422.Google Scholar
• Utgoff PE, Connell ME (2012) Real-time combinatorial optimization for elevator group dispatching. IEEE Trans. Systems, Man, and Cybernetics—Part A: Systems and Humans 42(1):130–146.Crossref, Google Scholar
• Xiang L, Ling T, Qun Z (2005) ARMA model for elevator traffic flow forecasting. Elevator World 53(8):83–87.Google Scholar
• Yan X, Liu Y, Mao Z, Li Z-H, Tan H-Z (2006) SVM-based elevator traffic flow prediction. Proc. 6th World Congress on Intelligent Control and Automation, Dalian, China, 8814–8818.Google Scholar
• Yang H, Sasaki T, Iida Y, Asakura Y (1992) Estimation of origin-destination matrices from link traffic counts on congested networks. Transportation Res. B 26(6):417–434.Crossref, Google Scholar
• Yang X (2008) Numerical methods for box-constrained integer least squares problems. Ph.D. thesis, School of Computer Science, McGill University, Montreal.Google Scholar
• Yang Z, Liu C, He J (2005) A new approach for fast generalized sphere decoding in MIMO systems. IEEE Signal Processing Letters 12(1):41–44.Crossref, Google Scholar
• Yoneda K (2006) A parallel to the least squares for positive inverse problems. J. Oper. Res. Soc. Japan 49(4):279–289.Google Scholar
• Yoneda K (2007) Elevator trip distribution for inconsistent passenger input–output data. Decision Making in Manufacturing and Services 1(1–2):175–190.Google Scholar
• Zuylen HJV, Branston DM (1982) Consistent link flow estimation from counts. Transportation Res. B 16(6):473–476.Crossref, Google Scholar
• Zuylen HJV, Willumsen LG (1980) The most likely trip matrix estimated from traffic counts. Transportation Res. B 14(3):281–293.Crossref, Google Scholar