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.
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.
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.
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.
Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the de…
Optimizes routing in decentralized exchanges with gas fees.
problem Routing in decentralized exchanges with fixed gas fees.
method General optimization framework with mixed-integer model, incorporating gas fees.
result Explicit Karush-Kuhn-Tucker system linking prices, fees, and activation.
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.
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.
An efficient algorithm optimizes trades across CFMM networks.
problem Optimizing trades through a network of CFMMs for maximum utility.
method Decomposition method to solve the routing problem.
result Significant performance improvements over commercial solvers.
Sparse RSP routing improves graph exploration and classification.
problem Optimal randomized routing and distance measures on weighted graphs.
method Tsallis divergence regularization for sparse RSP.
result Sparse random walk converges to least-cost graph as temperature decreases.
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.
Learning how to automatically solve optimization problems has the potential to provide the next big leap in optimization technology. The performance of automatically learned heuristics on routing problems has been steadily improving in recent years, but approaches based purely on machine learning are still outperformed…
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.
This study develops an online predictive optimization framework for dynamically operating a transit service in an area of crowd movements. The proposed framework integrates demand prediction and supply optimization to periodically redesign the service routes based on recently observed demand. To predict demand for the …
High-level synthesis (HLS) shortens the development time of hardware designs and enables faster design space exploration at a higher abstraction level. Optimization of complex applications in HLS is challenging due to the effects of implementation issues such as routing congestion. Routing congestion estimation is abse…
A framework for reinforcement learning tackles CVRP with competitive results.
problem Optimizing routes for vehicles with limited capacity.
method Formulates action selection as a mixed-integer optimization problem, uses policy iteration to improve policies.
result Achieves an average gap of 1.7% with state-of-the-art OR methods on CVRP instances.
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.
Recently similarity graphs became the leading paradigm for efficient nearest neighbor search, outperforming traditional tree-based and LSH-based methods. Similarity graphs perform the search via greedy routing: a query traverses the graph and in each vertex moves to the adjacent vertex that is the closest to this query…
RACER optimizes LLM-as-judge accuracy with dynamic reasoning selection.
problem Balancing reasoning accuracy with computational cost in LLM-as-judge settings.
method Formulates routing as a constrained distributionally robust optimization problem, accounting for distribution shift via KL-divergence uncertainty set.
result RACER achieves superior accuracy-cost trade-offs under distribution shift.
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.
Theory of MoE Transformers' generalization and scaling.
problem Understanding the generalization and scaling of Mixture-of-Experts (MoE) Transformers.
method Developed a theory that separates active capacity from routing combinatorics, derived a sup-norm covering-number bound, and proved a constructive approximation theorem.
result Generalization and scaling laws for MoE Transformers, showing how active capacity and routing structure affect performance.
End-to-end framework learns LLM routing from observational data.
problem Compounding errors in decoupled approaches and reliance on full-feedback data.
method Causal end-to-end framework minimizing decision-making regret from observational data.
result Method outperforms existing baselines across different embedding models.
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.
Soft modularization improves sample efficiency and performance in reinforcement learning.
problem Challenges in training multiple tasks jointly in reinforcement learning.
method Explicit modularization technique on policy representation, soft modularization method.
result Improves sample efficiency and performance over strong baselines in robotics manipulation tasks.
LG algorithm finds profitable trading paths in decentralized exchanges.
problem Identifying optimal trading paths in decentralized exchanges.
method Line-graph-based algorithm (LG) for efficient route discovery.
result LG consistently identifies more profitable paths than DFS with comparable costs.
This paper introduces STAP to measure DEX efficiency and shows better routing algorithms increase DEX performance and stakeholder benefits.
problem Measuring and improving the efficiency of decentralized exchanges (DEXs).
method Introduces STAP as a measure of DEX efficiency and compares two routing algorithms.
result Better routing algorithms improve DEX efficiency and stakeholder benefits.
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.
This study considers that the collective route choices of travelers en route represent a resolution of their competition on network routes. Well understanding this competition and coordinating their route choices help mitigate urban traffic congestion. Even though existing studies have developed such mechanisms (e.g., …
DeepCO uses deep learning for offline combinatorial optimization in warehouse operations.
problem Optimizing warehouse operation sequences in offline settings.
method DeepCO framework utilizing distribution regularized optimization for TSP.
result DeepCO reduces route length by 5.7% on average for TSP problems.
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.
This study develops an unsupervised learning algorithm for products of expert capsules with dynamic routing. Analogous to binary-valued neurons in Restricted Boltzmann Machines, the magnitude of a squashed capsule firing takes values between zero and one, representing the probability of the capsule being on. This analo…
Route Choice Models predict the route choices of travelers traversing an urban area. Most of the route choice models link route characteristics of alternative routes to those chosen by the drivers. The models play an important role in prediction of traffic levels on different routes and thus assist in development of ef…
This paper improves deep forest models with soft routing and topology learning.
problem Expensive computational costs and lack of interpretability in deep neural networks.
method Soft routing in probabilistic trees and topology learning for joint optimization.
result Empowered deep forests achieve better performance with reduced model complexity.
Study improves dynamic PT fleet optimization under noisy demand predictions.
problem Accurately predicting dynamic public transport demand for effective fleet management.
method Experimental case study in Copenhagen, using linear programming to optimize fleets.
result Optimized fleet performance is mainly affected by noise distribution skew and large errors.
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.
Model analyzes RFQ markets using stochastic control to optimize dealer performance and inventory.
problem Optimizing market making in aggregator-routed RFQ markets with varying dealer performance scores.
method Two-tier stochastic control model that separates RFQ-level price competition from macro routing.
result Optimal controls can be expressed through derivatives of reduced Hamiltonians, leading to interpretable mappings from optimal win probabilities to optimal offsets.
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…
Novel ML approach solves complex warehouse routing problem.
problem Efficiently routing pickers in mixed-shelves warehouses.
method Hierarchical and parallel multi-agent reinforcement learning.
result State-of-the-art performance in solution quality and inference speed.
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.
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…
SECRM-2D improves RL-based autonomous driving with safety guarantees.
problem Safety and efficiency trade-offs in RL-based autonomous driving.
method RL-based controller with safety constraints for efficient and comfortable driving.
result SECRM-2D avoids crashes and improves efficiency and comfort compared to baselines.
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.
A recently proposed method in deep learning groups multiple neurons to capsules such that each capsule represents an object or part of an object. Routing algorithms route the output of capsules from lower-level layers to upper-level layers. In this paper, we prove that state-of-the-art routing procedures decrease the e…
Capsules are the multidimensional analogue to scalar neurons in neural networks, and because they are multidimensional, much more complex routing schemes can be used to pass information forward through the network than what can be used in traditional neural networks. This work treats capsules as collections of neurons …
Do you remember your first video game console? We remember ours. Decades ago, they provided hours of entertainment. Now, we have repurposed them to solve dynamic and stochastic optimization problems. With deep reinforcement learning methods posting superhuman performance on a wide range of Atari games, we consider the …
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.
Optimizes AMM markets with a new framework reducing complex optimization to simpler root finding.
problem Optimizing routing and arbitrage in AMM markets.
method Restricts search to boundary of optimal space using marginal prices, reducing high-dimensional optimization to lower-dimensional root finding.
result Significantly faster and more robust performance compared to the original convex optimization method.