{"id":408781,"date":"2024-06-29T20:22:42","date_gmt":"2024-06-29T20:22:42","guid":{"rendered":"http:\/\/savepearlharbor.com\/?p=408781"},"modified":"-0001-11-30T00:00:00","modified_gmt":"-0001-11-29T21:00:00","slug":"","status":"publish","type":"post","link":"https:\/\/savepearlharbor.com\/?p=408781","title":{"rendered":"Affordable as a Bus, Comfortable as a Taxi: A Promising Type of Public Transport for Large and Medium-Sized Cities.Part3<\/span>"},"content":{"rendered":"
<\/div>\n
\n
\n
\n
<\/p>\n

Translation provided by ChatGPT, link to the original article in Russian<\/a><\/p>\n

Link to Part 1: \u00abPreliminary Analysis\u00bb (\u0440\u0443 <\/a>\/ eng <\/a>)
Link to Part 2: \u00abExperiments on a Torus\u00bb (\u0440\u0443 <\/a>\/ eng<\/a> )
Link to Part 3: \u00abPractically Significant Solutions\u00bb (\u0440\u0443 <\/a>\/ eng <\/a>)
Link to \u00abSummary\u00bb (\u0440\u0443<\/a> \/ eng <\/a>)<\/p>\n

1 Playing Diplomacy<\/font>
<\/h3>\n

<\/p>\n

1.1 What this work is about<\/h4>\n

You’re reading the third and final article in a series dedicated to minibus route schemes that would allow you to travel reasonably quickly, inexpensively, and most importantly, without any transfers, from any intersection to any other within a large city. You’ll see many graphs, formulas, and figures below, but before we get to the technical part, I’d like to discuss the challenge of implementing this idea and invite you to participate in solving it.<\/p>\n

1.2 A puzzle for the talented and brave (Eccentrics are welcome: ?<\/a>) <\/h4>\n

I propose an adventure,
I propose a game,
I propose that you become part of a positive change in the lifestyle of almost a billion people around the planet,
I can’t do this alone.
To start, I need your help with the following: <\/a><\/p>\n

One of the pioneers of cybernetics and a medical doctor, Ross Ashby, put forth the idea that the main task of intelligence is to battle variety. Living beings and social institutions attempt to narrow down future possibilities to the desirable ones, try to hinder or compensate for the flow of information directed at them, specifically, they create informational barriers (from a turtle’s shell to anti-spam programs). If you want to influence something intellectual, you will have to overcome its informational resistance. This is a natural law \u2014 almost a mathematical one, and its existence in our world should be taken as a given.<\/p>\n

Now I have a solution, albeit a model one, but good enough, and the next step I see is to try and overcome the information barrier. We need to make the topic of non-stop public transportation a subject of public discussion, a focus for groups potentially interested in its implementation. From there, we can talk about creating a research group that will seek solutions for real cities, and its funding.<\/p>\n

If you have ideas, reasonable advice \u2014 express them in the comments. If you are ready to participate personally \u2014 send me an email with your proposals to my email address: magnolia@bk.ru.<\/p>\n

I won’t be able to pay for your work immediately, but I can make the following public promise. If successful, I will undoubtedly be approached for technical consultations. I won’t provide any until the work you’ve done, which has market value and was aimed at achieving results, is paid fivefold. If we fail, each of our efforts will remain unpaid. Risk demands reward!<\/p>\n

I respect your need for self-realization. If you join the project, your participation and your work will be as public as you wish.<\/p>\n

Now let me express my, albeit not very mature, vision of what we presumably have to work with.<\/p>\n

1.3 The playing field and the distribution of forces (?)<\/a><\/h4>\n

Let’s start with good news. <\/p>\n

Market size.<\/i>
The estimates I provide in this article show that the non-stop scheme can already be attempted in cities with a population of 1 million people. Around 1 billion people<\/a> live in million-plus cities around the world. If the daily transport expenses of their average resident are estimated at $3, we have a suitable market for implementation amounting to roughly 1,000,000,000,000 ($1 trillion) per year \u2014 this is approximately a third of France’s total GDP for 2021. I have a humble assumption that capital of such magnitude is a sufficient incentive for changes in the economies of entire countries and sectors of global industry. Now, let’s discuss our little zoo of interested parties.<\/p>\n

Large city residents.<\/i>
Probably the most interested and at the same time the least influential group. With the implementation of bus taxi, they would gain several dozen minutes of personal time per day, comfort and simplicity of moving around the city, free roads, less noise and air pollution. They have collective political influence on municipalities. The media and actions of municipalities can influence this group itself.<\/p>\n

Large city municipalities.<\/i>
A key element of the mosaic, seemingly the most influential and least interested. It is city administrations that provide access to research data and make decisions about transport reform. In an ideal world, they could only gain political points from all this. In reality, various lobbies and informal agreements should be taken into account, which can both contribute (for example, from the side of minibus manufacturers) and hinder (owners of the previous public transport) the implementation of the technology. An extremely positive scenario is possible when the mayor and his team turn out to be ideological innovators.<\/p>\n

Car and bus manufacturers.<\/i>
A very interesting game situation is unfolding here. If a comfortable bus taxi appears, then on the one hand, it will create competition for cars, and these firms will inevitably suffer losses, and on the other \u2014 a new sizable market for the production and maintenance of a large number of special type minibuses will be formed. Potentially, if car manufacturers acted as a whole, they could block the introduction of bus taxi. However, if they do so, each of them will have a huge incentive to cheat and enter the new market before the others. The first one to start mass-producing minibuses for shared taxi will get all the bonus from capturing the new market, and the losses from reducing the old one \u2014 will share among everyone. Blocking is an unstable situation, and representatives of the auto industry will try to avoid it, and I will help them do it \ud83d\ude42<\/p>\n

Companies and startups in the urban passenger transportation market.<\/i>
This is also an interesting group. The game situation for old players resembles the game situation for car manufacturers, but this time it is significantly more favorable. The difference is that bus taxi potentially can attract a significant part of those who used to drive a car themselves, hence the changes are beneficial. On the other hand, just like for car manufacturers, if a passenger transport operating company decides to continue working in the old way, it runs a huge risk of being pushed out of its old niche. There’s huge growth potential for quick and flexible startups in terms of organizational decisions.<\/p>\n

These are the ones who will directly use the bus taxi routing technology, so they will try in every possible way to pull the blanket over themselves, patent everything and keep it secret. They influence municipalities through lobbying and affect the mood of city residents through job availability.<\/p>\n

Research groups and universities.<\/i>
\u00abMostly harmless\u00bb.<\/a> When thinking about a structure capable of influencing and being receptive to influence, I regard university research groups with a great deal of skepticism. Current policy forces them to focus on publishing a number of articles rather than achieving practical results. At the same time, I admit that there are individual outstanding teams and personalities with whom it is worth establishing bilateral contact.<\/p>\n

1.4 Vision of the future and my personal goals: option 0 <\/h4>\n

The solution that exists now is only suitable for grid cities, and the question of its generalization to cities of other types requires research. I assume that such generalizations exist, and I even understand the direction in which to move. But all of this is a voluminous painstaking work, and it would be foolish on my part to try to do it alone. A research group is needed. Even if we’re talking about implementing the already developed bus taxi scheme in real grid cities, which do exist, a million little nuances and problems will inevitably arise \u00abon the ground\u00bb that also require a research group to solve. I think it would be interesting for me to take on the task of creating and coordinating such a group, and my presence in it will speed up the research process.<\/p>\n

My position is that the results of the research should be open, and the technology should be accessible to everyone. I don’t need a billion, my life is worth more and there are still many mysteries in it that I would like to have time to solve. Of course, it’s difficult to fit such a mindset into the modern world of capital, where industrial knowledge is tried to be either turned into property or kept secret. But it seems I have come up with a way to solve this problem.<\/p>\n

Most likely, the main interested parties in the research results will be firms capable of producing new types of buses, and firms that will directly engage in passenger transportation. How can they be made to financially support an independent research group without transferring the rights to the research results?
My idea is to sell these firms the right of embassy. Here’s how I see it.<\/p>\n

An independent research group has a core team of its permanent employees with fully transparent and open research tasks for all its members. Periodically, let’s say every half a year or a year, the research results are published for the rest of the world. If a certain company is interested in obtaining more recent information, as well as training its personnel, it can buy from the independent research group the right of embassy for its representatives. With this right, the company is allowed to place 3-5 of its own employees within the independent research group, who will automatically gain access to all the information inside and, if desired, can join the research projects themselves.<\/p>\n

I’m not the biggest expert in game theory, but it seems that in the just described scheme all key interested firms would prefer to buy the right of embassy.<\/p>\n

1.5 Immediate necessary actions<\/h4>\n

Among the first things I see are:
a) translation into English;
b) peer review;
c) search for some minimal source of money;
d) the question of English-language platforms where the translated articles can be published.
f) adaptation of the text for mainstream media;
g) search for contacts within the community of architects and urban planners. <\/p>\n

