基于看不见的手的多商品网络流模型
The Invisible Hand Heuristic for Origin-Destination Integer Multicommodity Network Flows
摘要：
与经典的多商品流模型不同，多商品流模型中的每种商品都有一个源和一个汇，而且每种商品都必须沿着一条路径进行路由.本文提出了一种新的模拟经济市场行为的“看不见的手”启发式算法，并在大规模电信网络上进行了测试，其求解时间比Cplex的LP松弛算法快两个数量级，MIP比率更大，和小的溶液值差异。
英文摘要：
Origin-destination integer multicommodity flow problems differ from classic multicommodity models in that each commodity has one source and one sink, and each commodity must be routed along a single path. A new invisible-hand heuristic that mimics economic markets' behavior is presented and tested on large-scale telecommunications networks, with solution times two orders of magnitude faster than Cplex's LP relaxation, more dramatic MIP ratios, and small solution value differences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
