Solving the Capacitated Vehicle Routing Problem by Columnar Competitive Model
Jingyu Li · Journal of Traffic and Logistics Engineering · 2014
Abstract—The vehicle routing problem (VRP) concerns the transport of items between depots and customers by means of a fleet of vehicles. The capacitated vehicle routing problem (CVRP) is the basic version of the VRP. A columnar competitive model (CCM) of neural networks incorporates with a winner-take-all learning rule is employed to solve the CVRP. Stability condition of CCM for CVRP is exploited by mathematical analysis. Parameters settings of the network for guaranteeing the network converges to valid solutions are discussed in detail. Simulations are carried out to illustrate the performance of the columnar competitive model. Index Terms—columnar competitive model (CCM), capacitated vehicle routing problem (CVRP), winner-takeall