A technique for improving the max-min ant system algorithm
In recent years, various metaheuristic approaches have been created to solve Quadratic Assignment Problems (QAPs). Among others is the Ant Colony Optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. Although it has solved some QAPs successfully, it still contains some w...
à®®à¯à®´à¯ விளகà¯à®•à®®à¯
Saved in:
| தலைமை எழà¯à®¤à¯à®¤à®¾à®³à®°à¯à®•ளà¯: | , , |
|---|---|
| வடிவமà¯: | Book Section |
| வெளியீடபà¯à®ªà®Ÿà¯à®Ÿà®¤à¯: |
Institute of Electrical and Electronics Engineers
2008
|
| பகà¯à®¤à®¿à®•ளà¯: | |
| நிகழà¯à®¨à®¿à®²à¯ˆ அணà¯à®•லà¯: | http://eprints.utm.my/12481/ http://eprints.utm.my/12481/ http://eprints.utm.my/12481/ |
| கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•ளà¯: |
கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯ இணை
கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•ள௠இலà¯à®²à¯ˆ, இநà¯à®¤ கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯à®²à¯ˆ à®®à¯à®¤à®²à®¿à®²à¯ பதிவ௠செயà¯à®¯à¯à®™à¯à®•ளà¯!
|
இநà¯à®¤ கரà¯à®¤à¯à®¤à¯ˆ à®®à¯à®¤à®²à®¿à®²à¯ விடà¯à®Ÿà¯à®šà¯à®šà¯†à®²à¯à®²à¯à®™à¯à®•ளà¯!