Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Transport optimization on complex networks.

Bogdan Danila1, Yong Yu, John A Marsh

  • 1Department of Physics, The University of Houston, Houston, Texas 77204-5005, USA. dbogdan@mail.uh.edu

Chaos (Woodbury, N.Y.)
|July 7, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Complexity and dynamics of partially symmetric random neural networks.

ArXiv·2026
Same author

From Chaos to Coherence: Effects of High-Order Synaptic Correlations on Neural Dynamics.

ArXiv·2025
Same author

Extreme Value Statistics of Community Detection in Complex Networks with Reduced Network Extremal Ensemble Learning (RenEEL).

Entropy (Basel, Switzerland)·2025
Same author

Hierarchical Modular Structure of the <i>Drosophila</i> Connectome.

The Journal of neuroscience : the official journal of the Society for Neuroscience·2023
Same author

How High-Risk Comorbidities Co-Occur in Readmitted Patients With Hip Fracture: Big Data Visual Analytical Approach.

JMIR medical informatics·2020
Same author

Reduced network extremal ensemble learning (RenEEL) scheme for community detection in complex networks.

Scientific reports·2019
Same journal

Topological dependence of viral mutation spread in complex host-interaction networks.

Chaos (Woodbury, N.Y.)·2026
Same journal

Multifractal signatures of Hamiltonian chaos in Hyperion's rotational dynamics.

Chaos (Woodbury, N.Y.)·2026
Same journal

Exploring mechanisms for reversal of flow in tunicate hearts.

Chaos (Woodbury, N.Y.)·2026
Same journal

State estimation in spatiotemporal chaos via low-rank StatFEM.

Chaos (Woodbury, N.Y.)·2026
Same journal

Universal response functions in driven dissipative tunneling dynamics.

Chaos (Woodbury, N.Y.)·2026
Same journal

A network-based approach to characterize the dynamics of the coupling field of thermoacoustic oscillators in annular geometry.

Chaos (Woodbury, N.Y.)·2026
See all related articles

A new heuristic algorithm optimizes transport networks by minimizing node betweenness, significantly increasing traffic capacity and reducing travel times compared to shortest path routing.

Area of Science:

  • Network Science
  • Optimization Algorithms
  • Complex Systems

Background:

  • Complex networks are ubiquitous in nature and technology.
  • Efficient transport and routing are critical for network performance.
  • Existing shortest path routing can lead to congestion and inefficiencies.

Purpose of the Study:

  • To apply a novel heuristic algorithm for transport optimization on complex networks.
  • To compare the performance of optimal routing against shortest path routing.
  • To analyze the impact of optimal routing on network traffic, travel times, and network characteristics.

Main Methods:

  • Iterative traffic balancing algorithm minimizing maximum node betweenness.
  • Comparative analysis across three major types of complex networks.

Related Experiment Videos

  • Mathematical formula derivation for average hops and travel times.
  • Numerical simulations for validation and performance assessment.

    • Main Results:

    • Optimal routing significantly enhances network traffic capacity, preventing jamming.
    • A derived formula accurately predicts average hops and travel times.
    • Network small-world properties are preserved under optimal routing.
    • Average travel times are substantially reduced on congested networks.

    Conclusions:

    • The heuristic algorithm offers superior transport optimization for complex networks.
    • Optimal routing provides a robust solution for managing network traffic and reducing delays.
    • The findings have implications for designing and managing efficient large-scale networks.