How to implement an ACO algorithm for vehicle routing?
2 ビュー (過去 30 日間)
古いコメントを表示
i need pre-written code to solve VRP using ACO or GA.
[Merged information from duplicate question]
anyone can help me with writing a code to implement ACO or Genetic Algorithm in solving VRP
回答 (3 件)
Walter Roberson
2012 年 3 月 9 日
Your existing question is still here and still active. I have merged your information from your newer phrasing.
Please do not open duplicate questions: it only confuses and frustrates people.
0 件のコメント
Arlene Natividad
2018 年 1 月 22 日
hello i really need help. I need a source code to solve vrp using ant colony for my thesis. please help me. please
1 件のコメント
Walter Roberson
2018 年 1 月 24 日
hafid oubouddi
2022 年 4 月 9 日
hello, how to find parameters or solve equations of a system using ACO
1 件のコメント
Walter Roberson
2022 年 4 月 10 日
You create a fitness function -- a function that has a lower value if the model or system of equations is solved better. Then you pass that fitness function into your ACO code.
When you have a model, then it is common to create the fitness function using the strategy:
- use the passed-in trial values of the parameters to predict what the results would be at each configuration of independent variables
- subtract the known values at those locations
- square each individual result
- sum those squares
This is sometimes known as a "sum of squared errors" function. It is the square of the Euclidean distance between the predicted values and the known values; a perfect fit would give a sum of squared errors of zero.
When you have a system of equations:
- take the left sides of the equations minus the right side of the equations
- square those differences
- sum those squares
This sum of squared errors would mathematically be zero when each of the equations balanced. (In practice you can run into numeric difficulties.)
参考
カテゴリ
Help Center および File Exchange で Genetic Algorithm についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!