ALGORITHM FINDING MAXIMUM CONCURRENT MULTICOMMODITY LINEAR FLOW WITH LIMITED COST IN EXTENDED TRAFFIC NETWORK WITH SINGLE REGULATING COEFFICIENT ON TWO-SIDE LINES

 Tran Quoc Chien and Nguyen Dinh Lau 

The University of Education, University of Danang, Danang, Vietnam 

ABSTRACT 

Graphs and extended networks are is powerful mathematical tools applied in many fields as transportation, communication, informatics, economy, … Algorithms to find Maximum Concurrent Multicommodity Flow with Limited Cost on extended traffic networks are introduced in the works we did. However, with those algorithms, capacities of two-sided lines are shared fully for two directions. This work studies the more general and practical case, where flows are limited to use two-sided lines with a single parameter called regulating coefficient. The algorithm is presented in the programming language Java. The algorithm is coded in programming language Java with extended network database in database management system MySQL and offers exact results.

KEYWORDS 

Graph, Network, Multicommodity Flow, Optimization, Approximation. 

More Details.....