In this study, three analytical models for different schedule coordination policies are developed based on the predetermined logistic networks, given origin-destination information for a specific time period, and some suggested values for certain parameters, in order to minimize the total system costs. Based on problem’s characteristics, it is modeled as nonlinear programming (NLP) and mixed-integer nonlinear programming (MINLP) problems within the studied networks. To deal with the stochastic vehicle arrivals and uncertain route travel times, slacks are built into the operating schedules.