If you have any thoughts on any of these points, please share them.<\/p>\n

As for the translation, I know a translator with a good knowledge of mathematics and economics, who has lived in the UK for a long time and therefore understands the peculiarities of Western culture. She translated \u00ab\u0410 City without Traffic Jams\u00bb<\/a> for me. At that time, I paid for her work: translation together with editing.
Now I need patrons.
The cost of translating one article is about 20,000 rubles.
As a token of gratitude, the patron’s name (or the name of the sponsoring organization) will be indicated in the English and Russian versions of the article before the author’s signature.<\/p>\n

Well, that’s enough diplomacy for today, let’s move on to the technical part of the article. This part is not standalone and to understand it, you will need to familiarize yourself with the two previous ones. If formulas do not display correctly, try refreshing the page several times.<\/p>\n

Practically significant solutions.<\/font>
<\/h2>\n

<\/p>\n

What is the problem, exactly?<\/h4>\n

Let’s suppose we need to design a bus service scheme within a certain rectangular grid city on a plane. How can we do it in the best way possible?<\/p>\n

Coming full circle, we return to the very question we began with in Part 1<\/a>, but now we have new knowledge that will allow us to construct a network of bus route corridors such that:<\/p>\n

1) the bus stops will cover the entire city with a square grid with a cell size of \"$d, where \"$d$\" is the block size;
2) from any stop to any other, you can travel without changing buses;
3) traveling by bus around the city, on average, will be no more than \"$(1 times more time-consuming than by private car or personal taxi;
4) the average number of passengers in the cabin will be such that the cost of trips on our bus taxi will be close to the cost of trips on a regular city bus.<\/p>\n

2 Bus Taxi with a Network of Simple Corner Corridors<\/font>
<\/h3>\n

<\/p>\n

2.1 Network of Upper Corners<\/h4>\n

Let’s assume our city has a size of \"$L_h and is already divided by the grid \"$\\{S_{h,w}\\}$\", \"$1, \"$1 into squares of size \"$. Between any two cells \"$S_{h\u2019,w\u2019}$\" and \"$S_{h\u2019\u2019,w\u2019\u2019}$\" of the grid \"$\\{S_{h,w}\\}$\" such that they do not lie in the same row or column, exactly two \"$\\Gamma$\" -shaped shortest cell paths can be built from \"$S_{h\u2019,w\u2019}$\" to \"$S_{h\u2019\u2019,w\u2019\u2019}$\". What if we extend these paths up to the borders of the grid \"$\\{S_{h,w}\\}$\"?<\/p>\n

