Bilevel Memetic Search Approach to the Soft-Clustered Vehicle Routing Problem

Keyphrases

• Search Approach 100%
• Bi-level 100%
• Clustered Vehicle Routing Problem 100%
• Memetic Search 100%
• Computation Time 33%
• Local Optimum 33%
• NP-hard 33%
• Search Methods 33%
• Search Space 33%
• Solution Quality 33%
• Tabu 33%
• Quality Time 33%
• Local Optimization 33%
• Benchmark Instances 33%
• Ablation Study 33%
• New Upper Bound 33%
• Hybrid City 33%
• Courier Companies 33%
• Parcel Delivery 33%
• Capacitated Vehicle Routing Problem 33%
• Neighborhood Search 33%
• Population Reconstruction 33%
• Key Algorithm 33%
• Freight Transportation 33%
• Group Matching 33%
• Reconstruction Strategy 33%

Computer Science

• Vehicle Routing 100%
• Potential Application 33%
• Search Space 33%
• Solution Quality 33%
• Computation Time 33%
• Local Optimization 33%
• Key Algorithm 33%
• Quality Time 33%
• Benchmark Instance 33%
• Search Neighborhood 33%
• Remaining Instance 33%