A Sweep-Based TCNN Algorithm for Capacity Vehicle Routing Problem

1. Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of Vehicle Routing and Scheduling Problems. Neural Networks 11, 221–227 (1981)

   Article  Google Scholar 

2. Rodriguez, P., Nussbaum, M., Baeza, R., Leon, G.: Using Global Search Heuristics for the Capacity Vehicle Routing Problem. Comp. Oper. Res. 25, 407–417 (1998)

   Article  MATH  MathSciNet  Google Scholar 

3. Achuthan, N.R., Caccetta, L., Hill, S.P.: A New Subtour Elimination Constraint for the Vehicle Routing Problem. European J. of Operation Research 91, 573–586 (1996)

   Article  MATH  Google Scholar 

4. Gillett, B., Miller, L.: A Heuristic Algorithm for the Vehicle Dispatch Problem. Operations Research 22, 340–349 (1974)

   Article  MATH  Google Scholar 

5. Hopfield, J.J., Tank, D.W.: Neural Computations of Decisions in Optimization Problems. Biological Cybernetics 52, 141–152 (1985)

   MATH  MathSciNet  Google Scholar 

6. Wilson, G.V., Pawley, G.S.: On the Stability of the Traveling Salesman Problem Algorithm of Hopfield and Tank. Biological Cybernetics 58, 63–70 (1988)

   Article  MATH  MathSciNet  Google Scholar 

7. Chen, L., Aihara, K.: Chaos Simulated Annealing by a Neural Network Model with Transient Chaos. Neural Networks 8, 915–930 (1995)

   Article  Google Scholar 

8. Aihara, K., Takabe, T., Toyoda, M.: Chaotic Neural Networks. Physical Letters A 144, 333–340 (1990)

   Article  MathSciNet  Google Scholar 

Download references