\"image\"<\/div>\n

Fig 1<\/i><\/p>\n

We will call any \"$\\Gamma$\" -shaped cell path that starts and ends at the border of \"${S_{h,w}}$\" a ‘corner’ path. It’s easy to verify that each segment of a corner path is a geodesic segment of it. In turn, at least two corner paths pass through any pair of cells \"$S_{h\u2019,w\u2019}$\", \"$S_{h\u2019\u2019,w\u2019\u2019}: at least one of them abuts the upper border of the city and at least one \u2014 the lower. From these two facts, for example, it follows that the set of \"$\u201cUppercorners\u201d$\" of all those corner cell paths whose vertical segments abut the top edge of the city, and the set of \"$\u201cLowercorners\u201d$\" of all those corner cell paths whose vertical segments abut the lower edge, both form geodesically connected networks of route corridors. The competition indices for both these networks are close to 1: competition in them only exists for the transportation of passengers between those pairs of cells that are in the same column or the same row.<\/p>\n

Let’s build and examine the characteristics of a bus taxi with the \"$"Uppercorners"$\" network.<\/p>\n

2.2 Number of passengers on the bus depending on its position inside the assigned route corridor<\/h4>\n

When we considered bus taxi with rectangular routes on the torus (Chapter 3, Part 2<\/a>), we were dealing with a nearly constant expected number of passengers in the cabin of each bus over time. For a bus taxi with a network of corner routes, everything is a bit different. Let \"$\\pi$\" be a corridor from \"$\u201cUppercorners\u201d$\" that starts in the cell \"$S_{y,0}$\" and ends in \"$S_{0,x}$\" (in this case, the row count is taken from top to bottom). The corner point for \"$\\pi$\" will be the cell \"$S_{y,x}$\". As in the case of a network of large rectangles on the torus, we can neglect passengers whose travel routes are within one row or one column, since there are few of them overall and there is a lot of competition for them. Under such consideration, all customers of the bus following the route \"$\\pi$\" from \"$S_{y,0}$\" to \"$S_{0,x}$\" will board it in the first \"$(x-1)$\" cells of the horizontal segment \"$\\pi$\" and disembark in the last \"$(y-1)$\" cells of the vertical segment.<\/p>\n

\"image\"<\/div>\n

Fig. 2<\/i><\/p>\n

In a city model with uniform access, the average flow of travel from each cell of the horizontal segment to each cell of the vertical segment will be the same. The uniformity of flow means that on the horizontal segment \"$\\pi$\", the expected number of passengers in the bus cabin will grow linearly, and on the vertical \u2014 decline linearly. As a consequence, the dependence of the expected bus load on time will be described by a graph of approximately triangular shape.<\/p>\n

For further analysis, we will need some additional notations. Let \"$n_{pass}(x,y)(t)$\" be the expected number of passengers at moment \"$t$\" inside the bus assigned to the corner corridor of size \"$. Next, \"$n_{pass}(x,y)$\" is the value of \"$n_{pass}(x,y)(t)$\" averaged over a long period of time \"$T$\", and finally \"$n_{pass}$\" is the value of \"$n_{pass}(x,y)$\" averaged over all buses in the city.<\/p>\n

The maximum expected number of \"$n_{pass}(x,y)(t)$\" passengers in the bus falls on the moment (moments) \"$t^0$\", when the bus has already picked up all its passengers on the horizontal segment, but has not yet dropped anyone off on the vertical segment (or vice versa when traveling in the opposite direction). In other words, the maximum of \"$n_{pass}(x,y)(t)$\" is achieved when it passes the corner zone \"$\\pi$\":<\/p>\n

\"$max_t<\/p>\n

where \"$\\sigma$\" is the number of new travelers appearing in the city area of unit area per unit time.<\/p>\n

Since the graph of \"$n_{pass}(x,y)(t)$\" has a triangular shape, its time average is half of the maximum, that is:<\/p>\n

\"$n_{pass}(x,y)<\/p>\n

2.3 Analysis of bus load within a single corner corridor<\/h4>\n

Let’s try to maximize the average number of passengers inside a bus moving along \"$\\pi$\". Let’s assume for now that the cell size \"$\\Delta has already been chosen. In this case, the only parameter we can control is the interval between buses, \"$\\Delta. Clearly, the larger \"$\\Delta, the greater \"$n_{pass}(x,y)$\", but if we take \"$\\Delta too large, bus taxi journeys will become too long compared to journeys by private car. Let’s express the difference in time between the average journey by car and by bus taxi.<\/p>\n

The average amount of time a traveler spends waiting for the next bus is \"$\\Delta. Next, we will assume that the bus uses the same traversal algorithm as in paragraph 4.3 of part 2. In this case, each bus stop is associated with a lateral maneuver, which extends the path of each passenger on average by \"$\\Delta. On average, a passenger will participate in half of all stops where the bus picks up and on average half of all stops where the bus drops off its clients during one trip. If we neglect acceleration\/deceleration time and boarding\/alighting time, then a bus ride will be longer than a trip by private car on average by<\/p>\n

\"$\\Delta<\/p>\n

If travelers were making trips between cells of the corner corridor \"$\\pi$\" by private car, the average travel time would be:<\/p>\n

\"$1\/2\\<\/p>\n

We require that, on average, additional time losses in bus taxi travel do not exceed \"$\\lambda$\" of the average travel time by car. This requirement sets a limit on the maximum value of \"$\\Delta:<\/p>\n

\"$\\Delta<\/p>\n

Using \"$(2)$\", we get:<\/p>\n

\"$\\Delta<\/p>\n

from which<\/p>\n

\"$\\Delta<\/p>\n

where<\/p>\n

\"$C_1
\"$C_2<\/p>\n

With these simplifications<\/p>\n

