 Cooperative maximum-flow problem under uncertainty in logistic networksAshkan Hafezalkotob and Ahmad Makui Applied Mathematics and Computation, 2015, vol. 250, issue C, 593-604 Abstract: Many decision-making problems in the context of transhipment and logistics, distribution networks, airline planning and so on, can best be analyzed by the means of maximum-flow models in networks. In a multiple-owner network, several players possess arcs and nodes of a network. Since parameters of the network in many real problems are highly uncertain, maintaining a stable flow is as much important as maximizing the flow passing through the network. Thus, a key question is how the independent owners of a network should collaborate to maintain a reliable maximum flow. We address this question by presenting a stochastic mathematical programming model for the multiple-owner graph problem under uncertainty. Afterwards, a number of collaboration methods are studied based on the game theory. These methods are illustrated with an example to gain an insight into properties of the corresponding game results and behavior of the different solution concepts. Keywords: Maximum-flow problem; Multiple-owners graph; Logistics; Robust optimization; Reliability and stability (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:250:y:2015:i:c:p:593-604 DOI: 10.1016/j.amc.2014.10.080 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.