Discrete-event based vehicle dispatching and scheduling in multicommodity transportations

This work presents a time-weighted finite state automaton modeling formalism for an alternative formulation of multi-commodity flow network problem with some "discrete event features". We introduce a procedure to translate the "multi-commodity flow problem" into a minimum makespan controllable sublangauge synthesis problem in supervisory control theory and use an existing algorithm that computes a finite makespan controllable sublanguage as an approximated algorithm. A simple case study is used to illustrate the application of our model translation procedure.