\"$n_{pass}(x,y)<\/p>\n

From equation \"$(7)$\" we see that asymptotically, with proportional growth of \"$x$\" and \"$y$\", the optimal value of \"$\\Delta becomes smaller, that is, the longer and wider the corridor, the smaller the interval at which buses should run along it.<\/p>\n

2.4 The total number of buses in the city<\/h4>\n

Let’s denote the number of buses moving along a corridor \"$\\pi of size \"$x in any one of its two directions as \"$N_{bus}(x,y)$\". If these buses didn’t stop anywhere, for a single pass through \"$\\pi$\", they would have to cover a distance of approximately \"$\\approx. Each stop extends the path by an average of \"$\\Delta. In total, there should be approximately \"$ such stops for a single pass, meaning that the effective length of the bus route is approximately:<\/p>\n

\"$l_{ef}(x,y)<\/p>\n

To ensure the time interval between buses in the corridor \"$\\pi$\" is equal to \"$\\Delta, the number of buses should satisfy the equation:<\/p>\n

\"$N_{bus}(x,y)<\/p>\n

from which we derive:<\/p>\n

\"$N_{bus}(x,y)<\/p>\n

or<\/p>\n

\"$N_{bus}(x,y)<\/p>\n

For simplicity, we’ll consider our city to be square: \"$, \"$H. For each pair of permissible x and y in the \u00abUppercorners\u00bb network, there are precisely two corridors (without considering directions) with a horizontal size of \"$x$\" and vertical \"$y$\". Moreover, each corridor \"$\\pi has exactly two directions of movement, which implies that the total number of buses in the city is:<\/p>\n

\"$N_{bus}<\/p>\n

Substituting \"$N and \"$C_2 into \"$(15)$\", we have:<\/p>\n

\"$N_{bus}<\/p>\n

Operating each additional bus costs money, and if we want to make the ride price as low as possible, we should minimize the number of buses, \"$N_{bus}$\". Differentiating \"$N_{bus}$\" by the only parameter we control, \"$\\Delta, we get the extremum condition:<\/p>\n

\"$-<\/p>\n

from which:<\/p>\n

\"$\\Delta<\/p>\n

and<\/p>\n

\"$N_{bus}<\/p>\n

2.5 Average Equivalent Number of Passengers in a Bus<\/h4>\n

The average number of passengers in a bus itself is not really the variable that a business should strive for. Why? The average bus (or taxi) occupancy rate is influenced not only by how well the algorithm finds co-travelers, but also by how much this algorithm extends the path of each passenger. A simple example:<\/p>\n

Let’s assume that you have found a way to carry, on average, two clients in a personal taxi at once, but at the same time you have doubled the path of each client on average. It’s easy to understand that for the same city, with the same demand for trips, you will need the same number of taxi cars as before. That is, in the situation just described, you did not receive any \u00abbenefits\u00bb from combining passenger trips.<\/p>\n

Well, if the average number of co-travelers is a poor indicator, what should we strive for? Obviously, to reduce the number of buses. But how then to compare the efficiency of shared trips in different cities? To do this, we will use the \u00abequivalent\u00bb average number of passengers in the salon, denoted as $inline$n_{pass}^$inline$. In essence, $inline$n_{pass}^$inline$ shows how many passengers, on average, one bus would have carried if the co-traveler selection algorithm did not extend the path of any of them.<\/p>\n

Assuming that the average speed \"$\\bar along the corridors is the same for all buses in the entire city, the usual average \"$n_{pas}$\" is expressed by the formula (paragraph 4.2 part 2):<\/p>\n

\"$n_{pass}<\/p>\n

where P is the total transport load created by the city (paragraph 4.2 part 2). In our model, the average speed \"$\\bar of a bus moving along its assigned corridor is less than the maximum allowed speed v because its route is longer than optimal due to side maneuvers to stop points. To \u00absubtract\u00bb the effect of path non-optimality, we replace \"$\\bar with \"$v$\" in the previous formula and consider that<\/p>\n

\"$n_{pass}^*<\/p>\n

In a rectangular city of size \"$L, the average travel length along the shortest path is \"$2\/3\\, therefore the transport load \"$P. From this, we conclude that for the \u00abUppercorners\u00bb network, the average equivalent number of passengers a bus carries is:<\/p>\n

\"$\\frac<\/p>\n

2.6 The Longest Travel Interval<\/h4>\n

We have established different bus intervals within different route corridors. This was done for the following reasons. Choosing a bus taxi, the traveler gets some allowed time surplus. In our model, this surplus is spent on waiting for the bus and the imperfection of the shared ride route. Within small-sized corridors, the intensity of travel is lower and, accordingly, the path of buses is \u00abstraighter\u00bb. Hence, with the same value of \"$, we can make the traveler wait for the bus longer, in other words \u2014 increase the interval between buses and thereby slightly increase their load. Since the interval \"$ is a variable value, let’s then determine its maximum value.<\/p>\n

According to formula \"$(7)$\"<\/p>\n

\"$<\/p>\n

where<\/p>\n

\"$<\/p>\n

Let’s make a substitution \"$, \"$, \"$:<\/p>\n

\"$<\/p>\n

Because:<\/p>\n

\"$<\/p>\n

and we found that<\/p>\n

\"$<\/p>\n

then<\/p>\n

\"$<\/p>\n

and<\/p>\n

\"$<\/p>\n

At the point of maximum, the differential \"$ must be equal to zero, this requirement gives us two equations:<\/p>\n

\"$<\/p>\n

\"$<\/p>\n

from where:<\/p>\n

\"$<\/p>\n

and<\/p>\n

\"$<\/p>\n

2.7 Numerical estimates for nearly real cities<\/h4>\n

Let’s write all our formulas together:<\/p>\n

