The Invisible Hand Heuristic for Origin-Destination Integer Multicommodity Network Flows
Data Structures and Algorithms
2020-07-15 v1 Discrete Mathematics
Combinatorics
Optimization and Control
Abstract
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.
Cite
@article{arxiv.2007.06693,
title = {The Invisible Hand Heuristic for Origin-Destination Integer Multicommodity Network Flows},
author = {Richard S. Barr and Thomas McLoud},
journal= {arXiv preprint arXiv:2007.06693},
year = {2020}
}
Comments
29 pages, 4 figures