• Corpus ID: 173990762

Learning the optimally coordinated routes from the statistical mechanics of polymers

  title={Learning the optimally coordinated routes from the statistical mechanics of polymers},
  author={Hao Liao and Xing-Tong Wu and Mingyang Zhou and Chi Ho Yeung},
Many major cities suffer from severe traffic congestion. Road expansion in the cites is usually infeasible, and an alternative way to alleviate traffic congestion is to coordinate the route of vehicles. Various path selection and planning algorithms are thus proposed, but most existing methods only plan paths separately and provide un-coordinated solutions. Recently, an analogy between the coordination of vehicular routes and the interaction of polymers is drawn; the spin glass theory in… 

Figures and Tables from this paper


From the physics of interacting polymers to optimizing routes on the London Underground
This work uses the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derives a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously.
Using Topological Statistics to Bias and Accelerate Route Choice: Preliminary Findings in Synthetic and Real-World Road Networks
The preliminary empirical results indicate that using route coupling to bias the learning process of agents results in faster convergence in the traffic assignment problem.
An Effective Selection Method for Vehicle Alternative Route under Traffic Congestion
This paper proposes a novel hybrid framework which integrates both urban traffic flow characteristics theory and machine learning techniques, and describes the problem definition, then captures a typical set of congestion road features from the GPS trajectories.
Transport in weighted networks: partition into superhighways and roads.
It is found that one can improve significantly the global transport by improving a tiny fraction of the network, the superhighways, by ensuring the distribution of the centrality for the infinite incipient percolation cluster satisfies a power law.
The Competition for Shortest Paths on Sparse Graphs
The ground state of optimal paths connecting randomly selected network nodes and fixed routers reveals nonmonotonic complex behaviors in average path length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers.
Combining Car-to-Infrastructure Communication and Multi-Agent Reinforcement Learning in Route Choice
This paper combines multi-agent reinforcement learning (MARL) and car-to-infrastructure communication (C2I) to deal with route choice and Experimental results show that the approach overcomes the compared method in terms of average travel cost.
Networking?a statistical physics perspective
This review aims at presenting an overview of tools and methods that have been developed within the statistical physics community and that can be readily applied to address the emerging problems in networking.
Solving a Time-Space Network Formulation for the Convoy Movement Problem
An integer programming (IP) model based on the concept of a time-space network and a Lagrangian relaxation is introduced and it is established that the corresponding feasibility problem is NP-complete.
On self adaptive routing in dynamic environments - an evaluation and design using a simple, probabilistic scheme
This paper proposes a simple, efficient, distributed probabilistic routing scheme for self adaptive routing in dynamic, realistic environments, and shows that there is a trade-off between optimizing dual objectives, but the degradation in average latency is only marginal for typical link utilization requirements.
Physics-inspired methods for networking and communications
This survey discusses how statistical physics methodology can provide efficient solutions to hard network problems that are intractable by classical methods, and highlights three typical examples in the realm of networking and communications.