<< firingorderbig Min-Max-Plus And Petrinet intersection >>

Min-Max-Plus And Petrinet >> Min-Max-Plus And Petrinet > generalscheduling

generalscheduling

Max-plus algebra eigenvalue, eigenvector, modelling and scheduling

Calling Sequence

generalscheduling

Description

We derive an algorithm of public transportation scheduling by using max-plus algebra. Input of this algorithm are a strongly connected graph as a route of public transportation and the number of public vehicle in each path between two stations. This algorithm can be implemented to any public transportation with strongly connected road network. This function implemented this algorithm. This function need input a file excel include strongly connected graph as a route of public transportation and travelling time, the number of public vehicle and station name. For example input, you can see file general.xl in modules folder sheet 1, 2 and 3. Sheet 1, 2 and 3 include strongly connected graph as a route of public transportation and travelling time, the number of public vehicle and station name.

More details, you can see at Subiono and Kistosil Fahim (2015); "Generalization Public Transportation Scheduling Using Max-Plus Algebra", Proceeding of The 5th Annual Basic Science International Conference.

Examples

generalscheduling

Author

"Max-Plus Algebra And Petrinet Toolbox", ver. 1.1.0, February, 2013.

See Also


Report an issue
<< firingorderbig Min-Max-Plus And Petrinet intersection >>