Computer Science
Vehicle Routing
100%
Pickup and Delivery Problem
100%
Approximation (Algorithm)
50%
Multiple Region
50%
Deterministic Routing
50%
Solution Method
50%
Routing Problem
50%
Good Approximation
50%
Solution Quality
50%
Computational Effort
50%
Computational Time
50%
Traveling Salesman Problem
50%
Total Distance
50%
Routing Solution
50%
Computation Time
50%
Interlibrary Loan
25%
Potential Benefit
25%
Quality Time
25%
Data Sharing
16%
Adaptive Large Neighborhood Search
16%
Local Condition
16%
Transportation Provider
16%
Customer Profile
16%
Cost Saving
16%
Engineering
Solution Method
50%
Routing Solution
50%
Search Neighborhood
50%
Problem Formulation
50%
Routing Problem
50%
Real Data
50%
Solution Technique
50%
Larger Quantity
25%
Tactical Decision
25%
Subproblem
25%
Computation Time
25%
Service Provider
25%
Potential Benefit
16%
Social Sciences
Transport
100%
Vehicle Routing Problem
75%
Motor Vehicles
50%
Cost Saving
25%
Transportation Industry
25%