Keyphrases
Inventory Routing Problem
70%
Continuous-time
70%
Dynamic Discretization Discovery
35%
Time-variant
35%
Branch-and-bound Algorithm
35%
Time-Sensitive Networking
31%
Realization Probability
23%
Dynamic Vehicle Routing Problem
23%
Linear Optimization
23%
Stackelberg Security Game
23%
Stackelberg Game
23%
Routing Problem
23%
Integer Optimization
23%
Stochastic Vehicle Routing Problem
23%
Computational Study
23%
Expected Cost
23%
Branch-and-cut
23%
Vehicle Routing Problem
23%
Travel Time Estimation
23%
Neighbor-based
23%
Travel Time
23%
K-nearest
23%
Storage Capacity
19%
Low-level Heuristics
18%
Mixed-integer Optimization
15%
Formulation Optimization
15%
Delivery Service
11%
Stochastic Routing
11%
Dispatcher
11%
FedEx
11%
Skipping
11%
Termination Condition
11%
Sequence-dependent
11%
Logistics Network
11%
Fundamental Building Blocks
11%
Discovery Algorithm
11%
Vehicle Route
11%
Performance Guarantee
11%
Storage Products
11%
Customer Location
11%
Customer Request
11%
Vehicle Travel
11%
Product Inventory
11%
Cost Reduction
11%
Pricing Mechanism
11%
Approximation Accuracy
11%
Customer Service
11%
Travel Cost
11%
Column Generation
11%
Novel Algorithm
11%
INIS
routing
100%
algorithms
89%
inventories
58%
solutions
56%
optimization
51%
dynamics
50%
prices
46%
vehicles
41%
travel
28%
cost
26%
probabilistic estimation
23%
security
23%
delivery
20%
stochastic processes
16%
planning
15%
storage
15%
capacity
15%
learning
13%
levels
13%
decomposition
11%
data
11%
approximations
9%
probability
9%
comparative evaluations
8%
reaction kinetics
7%
schedules
7%
units
7%
resources
7%
time dependence
7%
prediction
7%
information
7%
stabilization
5%
programming
5%
applications
5%
efficiency
5%
Computer Science
Routing Problem
70%
Continuous Time
46%
Discretization
35%
Vehicle Routing
32%
Hyper-Heuristic
23%
Combinatorial Optimization Problem
23%
stackelberg game
23%
Observation Time
23%
Haversine Distance
23%
Deep Learning Model
23%
Traffic Pattern
23%
k-Nearest Neighbors Algorithm
23%
Storage Capacity
17%
Optimization Formulation
15%
Metaheuristics
14%
Critical Component
11%
Approximation (Algorithm)
11%
Column Generation
11%
Building-Blocks
11%
Distribution Network
11%
Performance Guarantee
11%
Termination Condition
11%
Optimization Stage
11%
Branch and Cut
11%
Potential Customer
11%
Service Request
11%
Security Application
7%
Decomposition Method
7%
Integer Programming
7%
Randomly Generated Instance
5%
