Abstract submission

Abstract submission

We invite authors to send abstracts/extended abstracts/short papers describing recent advances of metaheuristics. Both theoretical and practical/experimental research contributions are welcome. Metaheuristic techniques of interest comprise: simulated annealing, tabu search, scatter search, path relinking, variable neighborhood search, iterated local search, evolutionary algorithms, memetic algorithms, ant colony optimization, particle swarm optimization, etc.

Application areas include, but are not limited to: scheduling in computer and manufacturing systems; logistics, transportation and vehicle routing; bioinformatics, electrical and mechanical engineering, optimization in graphs; telecommunication, finance and banking; combinatorial optimization problems; constraint satisfaction problems; vector optimization/multi objective optimization, etc.

When submitting your work, please make use of the the provided template. (Extended) abstracts/short must have a maximum length of 4 pages.