Sort by
INIS
routing
100%
algorithms
94%
dynamics
74%
inventories
62%
stochastic processes
51%
solutions
47%
learning
46%
vehicles
42%
optimization
39%
travel
39%
prices
35%
cost
25%
approximations
25%
delivery
20%
probabilistic estimation
17%
security
17%
data
16%
planning
13%
levels
12%
storage
11%
capacity
11%
information
10%
decomposition
8%
distribution
8%
origin
8%
exploitation
7%
exploration
7%
values
7%
policy
7%
probability
7%
comparative evaluations
6%
performance
6%
reaction kinetics
5%
schedules
5%
units
5%
resources
5%
time dependence
5%
prediction
5%
roads
5%
Keyphrases
Inventory Routing Problem
53%
Continuous-time
53%
Dynamic Discretization Discovery
26%
Time-variant
26%
Branch-and-bound Algorithm
26%
Time-Sensitive Networking
23%
Realization Probability
17%
Dynamic Vehicle Routing Problem
17%
Linear Optimization
17%
Routing Problem
17%
Integer Optimization
17%
Stochastic Vehicle Routing Problem
17%
Expected Cost
17%
Branch-and-cut
17%
Vehicle Routing Problem
17%
Travel Time Estimation
17%
Travel Time
17%
Neighbor-based
17%
K-nearest
17%
Computational Study
17%
Stackelberg Game
17%
Stackelberg Security Game
17%
Online Shortest Path
17%
Time Granularity
17%
Dynamic Inventory
17%
Stochastic Inventory
17%
Storage Capacity
14%
Low-level Heuristics
14%
Value Function Approximation
13%
Mixed-integer Optimization
11%
Formulation Optimization
11%
Delivery Service
8%
Stochastic Routing
8%
Dispatcher
8%
FedEx
8%
Skipping
8%
Termination Condition
8%
Sequence-dependent
8%
Logistics Network
8%
Fundamental Building Blocks
8%
Vehicle Route
8%
Performance Guarantee
8%
Customer Location
8%
Customer Request
8%
Vehicle Travel
8%
Cost Reduction
8%
Pricing Mechanism
8%
Approximation Accuracy
8%
Customer Service
8%
Travel Cost
8%
Computer Science
Routing Problem
53%
Continuous Time
35%
Discretization
26%
Vehicle Routing
25%
Case Study
21%
Hyper-Heuristic
17%
Combinatorial Optimization Problem
17%
Deep Learning Model
17%
Traffic Pattern
17%
Observation Time
17%
Haversine Distance
17%
k-Nearest Neighbors Algorithm
17%
stackelberg game
17%
Shortest Path Problem
17%
Transportation Problem
17%
Multiple Scenario
17%
Storage Capacity
13%
Optimization Formulation
11%
Metaheuristics
10%
Approximation (Algorithm)
8%
Column Generation
8%
Building-Blocks
8%
Distribution Network
8%
Performance Guarantee
8%
Termination Condition
8%
Optimization Stage
8%
Branch and Cut
8%
Potential Customer
8%
Service Request
8%
Sampling Algorithm
8%
Critical Component
8%
Destination Pair
8%
Learning Process
8%
Posterior Distribution
8%
Spatial Correlation
8%
Decomposition Method
5%
Security Application
5%
Integer Programming
5%