\"$n_{pass}^*<\/p>\n

\"$\\Delta<\/p>\n

\"$\\Delta<\/p>\n

Let’s take our standard \"$\\lambda, and calculate what \"$n_{pass}^*$\", \"$\\Delta, and \"$\\Delta would be in real cities if they were cellular, square in shape, and implemented a uniform access migration model.<\/p>\n

\"$n_{pass}^*(\\lambda
\"$\\Delta
\"$\\Delta<\/p>\n

For an idealized square New York (London, Moscow):
effective diameter \"$L km,
permitted speed \"$v km\/min,
\"$\\sigma people\/min sq km,
\"$n_{pass}^* people,
\"$\\Delta km,
\"$\\Delta min.<\/p>\n

For an idealized square Berlin:
effective diameter \"$L km,
permitted speed \"$v km\/min,
\"$\\sigma people\/min sq km,
\"$n_{pass}^* people,
\"$\\Delta km,
\"$\\Delta min.<\/p>\n

For an idealized square Paris:
effective diameter \"$L km,
permitted speed \"$v km\/min,
\"$\\sigma people\/min sq km,
\"$n_{pass}^* people,
\"$\\Delta km,
\"$\\Delta min.<\/p>\n

For an idealized square Prague:
effective diameter \"$L km,
permitted speed v = 0.8 km\/min,
\"$\\sigma people\/min sq km,
\"$n_{pass}^* people,
\"$\\Delta km,
\"$\\Delta min.<\/p>\n

For an idealized standard square city of half a million people.
population \"$P people,
density \"$\\rho people\/sq km,
effective diameter \"$L km,
permitted speed \"$v km\/min,
\"$\\sigma people\/min sq km,
\"$n_{pass}^* people,
\"$\\Delta km,
\"$\\Delta min.<\/p>\n

Exercise:<\/b> Critique the solution just presented yourself.<\/p>\n

3 Bus Taxi with a Network of Corner Corridors of Adaptive Width<\/font>
<\/h3>\n

<\/p>\n

3.1 Another Possibility for Improvement<\/h4>\n

Now we are going to modify the \u201cUppercorners\u201d network so that the effective load of the buses circulating along it will be distributed a bit more evenly, and its average value will slightly increase. <\/p>\n

Let a bus circulate along the corner corridor \"$\\pi$\" of size \"$x. The effective load of this bus is proportional to the product of the areas of the vertical and horizontal segments of \"$\\pi$\" and is expressed by the formula:<\/p>\n

\"$n_{pass}, where \"$A<\/p>\n

This formula shows that if the movement interval \"$\\Delta in all corridors is made the same, then the smaller the corner corridor sizes \"$x$\" and \"$y$\", the lower the load will be on the buses circulating along it. In the last chapter, in order to somehow compensate for the decrease in the load of buses when \"$x$\" and \"$y$\" are reduced, we allowed the movement interval \"$\\Delta to be different in different corridors. Why not go further and allow the width of their vertical and horizontal segments to be different in different corridors. To do this, let’s allow the vertical and horizontal segment of the corner corridor to have a width of not one, but several cells at once. We will call such corner corridors \u201cgeneralized.\u201d<\/p>\n

The width of the horizontal segment of the generalized corridor \"$\\gamma$\", expressed in cells, we will denote as \"$\\Delta, and the vertical one \u2014 as \"$\\Delta. As before, we will assume that a horizontal and vertical street road passes through the center of each cell, and passengers are picked up and dropped off exclusively at intersections. The maximum load of a bus circulating along \"$\\gamma$\" will be expressed by the formula:<\/p>\n

\"$max_t,<\/p>\n

where the coefficient<\/p>\n

\"$A<\/p>\n

does not depend on \"$x$\" and \"$y$\".<\/p>\n

From \"$(39)$\" it can be seen that reducing \"$x$\" and \"$y$\" can be attempted to be compensated by increasing \"$\\Delta and \"$\\Delta.<\/p>\n

3.2 Analysis of Bus Taxi Operation within One Generalized Corridor<\/h4>\n

Just like in the previous scheme, if the bus starts its movement from the horizontal segment of corridor \"$\\gamma$\", almost all its passengers will get in at the cells of the horizontal segment, and get out at the cells of the vertical segment. As in the previous scheme, the function of the expected number of passengers in the bus cabin \"$n_{pass}(x,y,t)$\" over travel time will roughly have a triangular graph, with a maximum at the moment of passing the corner section. As a consequence, we have:<\/p>\n

1) The average number of passengers per trip follows the formula<\/p>\n

\"$n_{pass}(x,y)<\/p>\n

2) On average, a bus passenger will participate in about \"$n_{pass}(x,y)$\" stops on the horizontal and about \"$n_{pass}(x,y)$\" stops on the vertical segment \"$\\gamma$\".<\/p>\n

Each bus stop within \\gamma is associated with its preliminary lateral maneuver and causes additional travel distance. If the stop is made on the horizontal segment, the preliminary maneuver is bypassed by an excessive path of an average length of \"$\\Delta, and if on the vertical segment, then \u2014 \"$\\Delta. In the end, the bus will travel the horizontal segment \"$\\gamma$\" in about \"$(x\\Delta units of time, and the vertical segment in \"$(y\\Delta. From this we have that the average speed of the bus along the horizontal section \"$\\gamma$\" will be equal to:<\/p>\n

\"$\\bar<\/p>\n

and the average speed along the vertical:<\/p>\n

\"$\\bar<\/p>\n

In relation to travelers, it will be fair if the average speeds on both sections turn out to be the same. This last condition leads us to the equation:<\/p>\n

\"$\\frac<\/p>\n

From which in turn follows that:<\/p>\n

\"$n_{pass}(x,y)<\/p>\n

