summaryrefslogtreecommitdiff
path: root/src/3rdparty/squirrel/sqstdlib
diff options
context:
space:
mode:
authorJonathan G Rennison <j.g.rennison@gmail.com>2020-01-14 03:11:57 +0000
committerMichael Lutz <michi@icosahedron.de>2020-01-28 23:37:16 +0100
commit2fee030a26996a167adbf28f96fca8c4fd749005 (patch)
treeb3a1720f252aae0b699597d6b4ea4c6b75a8b4f4 /src/3rdparty/squirrel/sqstdlib
parenta38122e6f21374440f5d644b5d54b94ebfac4300 (diff)
downloadopenttd-2fee030a26996a167adbf28f96fca8c4fd749005.tar.xz
Change: Algorithm for transfer feeder payments
The original algorithm pays intermediate legs in feeder systems based on the start and end stations of that particular leg. This tends to result in large negative payments on the final leg for journeys with many feeder legs, as the overall feeder payment increases with the number of legs, and the final leg is penalised for discrepancies between the previous leg payments and the actual payment for delivery from the source to the destination. The feeder share setting is a partial mitigation, however it is difficult to tune as a suitable value depends on the number of legs and the network topology, which are often not the same for all vehicles. The new incremental algorithm pays the cargo payment from the source station to the end station of the current leg, minus any previous transfer feeder payments for each leg. This prevents unbounded increase of feeder payments and therefore avoids the issue of excessive negative payments on the final leg. Feeder payments may be negative, e.g. in the case of poorly performing or highly indirect legs. This is better than penalising the final leg. This mode reduces the need to tune the feeder shares setting to the current network. The feeder share setting applies in the existing way.
Diffstat (limited to 'src/3rdparty/squirrel/sqstdlib')
0 files changed, 0 insertions, 0 deletions