Maximum Multicommodity Flow Problem with Global Fair Met Rate
CHENG Congdian1, LI Zhenpeng2
1. College of Mathematics and Systems Science, Shenyang Normal University, Shenyang 110034;2. Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190
The present work studies a maximum multicommodity flow problem with global fair met rate, which not only enriches the content of the maximum multicommodity flow problem, but also can be used to study the optimization decisions of some practical problems, such as the operations of logistics distribution stemming out of transportation. The major contributions are as follows: (A) Propose the problem and prove its solutions exists. (B) Design a pseudopolynomial approximation algorithm to solve the problem. (C) Propose and prove an approximation measure of the designed algorithm. (D) Finally, computational experiments with two instances are conducted using the algorithm.