About Matematical Optimicing of transport time and range

OpenTTD is a fully open-sourced reimplementation of TTD, written in C++, boasting improved gameplay and many new features.

Moderator: OpenTTD Developers

Post Reply
Ninetails
Engineer
Engineer
Posts: 2
Joined: 27 Aug 2008 13:47
Location: Denmark

About Matematical Optimicing of transport time and range

Post by Ninetails »

(Updated: Look for my next post for the completion of the project)

Hello all out there.

I am not sure wether or not there is a need for this, and where i should post it, but i plan to matematical calculate the time traveled (with the asumption, that the time traveld is used to cover a distance on the way to a station), and by multiplying that with trainmovement, also get the optimal range, that specific good should be transported at. Currently I have worked out the formulas, and just need to construkt a matrix cabebly of handling all the data and calculations easely, and then post it to the masses. The current formulas include a constant: c, that despricipes the amount of time in days, that the train uses on not covering distance to the next station (as in not moving at maksimal speed, navigating "indirret paths" -- paths not moving a tile closer to the destination, and so on). It would help, if anybody would come with good sugeustions to that constant (c).
Last edited by Ninetails on 27 Aug 2008 18:51, edited 1 time in total.
User avatar
planetmaker
OpenTTD Developer
OpenTTD Developer
Posts: 9432
Joined: 07 Nov 2007 22:44
Location: Sol d

Re: About Matematical Optimicing of transport time and range

Post by planetmaker »

Hi,
Ninetails wrote:I am not sure wether or not there is a need for this, and where i should post it, but i plan to matematical calculate the time traveled (...), and by multiplying that with trainmovement, also get the optimal range, that specific good should be transported at. (...)
a constant: c, that despricipes the amount of time in days, that the train uses on not covering distance to the next station, (...) not moving a tile closer to the destination, and so on
I guess you ask a question which simply cannot be answered. The time a train needs between any two stations A and B heavily depends upon
- the track layout
- the signaling on the tracks
- the traffic density (jams?...)

So the answer could be something between "as quickly as the train allows to travel when alone on a straight track" to "never". This 'constant C' may even differ much between two routes, say from A to B and A to D.

For your purpose leave it an arbitrary constant and have your result for a range of C.
Ninetails
Engineer
Engineer
Posts: 2
Joined: 27 Aug 2008 13:47
Location: Denmark

Re: About Matematical Optimicing of transport time and range

Post by Ninetails »

I have now completed the project, and here are the prime results (with a c constant of 1day -- time to accelerate to full speed=perfect conditions):
-- -- -- -- -- -- -- -- -- -- --
_____________Optimized transport time:_____Range
General (Topical toop)__(In Days)______(in for every 100km/h)
Passengers_________89,8 Days____________503
Valuables__________92,1 Days____________515
Livestock __________89,3 Days____________500
Grain ______________94,8 Days____________531
Goods_____________92,1 Days____________515
Coal______________170,7 Days___________955
Steel _____________170,7 Days___________955
Iron Ore___________171,7 Days___________961
Wood_____________ 174,7 Days___________978
Oil________________179,7 Days__________1006
Mail_______________111,3 Days___________623
Arctic specifik
Wheat______________94,8 Days___________531
Paper_____________100,6 Days____________563
Gold_______________96,3 Days____________539
Food_______________91,3 Days____________511
Tropical specifik
Robber ____________89,3 Days____________500
Food ______________87,6 Days____________490
Maize______________94,8 Days____________531
Tropical Wood_______174,7 Days___________978
Copper Ore_________173,2 Days___________969
Water_____________108,8 Days____________609
Diamonds__________172,2 Days____________964
Toyland specifik
Sugar_____________177,2 Days____________992
Toys______________179,7 Days___________1006
Batteries___________ 91,8 Days____________514
Candy_____________ 95,8 Days____________536
Toffee_____________102,3 Days____________573
Cola______________103,8 Days____________581
Cotton Candy_______92,6 Days_____________518
Boubbles___________108,8 Days____________609
Plastic_____________182,2 Days___________1020
Fuzzy Drinks________103,8 Days____________581

(Edited: table above changed to a more forum friendly setting)
_________________________________________________________
For thouse of you that want all the results and, want to play around with constants like c (time wasted), and see the full block of Results, including cargo values (the amount of money you get pr speed, when using the optimized time), precalculated speed ranges and so on, can get the Excel ark that i made these results from, just below (if I can get it to work...)
Attachments
OTTD, transport optimacation.xls
This is the Excel ark(s) where the calculations come from.
(58.5 KiB) Downloaded 128 times
Eddi
Tycoon
Tycoon
Posts: 8289
Joined: 17 Jan 2007 00:14

Re: About Matematical Optimicing of transport time and range

Post by Eddi »

use the

Code: Select all

 tags to align columns, it will use a fixed width font then
Post Reply

Return to “General OpenTTD”

Who is online

Users browsing this forum: Amazon [Bot] and 12 guests