Difference of Genetic Algorithm and Constraint Programming? -
i hope shed light on me topic. if chance considered stupid question ask, i'd gladly remove question right away.
i designing course timetabling system , researching, stumbled upon ga , constraint programming approaches in solving problem. however, didn't quite understand differences between 2 , advantages of 1 on other. hope explain me in layman's term or direct me site topic.
thanks in advance!
best regards.
here's how see family of optimization algorithms:
- exact methods: brute force, branch , bound
- constraint programming (terrible name): tries reducing domain set
- linear programming et al: simplex, ...
- metaheuristics:
- local search: tabu search, simulated annealing, late acceptance, ...
- population based algorithms: genetic algorithms, swarm optimization, ...
for use case course timetabling specifically, itc2007 research competition showed local search king. genetic algorithms consistently inferior , constraint programming useless due scalability issues. mileage may 2007 time ago.
Comments
Post a Comment