loading
Papers

Research.Publish.Connect.

Paper

Authors: Victor Parque 1 ; Satoshi Miura 2 and Tomoyuki Miyashita 2

Affiliations: 1 Waseda University and Egypt-Japan University of Science and Technology, Japan ; 2 Waseda University, Japan

ISBN: 978-989-758-265-3

Keyword(s): Path Bundling, Optimization, Bipartite Networks.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Non-Linear Systems ; Planning and Scheduling ; Simulation and Modeling ; Symbolic Systems

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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.92.92.168

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Parque, V.; Miura, S. and Miyashita, T. (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

@conference{simultech17,
author={Victor Parque. and Satoshi Miura. and Tomoyuki Miyashita.},
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},
}

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 - Miura, S.
AU - Miyashita, T.
PY - 2017
SP - 422
EP - 427
DO - 10.5220/0006480604220427

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.