Let’s now calculate the time that a passenger spends on the road. If a person traveling along \"$\\gamma$\" chooses a bus taxi, then on average, taking into account the wait for the bus, his trip will take:<\/p>\n

\"$\\Delta<\/p>\n

units of time. The average trip inside \"$\\gamma$\" by personal car would have taken on average:<\/p>\n

\"$1\/2\\<\/p>\n

units of time. We demand that our bus taxi inside any \\gamma on average be no more than \"$(1 times slower than a car. Ultimately, this requirement leads to the equation:<\/p>\n

\"$1\/2\\<\/p>\n

Let \"$p,q$\" be arbitrary real numbers from the interval \"$[0, such that \"$p. We put<\/p>\n

\"$1\/2\\<\/p>\n

and<\/p>\n

\"$1\/3\\<\/p>\n

then:<\/p>\n

\"$\\Delta<\/p>\n

\"$\\frac<\/p>\n

Substituting into \"$(15)$\" \"$\\Delta and the expression for \"$n_{pass}(x,y)$\", we have:<\/p>\n

\"$\\frac<\/p>\n

from which:<\/p>\n

\"$\\Delta<\/p>\n

and<\/p>\n

\"$n_{pass}(x,y)<\/p>\n

Using \"$(16)$\" from \"$(18)$\" we get:<\/p>\n

\"$n_{pass}(x,y)<\/p>\n

and finally:<\/p>\n

\"$n_{pass}(x,y)<\/p>\n

3.3 Average adjusted number of passengers on the bus<\/h4>\n

Let’s follow the template of the previous chapter. While passing in one direction through the generalized corner corridor \"$\\gamma$\" with dimensions \"$x$\", \"$y$\", \"$\\Delta, \"$\\Delta, the bus covers an effective distance:<\/p>\n

\"$l_{ef}(x,y)<\/p>\n

Using \"$(19)$\", we get:<\/p>\n

\"$l_{ef}(x,y)<\/p>\n

Exercise: obtain \"$(22)$\" logically without calculations.<\/p>\n

Knowing the effective route length and the time interval between buses, we can calculate how many such buses are assigned to \"$\\gamma$\"<\/p>\n

\"$N_{bus}(x,y)<\/p>\n

To find the number of buses \"$N_{bus}$\" in the entire city, we’ll use a trick: we’ll mentally replace each generalized corner corridor \"$\\gamma$\" with \"$\\Delta simple corner cell paths lying within it. <\/p>\n

\"image\"<\/div>\n

Fig 4<\/i><\/p>\n

For each such path, we will have:<\/p>\n

\"$<\/p>\n

buses, out of those assigned to \"$\\gamma$\". Substituting into \"$(24)$\" the expression for \"$\\Delta and \"$N_{bus}(x,y)$\", we get:<\/p>\n

\"$N_{bus}^*(x,y)<\/p>\n

or after simplifications:<\/p>\n

\"$N_{bus}^*(x,y)<\/p>\n

The total number of buses in the city can now be found as:<\/p>\n

\"$N_{bus}<\/p>\n

To calculate the integral in the last expression, we’ll make a substitution \"$\\alpha, \"$\\beta and take into account that \"$N:<\/p>\n

\"$\\int_{1}^{N}<\/p>\n

The online calculator of double integrals gives an answer \"$\\approx. If we don’t optimize too much and take \"$p=1\/3$\" and \"$q, then:<\/p>\n

\"$N_{bus}<\/p>\n

The transport load \"$P$\", which the city generates, as we know, is equal to \"$2\/3, therefore the adjusted average bus load is:<\/p>\n

\"$n_{pass}^*<\/p>\n

3.4 Numerical estimates for almost real cities<\/h4>\n

Let’s take \"$\\lambda again, then <\/p>\n

\"$n_{pass}^*(\\lambda<\/p>\n

The maximum interval between buses will be inside the two largest corridors with x = y = N:<\/p>\n

\"$max_{x,y}\\Delta<\/p>\n

The width of the horizontal and vertical segments of generalized corridors depends on \"$x$\", \"$y$\" and does not depend on \"$\\lambda$\" at all. To get an idea of it, we will calculate it at values \"$x, then<\/p>\n

\"$\\Delta<\/p>\n

Hypothetical Square New York (London, Moscow):
Effective diameter \"$L km,
Allowed speed \"$v km\/min
\"$\\sigma people\/min sq km
\"$n_{pass}^* people (\"$21.2$\" at peak).
\"$\\Delta km
\"$\\Delta min (on average \"$\\sim min).<\/p>\n

Hypothetical Square Berlin:
Effective diameter \"$L km,
Allowed speed \"$v km\/min
\"$\\sigma people\/min sq km
\"$n_{pass}^* people (\"$16.8$\" at peak).
\"$\\Delta km
\"$\\Delta min (on average \"$\\sim min).<\/p>\n

Hypothetical Square Paris:
Effective diameter \"$L km,
Allowed speed \"$v km\/min
\"$\\sigma people\/min sq km
\"$n_{pass}^* people (\"$11.4$\" at peak).
\"$\\Delta km
\"$\\Delta min (on average \"$\\sim min).<\/p>\n

Hypothetical Square Prague:
Effective diameter \"$L km,
Allowed speed \"$v km\/min
\"$\\sigma people\/min sq km
\"$n_{pass}^* people (\"$11$\" at peak).
\"$\\Delta km
\"$\\Delta min (on average \"$\\sim min).<\/p>\n

Hypothetical standard square city of half a million population.
Population \"$P people,
Density \"$\\rho people\/sq km,
Effective diameter \"$L km,
Allowed speed \"$v km\/min
\"$\\sigma people\/min sq km
\"$n_{pass}^* people (\"$5.6$\" at peak).
\"$\\Delta km
\"$\\Delta min (on average \"$\\sim min).<\/p>\n

