Enhanced route planning with probabilistic prediction and uncertainty sets.
problem Improving route planning reliability under uncertainty.
method CQR-GAE model integrating conformal prediction and uncertainty sets.
result Significantly outperforms baseline methods in real-world traffic scenarios.
Owing to the expeditious growth in the information and communication technologies, smart cities have raised the expectations in terms of efficient functioning and management. One key aspect of residents' daily comfort is assured through affording reliable traffic management and route planning. Comprehensively, the majo…
Simultaneously estimates travel times and route choice model parameters.
problem Interdependent estimation of arc travel times and route choice model parameters.
method Maximum likelihood estimation for any differentiable route choice model.
result Strong performance in real-world data, even compared to arc travel time estimation methods.
Equity-Transformer solves NP-hard min-max routing problems efficiently.
problem Min-max routing problems with multiple agents and large-scale applications.
method Sequential planning approach with Transformer and equitable workload distribution inductive biases.
result Significant runtime and cost reductions in min-max mTSP and min-max mPDP tasks.
Retro* uses neural networks to efficiently find high-quality synthetic routes in organic chemistry.
problem Finding efficient synthetic routes in organic chemistry is challenging due to the vast search space.
method Retro* is a neural-based A*-like algorithm that learns a neural search bias to guide efficient best-first search.
result Retro* outperforms existing methods in both success rate and solution quality while being more efficient.
Thompson Sampling improves pursuit-evasion coordination.
problem Optimizing pursuer behavior to capture an evader efficiently.
method Variant of Thompson Sampling applied to pursuit-evasion problems.
result Thompson Sampling reduces time-to-capture significantly.
A new approach integrates inventory prediction and routing optimization for better supply chain management.
problem Optimizing efficient route selection in supply chain management with uncertain inventory demand.
method Decision-focused learning approach using neural networks to directly integrate inventory prediction and routing optimization.
result Direct integration of inventory prediction and routing optimization leads to better supply chain decisions.
Deep RL solves global routing problems more efficiently.
problem Challenging problem in electronic circuit design and other systems.
method Deep reinforcement learning for conjoint optimization.
result Deep RL outperforms A* method in routing solutions.
New machine learning pipeline solves dynamic vehicle routing problems efficiently.
problem Efficiently handling same day deliveries in e-commerce logistics.
method Combination of machine learning and combinatorial optimization.
result Ranked first in the EURO Meets NeurIPS Vehicle Routing Competition.
New algorithm for traffic routing in congested conditions.
problem Optimal routing in congested traffic networks.
method Congested Bandits model, UCB algorithm, iterative least squares planner.
result No-regret algorithms for congestion-aware routing.
SRL embeds combinatorial optimization into RL for better decision-making.
problem Challenges of standard RL in complex, structured decision-making problems.
method Structured Reinforcement Learning (SRL) with combinatorial optimization layers in actor neural network.
result SRL outperforms unstructured RL and imitation learning by up to 92% on dynamic problems.
The paper predicts travel times using tree-based ensembles.
problem Predicting travel times between urban points over short and long horizons.
method Tree-based ensemble methods trained on taxi trip records with additional features from weather and routing data.
result Adding routing data improves model performance and short-term predictions require less data.
Bayesian algorithm discovers synthetic routes from target molecules.
problem Identifying synthetic routes from desired products.
method Bayesian inference and combinatorial optimization.
result Algorithm rediscovered 80.3% and 50.0% of known synthetic routes.
Optimizes electric aircraft deployment for Canadian aviation to reduce emissions.
problem Limited fleet capacity and operational structure hinder electric aircraft transition.
method Multi-period mixed-integer linear programming (MILP) framework.
result Electric aircraft can reduce emissions by over 70% within five years.
Hopfield networks improve reaction template prediction for few/zero-shot scenarios.
problem Predicting reaction templates for new molecules in CASP.
method Adapted Hopfield networks to associate reaction templates, molecules, and structural information.
result Significantly improved performance for templates with few or zero training examples.
Increasing availability of vehicle GPS data has created potentially transformative opportunities for traffic management, route planning and other location-based services. Critical to the utility of the data is their accuracy. Map-matching is the process of improving the accuracy by aligning GPS data with the road netwo…
Proposes a new model for predicting future motion of road actors in autonomous vehicles.
problem Forecasting the long-term future motion of road actors for safe autonomous driving.
method Recurrent graph-based attentional approach with interpretable geometric and social relationships.
result Can produce diverse predictions conditioned on hypothetical or 'what-if' scenarios.
This paper improves route choice models by incorporating contextual factors.
problem Existing route choice models lack consideration of dynamic contextual conditions.
method Knowledge distillation from Stated Choice Experiments in Immersive Virtual Environment.
result High-fidelity route choice models with increased predictive power.
Capsule networks improve performance on image classification tasks with fewer parameters.
problem Improving performance of capsule networks with fewer parameters.
method Inverted dot-product attention routing, Layer Normalization, concurrent iterative routing.
result Improves performance on benchmark datasets CIFAR-10 and CIFAR-100, and performs at-par with ResNet-18.
Capsules learn from expert neurons using dynamic routing.
problem Training complex multidimensional neural networks.
method Formulated capsule networks as a product of expert neurons with dynamic routing.
result Capsule networks can generate realistic images.
JAMPR learns to solve complex VRP with time windows.
problem Vehicle routing problems with time windows and vehicle capacities.
method Joint attention to construct multiple routes concurrently.
result JAMPR outperforms existing models on different problem sizes.
A large GPS dataset reveals that a single route often covers 60% of travel observations.
problem Limited insights from small GPS datasets on route choice behavior.
method Evaluation of path generation algorithms including link penalty, link elimination, simulation, and via-node methods.
result Modified link penalty method achieves 97% coverage, significantly higher than previous studies.
Capsule networks can only represent symmetric functions due to routing limitations.
problem Capsule networks' expressivity is limited to symmetric functions.
method Proved and empirically demonstrated that EM-routing and routing-by-agreement prevent capsule networks from distinguishing inputs and their negative counterpart.
result Capsule networks are not universal approximators due to the limitation of expressivity.
This paper improves nearest neighbor search by learning optimal routing functions.
problem Local minima issues in greedy routing on similarity graphs.
method Learn routing function that considers global graph structure.
result Significant improvement in search performance via learning.
A new router uses attention-based reinforcement learning to solve detailed routing problems efficiently.
problem Solving detailed routing in integrated circuits while adhering to complex design rules.
method Attention-based reinforcement learning applied to track-assignment detailed routing.
result The attention router achieves over 100x acceleration compared to a genetic router without sacrificing solution quality.
We propose and systematically evaluate three strategies for training dynamically-routed artificial neural networks: graphs of learned transformations through which different input signals may take different paths. Though some approaches have advantages over others, the resulting networks are often qualitatively similar…
Study uses neural networks to predict travel times for public transportation.
problem Inaccurate travel time predictions due to road traffic irregularities.
method Developed two neural network models (MLP and LSTM) using OD travel time matrix.
result Both models can make near-accurate predictions, but LSTM is more susceptible to noise.
The DEBS Grand Challenge 2018 is set in the context of maritime route prediction. Vessel routes are modeled as streams of Automatic Identification System (AIS) data points selected from real-world tracking data. The challenge requires to correctly estimate the destination ports and arrival times of vessel trips, as ear…
Project learns to model Capsule Networks' routing procedures for better expressiveness.
problem Limited expressiveness of Capsule Networks' inner routing procedures.
method Proposes two ways to learn the routing procedure as a network parameter.
result Improved expressiveness of Capsule Networks through learned routing procedures.
Unified routing and arbitrage with concave continuation.
problem Combining routing and arbitrage in financial markets.
method Extending AMM trade functions to negative inputs via concave continuation.
result Unified approach unifies routing and arbitrage.
Sparse routing networks with co-training prevent catastrophic forgetting in continual learning.
problem Catastrophic forgetting in neural networks trained on a sequence of tasks.
method Sparse routing networks with co-training to minimize interference between dissimilar tasks.
result Sparse routing networks with co-training outperform densely connected networks on benchmarks.
Neural LNS improves vehicle routing performance.
problem Optimizing vehicle routes with constraints.
method Integrates deep learning with large neighborhood search.
result Significantly outperforms existing methods on CVRP.
Polestar optimizes public transportation routes for efficiency and user satisfaction.
problem Difficulty in finding optimal public transportation routes due to complex networks and dynamic situations.
method Developed a Public Transportation Graph (PTG) and a route search algorithm with station binding and ranking modules.
result Demonstrated superior efficiency and user satisfaction compared to existing systems.
Machine learning speeds up train shunting feasibility determination.
problem Determining the feasibility of train shunting schedules.
method Deep Graph Convolutional Neural Network (DGCNN) to predict feasibility.
result Improves prediction accuracy and computational efficiency.
Predicts routing congestion in FPGA designs using machine learning.
problem Routing congestion estimation is absent or inaccurate in HLS design methods.
method Machine learning to predict routing congestion in HLS.
result Accurately estimates routing congestion with errors of 6.71% and 10.05%.
The paper reclassifies RL algorithms using inference concepts.
problem To provide a unified perspective on RL algorithms.
method Using the control as inference framework, the paper classifies RL algorithms as amortised and iterative inference.
result A wide range of RL algorithms can be classified in this new manner.
Capsule networks improve at detecting changes in compositionality with routing.
problem Capsule networks struggle with detecting changes in compositionality.
method Introduced a loss function based on routing entropy to improve compositionality.
result Capsule networks with the new loss function better detect changes in compositionality.
This study develops methods to coordinate travel routes to reduce congestion.
problem Coordination of travel routes to reduce urban traffic congestion.
method Developed mathematical approaches to quantify coordination potential and adaptive centroid-based clustering algorithm (ACCA).
result ACCA efficiently forms proper coordination groups for CB-CRM, improving efficiency with minimal performance loss.
Optimizes query routing to LLMs under cost and resource constraints.
problem Non-uniform or adversarial batching in per-query routing methods leads to cost inefficiency.
method Batch-level, resource-aware routing framework that jointly optimizes model assignment for each batch.
result Robust routing framework improves accuracy by 1-14% over non-robust methods.
Study finds average 2.02 bps loss in automated market maker routing.
problem Measuring sub-optimality in automated market maker routing.
method Three reproducible optimal benchmarks: SCO, FVO, G-FVO; bisection-based algorithm for optimal routing.
result Average 2.02 bps loss per trade, \$24 million total loss.
CARROT optimizes LLM routing by choosing the cheapest and most accurate model.
problem Optimizing query routing to the most cost-effective LLM for a given task.
method CARROT uses cost and performance estimates to select the best LLM for each query.
result CARROT is minimax optimal, selecting the best LLM for any query.
Method uses neural networks to solve combinatorial problems.
problem Solving combinatorial problems on raw input data.
method Integrates blackbox combinatorial solvers into neural networks.
result Efficient backward pass through blackbox solvers implemented.
Optimal crypto asset routing with CFMMs, including fixed costs.
problem Optimizing order execution on a network of CFMMs with fixed costs.
method Convex optimization for no fixed costs, mixed-integer convex for fixed costs, heuristics for approximate solutions.
result Approximate solutions to optimal routing and arbitrage certification problems.
DPDP combines neural heuristics with DP for vehicle routing problems.
problem Vehicle routing problems with large scale.
method Deep Policy Dynamic Programming (DPDP) that uses a neural network policy to prioritize and restrict the DP state space.
result DPDP improves upon classical DP algorithms and outperforms neural approaches for TSP, VRP, and TSPTW.
Framework improves ETF volatility forecasting by adapting to market conditions.
problem Challenges in volatility forecasting due to shifting market conditions and varying model performance.
method Risk-sensitive specialist routing using online risk-sensitive evaluation and state-dependent gating.
result Reduces forecast loss by 24% and underprediction loss by 22% compared to rolling-best baseline.
World wide road traffic fatality and accident rates are high, and this is true even in technologically advanced countries like the USA. Despite the advances in Intelligent Transportation Systems, safe transportation routing i.e., finding safest routes is largely an overlooked paradigm. In recent years, large amount of …
Detects BGP routing anomalies using bursty announcement patterns.
problem Detecting disruptive routing updates in the Internet.
method Burstiness measure of inter-arrival times around disruptive update dates and times.
result High recall and better precision in detecting anomalous incidents.
New system assigns vehicles to routes for cost and energy efficiency.
problem Optimizing vehicle route assignment for cost and energy efficiency.
method Machine learning-based neural network algorithm to estimate energy consumption and provide real-time recommendations.
result Demonstrated efficient vehicle assignment for medium and heavy duty trucks.