Advances in Routing and Reconfiguration

The field of routing and reconfiguration is experiencing significant developments, driven by innovative algorithms and techniques that enhance the efficiency and effectiveness of various systems. A key trend is the focus on optimizing routes and paths in complex networks, including those with negative-cost cycles and varying costs. Researchers are also exploring new approaches to reconfiguration problems, such as token sliding and token jumping, and investigating their applications in different domains. Furthermore, the integration of artificial intelligence and machine learning techniques is leading to improved solutions for classic problems like the Traveling Salesman Problem and the Maximum Weighted Independent Set problem. Noteworthy papers in this area include:

  • Faster All-Pairs Optimal Electric Car Routing, which presents a randomized algorithm for computing optimal energetic paths in directed graphs with positive and negative costs.
  • Purity Law for Generalizable Neural TSP Solvers, which introduces a novel training paradigm that enhances the generalization performance of neural solvers for the Traveling Salesman Problem.

Sources

Faster All-Pairs Optimal Electric Car Routing

To Repair or Not to Repair? Investigating the Importance of AB-Cycles for the State-of-the-Art TSP Heuristic EAX

The tape reconfiguration problem and its consequences for dominating set reconfiguration

Adaptive Wizard for Removing Cross-Tier Misconfigurations in Active Directory

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile

Purity Law for Generalizable Neural TSP Solvers

Dynamic Location Search for Identifying Maximum Weighted Independent Sets in Complex Networks

Built with on top of