Abstract
For reducing traffic jams without widening streets, we come up with a tenement rearrangement problem. In this paper, we study a tenement allocation model which includes two types of tenants, i.e., typical tenants and special tenants who owned houses by themselves. The optimal allocation is that total transportation cost is minimized without undermining tenants’ individual housing preference or increasing individual cost. Besides, we present a Modified Hungarian Algorithm for the above tenement allocation problem and prove that it can be solved in polynomial time. Furthermore, computational tests show that this algorithm has a good performance.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Walker, B., Marsh, A., Wardman, M., et al.: Modelling tenants’ choices in the public rented sector: a stated preference approach. Urban Stud. 39(4), 665–688 (2002)
Sun, T.: The Study About Construction in Multiple Centers and Energy Conservation of Beijing Annual Report on Economic Development of Beijing (2014–2015). Social Sciences Academic Press, Beijing (2015)
Herbert, J.D., Stevens, B.H.: A model for the distribution of residential activity in urban areas. J. Reg. Sci. 2(2), 21–36 (1960)
Kemp, J.A., McKernan, R.M.: NMDA receptor pathways as drug targets. Nat. Neurosci. 5, 1039–1042 (2002)
Pawson, H., Munro, M.: Explaining tenancy sustainment rates in British social rented housing: the roles of management, vulnerability and choice. Urban Stud. 47(1), 145–168 (2010)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(12), 83–97 (1955)
Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)
Ford, L.R., Fulkerson, D.R.: A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem. Rand Corporation, Santa Monica (1995)
Hopcroft, J.E., Karp, R.M.: An \(n^{2.5}\) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)
Goel, A., Kapralov, M., Khanna, S.: Perfect matchings in \( O(n\log n )\) time in regular bipartite graphs. SIAM J. Comput. 42(3), 1392–1404 (2013)
Murty, K.G.: Letter to the editor: an algorithm for ranking all the assignments in order of increasing cost. Oper. Res. 16(3), 682–687 (1968)
Edelsbrunner, H., Guibas, L., Pach, J., et al.: Arrangements of curves in the planetopology, combinatorics, and algorithms. Theor. Comput. Sci. 92(2), 319–336 (1992)
Shahrokhi, F., Skora, O., Szkely, L.A., et al.: On bipartite drawings and the linear arrangement problem. SIAM J. Comput. 30(6), 1773–1789 (2001)
Li, L. Y. O., Fu, Z.: The school bus routing problem: a case study. J. Oper. Res. Soc., 552–558 (2002)
Fisher, M., Ritchie, D., Savva, M., et al.: Example-based synthesis of 3d object arrangements. ACM Trans. Graph. (TOG) 31(6), 135 (2012)
Author information
Authors and Affiliations
Corresponding author
Additional information
The work was partially supported by the National Natural Science Foundation of China (No. 61221063) and a Special Financial Grant from the China Postdoctoral Science Foundation (No. 2015T81040).
Rights and permissions
About this article
Cite this article
Luo, KL., Xu, YF. & Cao, YF. The Optimal Tenement Allocation for Reducing Traffic Burden. J. Oper. Res. Soc. China 4, 233–242 (2016). https://doi.org/10.1007/s40305-015-0100-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40305-015-0100-4