ABOUT A SOLUTION TO THE PUBLIC TRANSPORTATION NETWORK PROBLEM IN THE CITY WITH SEVERAL OPERATING CENTERS

Abstract

: The problem of the city's public transportation network with several operating centers is an integer programming problem, if the number of variables is large enough, it is an NP-hard problem. It is not possible to find an exact solution to this problem in practice. In this paper, we propose a solution to the problem of the city's public transportation network with several operating centers by "simplifying" the problem step by step, after each step the problem becomes easier to solve. Finally, bring the problem to the group of optimal problems with solutions in polynomial time. Then, it can be applied to solve the problem of the public transportation network in Hanoi as well as other cities.