Keyphrases
Inventory Routing Problem
65%
Continuous-time
65%
Dynamic Discretization Discovery
32%
Time-variant
32%
Branch-and-bound Algorithm
32%
Time-Sensitive Networking
29%
Realization Probability
21%
Dynamic Vehicle Routing Problem
21%
Linear Optimization
21%
Stackelberg Security Game
21%
Stackelberg Game
21%
Routing Problem
21%
Integer Optimization
21%
Stochastic Vehicle Routing Problem
21%
Computational Study
21%
Expected Cost
21%
Branch-and-cut
21%
Vehicle Routing Problem
21%
Travel Time Estimation
21%
Neighbor-based
21%
Travel Time
21%
K-nearest
21%
Online Shortest Path
21%
Storage Capacity
18%
Low-level Heuristics
17%
Mixed-integer Optimization
14%
Formulation Optimization
14%
Delivery Service
10%
Stochastic Routing
10%
Dispatcher
10%
FedEx
10%
Skipping
10%
Termination Condition
10%
Sequence-dependent
10%
Logistics Network
10%
Fundamental Building Blocks
10%
Discovery Algorithm
10%
Vehicle Route
10%
Performance Guarantee
10%
Storage Products
10%
Customer Location
10%
Customer Request
10%
Vehicle Travel
10%
Product Inventory
10%
Cost Reduction
10%
Pricing Mechanism
10%
Approximation Accuracy
10%
Customer Service
10%
Travel Cost
10%
Column Generation
10%
INIS
routing
100%
algorithms
93%
inventories
54%
solutions
52%
vehicles
48%
optimization
48%
travel
48%
dynamics
47%
prices
43%
learning
34%
cost
24%
probabilistic estimation
21%
security
21%
data
20%
delivery
18%
stochastic processes
18%
planning
14%
storage
14%
capacity
14%
levels
12%
decomposition
10%
distribution
10%
origin
9%
information
9%
exploitation
9%
exploration
9%
approximations
8%
probability
8%
comparative evaluations
8%
reaction kinetics
7%
schedules
7%
units
7%
resources
7%
time dependence
7%
prediction
7%
roads
6%
stabilization
5%
programming
5%
applications
5%
efficiency
5%
Computer Science
Routing Problem
65%
Continuous Time
43%
Discretization
32%
Vehicle Routing
30%
Case Study
26%
Hyper-Heuristic
21%
Combinatorial Optimization Problem
21%
stackelberg game
21%
Observation Time
21%
Haversine Distance
21%
Deep Learning Model
21%
Traffic Pattern
21%
k-Nearest Neighbors Algorithm
21%
Shortest Path Problem
21%
Storage Capacity
16%
Optimization Formulation
14%
Metaheuristics
13%
Critical Component
10%
Approximation (Algorithm)
10%
Column Generation
10%
Building-Blocks
10%
Distribution Network
10%
Performance Guarantee
10%
Termination Condition
10%
Optimization Stage
10%
Branch and Cut
10%
Potential Customer
10%
Service Request
10%
Sampling Algorithm
10%
Destination Pair
10%
Learning Process
10%
Posterior Distribution
10%
Spatial Correlation
10%
Security Application
7%
Decomposition Method
7%
Integer Programming
7%
Randomly Generated Instance
5%
