Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Background - Combinatorial optimization is a problem that consists of finding the optimum combination of each component from a finite set of objects. Most metaheuristic algorithms are designed for continuous optimization problem. Modification or enhancement is needed for continuous algorithm to solv...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | en en |
| Published: |
Springer International Publishing
2022
|
| Subjects: | |
| Online Access: | https://umpir.ump.edu.my/id/eprint/32897/2/1.1%20Simulated%20kalman%20filter%20for%20solving%20travelling%20salesman%20problem%20based%20on%20numerical%20ordering.pdf https://umpir.ump.edu.my/id/eprint/32897/13/Simulated%20kalman%20filter%20with%20modified%20measurement.pdf https://umpir.ump.edu.my/id/eprint/32897/ https://doi.org/10.1007/978-981-19-2095-0_27 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
https://umpir.ump.edu.my/id/eprint/32897/2/1.1%20Simulated%20kalman%20filter%20for%20solving%20travelling%20salesman%20problem%20based%20on%20numerical%20ordering.pdfhttps://umpir.ump.edu.my/id/eprint/32897/13/Simulated%20kalman%20filter%20with%20modified%20measurement.pdf
https://umpir.ump.edu.my/id/eprint/32897/
https://doi.org/10.1007/978-981-19-2095-0_27