Efficient Solution of Large-Scale Vehicle Routing Problems
Abstract
We plan to study how to efficiently and effectively solve large scale Vehicle Routing Problems (VRPs) which are among the most studied combinatorial optimization problems and play central roles in logistics and transportation. More precisely we plan to extend local search acceleration techniques such as granular neighborhoods, static move descriptors and selective vertex caching to VRPs having relevant real-world applications such as VRPs with Time Windows, VRP with Pickups and Deliveries, and VRP with with heterogeneous fleet. In addition, we plan to develop novel schemes based on parallel and localized optimization approaches to tackle even larger VRP instances. Finally, we will proceed with investigations on effective hybridization of machine learning techniques within already effective state-of-the-art solution algorithm with the aim of further enhancing their performances.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Jan 04, 2023
- Source ID
- FA86552117046
Entities
People
- Daniele Vigo
Organizations
- Air Force Office of Scientific Research
- United States Air Force