Solve TSP problem using GA, VNS, SA๏ผ็จ้ไผ ็ฎๆณใๅ้ปๅๆ็ดขใ้็ซ็ฎๆณ่งฃๅณๆ ่กๅ้ฎ้ขใ
-
Updated
Jul 12, 2022 - Python
Solve TSP problem using GA, VNS, SA๏ผ็จ้ไผ ็ฎๆณใๅ้ปๅๆ็ดขใ้็ซ็ฎๆณ่งฃๅณๆ ่กๅ้ฎ้ขใ
This project uses stochastic approximation algorithms to optimize investment strategies and queueing systems. Techniques include the Simultaneous Perturbation Stochastic Approximation (SPSA) for maximizing the Sharpe ratio and Stochastic Approximation (SA) for minimizing waiting times in a GI/GI/1 queue.
Add a description, image, and links to the sa-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the sa-algorithm topic, visit your repo's landing page and select "manage topics."