Set-Covering-Based Approximate Algorithm Using Enhanced Savings for Solving Vehicle Routing Problem

Transportation is widely present in human activities and supports many economic activities. Using phones, reading mails, traveling, and flying involve the routing of messages, people, and goods. One of the present aims of research is to fill the gap between academic research and practical applications. Our aim is to present a simple and flexible heuristic for solving the capacitated vehicle routing problem and heterogeneous fleet vehicle routing problems, and discuss its advantages compared to other well-known heuristics. The flexibility of our approach comes from the simplicity of the solution procedure and is especially important when the algorithm is going to be applied to solving real-life problems. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Algorithm · Computer network · Distributed computing · Flexibility (engineering) · Heuristic · Heuristics · Mathematical optimization · Operations research · Routing (electronic design automation) · Set (abstract data type) · Simple (philosophy) · Simplicity · Vehicle Routing Problem · Artificial Intelligence · Computer Science · Engineering · Mathematics · Smart Parking Systems Research · Transportation and Mobility Innovations · Vehicle Routing Optimization Methods