Simulated annealing algorithm to solve Aircraft Landing Problem
| dc.contributor.author | Boukraa, Samah | |
| dc.contributor.author | Hemmak Allaoua: Supervisor | |
| dc.date.accessioned | 2024-07-10T12:26:06Z | |
| dc.date.available | 2024-07-10T12:26:06Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | In this work, we solved the problem of airplane landing, using the simulated annealing algorithm. This problem is known as NP-hard problem, which means that finding an ideal solution in a reasonable period of time is a challenge. This algorithm we applied allowed us to efficiently explore the solution space and get good results. Our solutions may not be ideal but they were close to the satisfactory level within a reasonable time frame. The simulated annealing algorithm has made great progress in solving the problem of aircraft landing and has opened up new avenues for research and improvement. | |
| dc.identifier.uri | https://dspace.univ-msila.dz/handle/123456789/43570 | |
| dc.language.iso | en | |
| dc.publisher | Mohamed Boudiaf University of M'sila | |
| dc.subject | ALP | |
| dc.subject | Combinatorial Optimization | |
| dc.subject | Simulated annealing | |
| dc.subject | Metaheuristics | |
| dc.title | Simulated annealing algorithm to solve Aircraft Landing Problem | |
| dc.type | Thesis |