Exercise:<\/b> the reasoning in this chapter implicitly assumes that the generalized corner corridors of adaptive width can \u00abcover\u00bb all \u00absimple\u00bb corner corridors from \"$\u201cUppercorners\u201d$\" without overlaps. Find out whether there is actually a network of \u201cAdaptivecorners\u201d corner corridors of adaptive width that:<\/p>\n

1) the dependence of \"$\\Delta and \"$\\Delta on \"$x$\", \"$y$\" is described by formula \"$(17)$\" and \"$(7)$\"
2) each simple corner route from \"$\u201cUppercorners\u201d$\" as an area on the map lies within a single generalized corner route from \"$\u201cAdaptivecorners\u201d$\".<\/p>\n

If for some reason there is no \u201cAdaptivecorners\u201d network with the specified properties, think about how much and how you need to weaken requirements 1) and 2) to get a good enough equivalent?<\/p>\n

4 Closer to Reality<\/font><\/h3>\n

<\/p>\n

4.1 Violation of Application Boundaries and the Need for Model Refinement<\/h4>\n

Until this point in all the joint taxi models we’ve built, we have assumed that the time costs associated with the imperfection of the route and waiting for a suitable car will be much greater than the time costs of acceleration\/deceleration near stops and loading\/unloading passengers at them. Are these assumptions justified? In fact, no!<\/p>\n

Let’s take our latest model with the \u201cAdaptivecorners\u201d network and analyze its results for a hypothetical Berlin. The model predicts that at \"$\\lambda, the average number of passengers in the taxi bus will be approximately \"$8.5$\". Since the graph of the expected number of passengers inside the bus has a triangular shape, \u201c\"$\\sim on average\u201d means \"$\\sim at maximum (at the corner point of the corridor). If so, on average the bus will make \"$\\sim stops to pick up passengers and another \"$\\sim to drop them off: a total of \"$\\sim stops. Since our hypothetical cell-based Berlin has the form of a square with side \"$L km, the average journey length in it is \"$2\/3\\ km. In this \u201caverage\u201d journey, our bus passenger will participate in about half, that is, about \"$17$\" stops, thus one taxi bus stop falls on \"$20\/17 kilometers of its path. Now let’s remember (paragraph 3.2 part 1) that even for a transit bus, which travels only in a straight line and does not turn anywhere, in order not to be slower than a car more than \"$1 times, it needs to make stops no more often than one on \"$\\approx km.<\/p>\n

It turns out that we neglected perhaps the main thing. Let’s correct our calculations.<\/p>\n

4.2 Back-of-the-Envelope Calculations<\/h4>\n

Due to their complexity, we won’t conduct exact calculations here and will satisfy ourselves with almost exact estimates. Let’s start by trying to get these estimates for our hypothetical Berlin, once we manage that, we can generalize them to all model cities.<\/p>\n

The average journey that a traveler would have had to overcome if he used a private car is \"$2\/3\\ km. The average duration of travel by car would have been \"$2\/3\\ minutes. In the calculations of the previous chapter, we assumed that the average journey by taxi bus will be approximately \"$(1 times longer than the average journey by private car, therefore \"$(2\\lambda minutes is what a taxi bus passenger can spend on waiting for the bus and overcoming the excess length of the imperfect route. With an average load of \"$ people, a passenger on average becomes a participant in about \"$17$\" bus stops, so his time losses without considering the duration of stops and the bus slowing down at acceleration\/deceleration sections are approximately<\/p>\n

\"$T_{exra} min\/stop<\/p>\n

Each stop requires two acceleration\/deceleration sections: in the vicinity of the turn to the stop and in the vicinity of the stop itself, this leads to a delay of about \"$34$\" seconds (paragraph 3.2 part 1). For each stop, approximately \"$1$\" person boards or exits the bus, we will generously give them \"$8$\" seconds for this (research shows that for a simple city bus this time is about \"$\\sim seconds). It turns out that the previously unaccounted time losses amount to approximately \"$T_{stop} seconds = \"$0.7$\" min, which means that instead of \"$\\lambda we will actually be dealing with \"$\\lambda. There is a simple way to get \"$\\lambda$\" back in place.<\/p>\n

Let’s note the following:<\/p>\n

1) the loss of time waiting for the bus is proportional to their motion interval \"$\\Delta;
2) the average adjusted number of passengers inside the cabin \"$n_{pass}^*$\" is also proportional to \"$\\Delta;
3) the average time losses of a passenger from each stop consist of \"$T_{stop}$\" and the time of the bus moving sideways, which together are constant. The latter means that the total time losses of a bus taxi passenger from the stops experienced by them will be proportional to the number of the latter, therefore proportional to \"$n_{pass}^*$\", therefore proportional to \"$\\Delta.
4) it turns out that not only \"$T_{stop}$\" but also \"$T_{exra}$\" is a constant (does not depend on \"$\\Delta)<\/p>\n

The above statements show that the excess time taken by a bus taxi ride compared to a personal car ride is proportional to the bus motion interval \"$\\Delta. To make \"$\\lambda$\" equal to \"$1\/2$\" again, we change the interval \"$\\Delta in all route corridors to<\/p>\n

\"$\\eta<\/p>\n

times. The adjusted number of passengers \"$n_{pass}^*$\" will also be multiplied by \"$\\eta$\" and will become equal to<\/p>\n

\"$n_{pass}^{true}<\/p>\n

passengers for the conditional Berlin. This result is much worse than what we had in the previous chapter, but there is one<\/p>\n

4.3 Rabbit out of the hat: a pedestrian path section<\/h4>\n

Since we have decided to bring the model closer to reality, we must take into account that the journey on public transport has two pedestrian paths inside the quarters (fig). The average time the traveler spends overcoming them, we denote as \"$T_{ped}$\". The way to the parking place of the personal car and very slow driving inside the quarter also take time, for simplicity we will consider that it is also equal to \"$T_{ped}$\".<\/p>\n

