AllRounder.ai
Chapters in this course

Enrol to start learning

Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.

Enrol free

9.8. Problems

Interactive Audio Lesson

Session 1: Understanding the Problem Statement

Unlock the classroom podcast

The transcript is free to read. A free account plays the conversation back.

Sarah
SarahInstructor

Today we're going to dive into a practical problem that revolves around modal split. Can anyone explain what a modal split is?

Noah
Noah

It's how we distribute trips between different modes of transportation, like cars, buses, and trains!

Sarah
SarahInstructor

Exactly, Student_1! Now, let’s look at a specific scenario where we have 4200 trips from zone i to zone j, all currently done by car. The government wants to introduce either a bus or a train. Why do you think that's important?

Isabella
Isabella

Because it helps reduce congestion and may offer cheaper or more efficient travel options!

Sarah
SarahInstructor

Correct! We will use the binary logit model to see which alternative can carry more trips.

Sarah
SarahInstructor

Let's summarize what we need to do: Calculate the costs first, right?

Akash
Akash

Right! The cost of each travel mode will help us determine the probabilities.

Sarah
SarahInstructor

Great! Let's move on to calculating those costs.

Session 2: Cost Calculations

Unlock the classroom podcast

The transcript is free to read. A free account plays the conversation back.

Robert
RobertInstructor

The cost formula we need is: c = a_tv + a_tw + a_tt + a_F + a_φ + δ. Can anyone help calculate the cost of travel by car?

Ananya
Ananya

Sure! For car: c = 0.05 * 25 + 0.04 * 22 + 0.2 * 6.

Robert
RobertInstructor

Good start! Remember to sum all those products to find the total cost.

Ananya
Ananya

Calculating gives us 6.85 as the total cost for the car.

Robert
RobertInstructor

Excellent work! Now, can someone calculate the bus cost?

Noah
Noah

Sure! For the bus: c = 0.05 * 35 + 0.04 * 8 + 0.07 * 6 + 0.2 * 8, which gives us 4.09.

Robert
RobertInstructor

Fantastic! Finally, let’s calculate the train's cost.

Isabella
Isabella

For the train, I found 2.96 using the same formula.

Robert
RobertInstructor

Exactly! Now we can use these costs to find the probabilities. Let's do that next.

Session 3: Calculating Probabilities

Unlock the classroom podcast

The transcript is free to read. A free account plays the conversation back.

Sarah
SarahInstructor

Now that we have our costs, how do we compute the probability of choosing each mode?

Akash
Akash

We can use the formula p_car = e^(-c_car) / (e^(-c_car) + e^(-c_bus))!

Sarah
SarahInstructor

Exactly, Student_3! Let's substitute our values into the formula. What do we get for the car?

Ananya
Ananya

Substituting the number, I calculate the probability for the car as approximately 0.059.

Sarah
SarahInstructor

Exactly right! And how about the bus?

Noah
Noah

For the bus, it's about 0.9403!

Sarah
SarahInstructor

Excellent teamwork! Now for the train's probability, what do we find?

Isabella
Isabella

I calculated it to be 0.979.

Sarah
SarahInstructor

Great work! Now we can determine how many trips each mode can carry. Who wants to do that?

Session 4: Determining Trips Carrying Capacity

Unlock the classroom podcast

The transcript is free to read. A free account plays the conversation back.

Robert
RobertInstructor

Okay, let’s calculate the trips for each mode based on our probabilities. Starting with the bus?

Akash
Akash

Using T_bus = 4200 * 0.9403, I calculate approximately 3949 trips!

Robert
RobertInstructor

Excellent! And for the train then?

Isabella
Isabella

For the train, using T_train = 4200 * 0.979, that's roughly 4115 trips.

Robert
RobertInstructor

Great job! Which transport mode would carry the most trips if introduced?

Ananya
Ananya

The train would attract more trips!

Robert
RobertInstructor

Exactly, Student_4! This summary helps us understand the effectiveness of modal choice in transportation planning.