Computing Path Bundles in Bipartite Networks

Victor Parque, Satoshi Miura, Tomoyuki Miyashita

2017

Abstract

Path bundling, a class of path planning problem, consists of compounding multiple routes to minimize a global distance metric. Naturally, a tree-like structure is obtained as a result wherein roots play the role of coordinating the joint transport of information, goods, and people. In this paper we tackle the path bundling problem in bipartite networks by using gradient-free optimization and a convex representation. Then, by using 7,500 computational experiments in diverse scenarios with and without obstacles, implying 7.5 billion shortest path computations, show the feasibility and efficiency of the mesh adaptive search.

Download


Paper Citation


in Harvard Style

Parque V., Miyashita T. and Miura S. (2017). Computing Path Bundles in Bipartite Networks . In Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH, ISBN 978-989-758-265-3, pages 422-427. DOI: 10.5220/0006480604220427


in Bibtex Style

@conference{simultech17,
author={Victor Parque and Tomoyuki Miyashita and Satoshi Miura},
title={Computing Path Bundles in Bipartite Networks},
booktitle={Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,},
year={2017},
pages={422-427},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006480604220427},
isbn={978-989-758-265-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,
TI - Computing Path Bundles in Bipartite Networks
SN - 978-989-758-265-3
AU - Parque V.
AU - Miyashita T.
AU - Miura S.
PY - 2017
SP - 422
EP - 427
DO - 10.5220/0006480604220427