\"image\"<\/div>\n

Fig 5<\/i><\/p>\n

The total length of pedestrian paths at the beginning and end of the journey is on average equal to the length of a city block. With a block length of \"$0.5$\" km and an average pedestrian speed of \"$5$\" km\/h, the value of \"$T_{ped}$\" equals \"$0.1$\" hours, which is \"$6$\" minutes.<\/p>\n

With an adjustment for the pedestrian path, the average journey on a bus taxi will be allowed to exceed the travel time in a personal car by a time equal to:<\/p>\n

\"$\\lambda<\/p>\n

If \"$n_{pass}^{true}$\" is the average number of passengers on the bus, then the average journey will be associated with \"$2 stops, at each of which the traveler will lose an average of \"$(T_{stop} units of time. These considerations lead us to the balance equation:<\/p>\n

\"$2<\/p>\n

from which<\/p>\n

\"$n_{pass}^{true}<\/p>\n

and<\/p>\n

\"$\\eta<\/p>\n

Accordingly for Berlin:<\/p>\n

\"$ people<\/p>\n

\"$\\eta<\/p>\n

As you can see, we have an \u00abextra passenger\u00bb. Below are the recalculated results for all the model cities we used earlier.<\/p>\n

Conditional square New York (London, Moscow):
effective diameter \"$L km,
permissible speed \"$v km\/min
\"$n_{pass}^*\\approx people.
\"$T_{extra} min
\"$n_{pass}^{true} people (peak \"$\\sim)
\"$\\Delta min.<\/p>\n

Conditional square Berlin:
effective diameter \"$L km,
permissible speed \"$v km\/min
\"$n_{pass}^* people.
\"$T_{extra} min
\"$n_{pass}^{true} people (peak \"$\\sim)
\"$\\Delta min.<\/p>\n

Conditional square Paris:
effective diameter \"$L km,
permissible speed \"$v km\/min
\"$n_{pass}^* people.
\"$T_{extra} min
\"$n_{pass}^{true} people (peak \"$\\sim)
\"$\\Delta min.<\/p>\n

Conditional square Prague:
effective diameter \"$L km,
permissible speed \"$v km\/min
\"$n_{pass}^* people.
\"$T_{extra} min
\"$n_{pass}^{true} people (peak \"$\\sim)
\"$\\Delta min<\/p>\n

Conditional standard square half-million city.
population \"$P people,
density \"$\\rho people\/sq km,
effective diameter \"$L km,
permissible speed \"$v km\/min
\"$\\sigma people\/min sq km
\"$n_{pass}^* people.
\"$T_{extra} min
\"$n_{pass}^{true} people (peak \"$\\sim)
\"$\\Delta min<\/p>\n

As you can see, the true number of passengers is not a gold mine, but it’s something. Can we improve the result? Let it remain our little intrigue (?)<\/a>.<\/p>\n

5 For you<\/font>
<\/h3>\n

To the little Sleeping Dragon,
The young Igniter of Hearts (?)<\/a>,
I was lucky to see your charm \u2014 They are beautiful.
I will miss them (?)<\/a>.
.
.
.
.
Sergey Kovalenko
magnolia@bk.ru
(It was a wonderful)
spring of 2023.<\/p>\n

Link to Part 1: \u00abPreliminary Analysis\u00bb (\u0440\u0443 <\/a>\/ eng <\/a>)
Link to Part 2: \u00abExperiments on a Torus\u00bb (\u0440\u0443 <\/a>\/ eng<\/a> )
Link to Part 3: \u00abPractically Significant Solutions\u00bb (\u0440\u0443 <\/a>\/ eng <\/a>)
Link to \u00abSummary\u00bb (\u0440\u0443<\/a> \/ eng <\/a>)<\/div>\n<\/div>\n<\/div>\n

<\/div>\n


\u0441\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u043e\u0440\u0438\u0433\u0438\u043d\u0430\u043b \u0441\u0442\u0430\u0442\u044c\u0438 https:\/\/habr.com\/ru\/articles\/740162\/<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

<\/div>\n
\n
\n
\n
<\/p>\n

Translation provided by ChatGPT, link to the original article in Russian<\/a><\/p>\n

Link to Part 1: \u00abPreliminary Analysis\u00bb (\u0440\u0443 <\/a>\/ eng <\/a>)
Link to Part 2: \u00abExperiments on a Torus\u00bb (\u0440\u0443 <\/a>\/ eng<\/a> )
Link to Part 3: \u00abPractically Significant Solutions\u00bb (\u0440\u0443 <\/a>\/ eng <\/a>)
Link to \u00abSummary\u00bb (\u0440\u0443<\/a> \/ eng <\/a>)<\/p>\n

1 Playing Diplomacy<\/font>
<\/h3>\n

<\/p>\n

1.1 What this work is about<\/h4>\n

You’re reading the third and final article in a series dedicated to minibus route schemes that would allow you to travel reasonably quickly, inexpensively, and most importantly, without any transfers, from any intersection to any other within a large city. You’ll see many graphs, formulas, and figures below, but before we get to the technical part, I’d like to discuss the challenge of implementing this idea and invite you to participate in solving it.<\/p>\n

1.2 A puzzle for the talented and brave (Eccentrics are welcome: ?<\/a>) <\/h4>\n

I propose an adventure,
I propose a game,
I propose that you become part of a positive change in the lifestyle of almost a billion people around the planet,
I can’t do this alone.
To start, I need your help with the following: <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-408781","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts\/408781","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=408781"}],"version-history":[{"count":0,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts\/408781\/revisions"}],"wp:attachment":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=408781"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=408781"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=408781"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}