Highway Passenger Transport Based Express Parcel Service Network Design: Model and Algorithm

Pseudocode 2

Pseudocode for service path selection.

Select Service Path

for all ( in O-D set) do

use Warshall-Floyd algorithm to calculate shortest distance (load distance) D, and shortest path;

if (time of shortest operating path > service level ) then

modify service level, reconstruct the service network;

else

store shortest distance in and shortest path ;

for all (services in shortest route ) do

delete one service in shortest path , recalculate shortest distance and shortest path,

choose the shortest one as second-shortest distance and second-shortest path ;

if (time of shortest operating path > service level ) then

break;

else

store second short distance and second short path;

for all (leg in shortest path ) do

delete one leg in second short path , recalculate shortest distance and shortest path,

choose the shortest one as third-shortest distance and third short path ;

…

end-do

end-if

end-do

end-if

Select one service path in several shortest paths and obtain distance of selected service path of O-D pair ;

end-do