Research Article
Highway Passenger Transport Based Express Parcel Service Network Design: Model and Algorithm
Pseudocode 3
Pseudocode for network flow distribution.
Network Flow Distribution | for all ( in O-D set) do | decompose selected service path into service(s); | if (service path contains single service) then | service design decision ; | else | set all the service design decisions for the services included in the path as 1. | end-if | end-do | for all () do | for all (paths of OD through this service) do | if (the path service frequency of the OD > ) then | = the path service frequency of the OD; | else | unchanged; | end-if; | assigned flow () = the sum of the demand on the path of OD through this service; | end-do | based on flow () = flow divided by the capacity for service , , rounded up; | if ( based on flow ) then | replace by ; | else | unchanged; | end-if | if () then | change selected service path or make equal to , and distribute exceeding flow to other service path, | record the distance of new service path as exceeding flow; | else | calculate service capacities of each service, service capacities = service frequency × coach capacity for service , ; | end-if | end-do |
|