The optimal tenement allocation for reducing traffic burden

Ke-Lin Luo (Corresponding author), Yin-Feng Xu, Yong-Feng Cao

Research output: Contribution to journalArticleAcademicpeer-review

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.
Original languageEnglish
Pages (from-to)233-242
Number of pages10
JournalJournal of the Operations Research Society of China
Volume4
Issue number2
DOIs
Publication statusPublished - Jun 2016
Externally publishedYes

Keywords

  • Tenement allocation
  • Transport fee
  • Traffic burden
  • Modified Hungarian Algorithm

Cite this