AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
TL;DR
This paper introduces an advanced ant colony system approach that seamlessly integrates four heuristic techniques, and incorporates a no-improvement counter into the algorithm for solution selection to counter stagnation and enhance solution diversity.
An improved artificial bee colony (ABC) algorithm is proposed which is structured specifically to address the capacitated vehicle routing problem (CVRP), a significant challenge in combinatorial optimization.
This paper focuses on the cold chain logistics and proposes a multi-objective Vehicle Routing Problem (VRP) model that seeks to minimize the total cost of cold chain logistics and maximize the fairness of employees' workloads. This model first incorporates carbon emissions into the cost structure, and also discretely c...
An Improved Ant Colony Optimization (IACO) algorithm tailored for grid-based AGV routing is proposed that generates shorter and smoother trajectories with minimized redundant turning maneuvers and achieves an approximately 18% reduction in total path length and a 45% decrease in computational iterations.
A mixed-integer programming model is constructed with the objective of minimizing the total delivery time, comprehensively considering physical constraints such as drone endurance, payload capacity, and spatial-temporal synchronization of both vehicles at rendezvous points to address the inefficiency of “last-mile” del...
An NCO solution method for a time-constrained capacitated VRP with finite vehicle fleet is presented, providing competitive cost-efficient solutions while exhibiting robustness and generalization, compared with state-of-the-art heuristics.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.