Main Article Content
Effective planning of a transportation network influences tactical and operational activities and has a great impact onbusiness. Planning typically considers multiple aspects such as variable transportation costs, various levels ofcustomer service offered, security of goods, and traveling time. These aspects often vary with time. Although theminimum cost flow problem is a widely seen approach to configure a transportation network, there is no much workconsidering variations on arcs; even more, the problem with varying nodes has hardly been addressed. In this work isdeveloped a mathematical model for the multi-objective minimum cost flow problem, applied in networks with varyingattributes on arcs. The model finds the set of non-dominated solutions for a multi-objective stochastic network havingvariations in attributes of its arcs and nodes, such as cost or transportation time. A modified version of the two-stagemethod was used to address the stochastic nature of the problem combined with the epsilon-constraint method, whichis used for building the set of non-dominated solutions.
This paper presents the main features of the model, the theoretical bases and a computational implementation.Experiments were applied in a transport network for the exportation market of ornamental flowers as perishable goodsfrom Mexico to the United States, which considered variations in border crossing times.