A sweep-based TCNN algorithm for capacity vehicle routing problem

Authors:
Huali Sun;Jianying Xie;Yaofeng Xue
Affiliations:
Department of Automation, Shanghai Jiaotong University, Shanghai, China;Department of Automation, Shanghai Jiaotong University, Shanghai, China;Department of Automation, Shanghai Jiaotong University, Shanghai, China
Venue:
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
Year:
2005

Citing 3
Cited 0

On the stability of the travelling salesman problem algorithm of Hopfield and Tank

Biological Cybernetics
Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks
Using global search heuristics for the capacity vehicle routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel sweep-based transiently chaotic neural network (STCNN) algorithm for Capacity Vehicle Routing Problem (CVRP) is proposed. CVRP can be partitioned into two kinds of decisions: the selection of vehicles among the available vehicles and the routing of the selected fleet. The proposed algorithm first generates a number of routes that are served by vehicles and then solves the routes to optimality. Simulations show that the proposed algorithm produces excellent solutions in short computing times.