Heuristic optimal transport in branching networks

M. Andrecut ()
Additional contact information
M. Andrecut: Unlimited Analytics Inc., Calgary, Alberta, Canada

International Journal of Modern Physics C (IJMPC), 2024, vol. 35, issue 09, 1-11

Abstract: Optimal transport aims to learn a mapping of sources to targets by minimizing the cost, which is typically defined as a function of distance. The solution to this problem consists of straight line segments optimally connecting sources to targets, and it does not exhibit branching. These optimal solutions are in stark contrast with both natural, and man-made transportation networks, where branching structures are prevalent. Here, we discuss a fast heuristic branching method for optimal transport in networks. We also provide several numerical applications to synthetic examples, a simplified cardiovascular network, and the “Santa Claus†distribution network which includes 141182 cities around the world, with known location and population.

Keywords: Numerical optimization; transportation (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183124501201
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:35:y:2024:i:09:n:s0129183124501201

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183124501201

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().