( en | de | ru )

 

Disambiguation of "Tasgetiren, Mehmet Fatih"

Author of the publication

copydeleteadd this publication to your clipboard
Evolutionary Algorithms for Designing Self-sufficient Floating Neighborhoods.

, , , , and . Optimization in Industry, Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mehmet Fatih Çetin

Mehmet Fatih Güleçyüz

Fatih Mehmet Uckun

Abdelhak Fatihi

Fatih Bilgili

 

Other publications of authors with the same name

A differential evolution algorithm for the median cycle problem., , , and . SDE, page 157-163. IEEE, (2011)A discrete particle swarm optimization algorithm for the generalized traveling salesman problem., , and . GECCO, page 158-167. ACM, (2007)Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion., , , and . Comput. Oper. Res., (2017)Multi-objective optimization through differential evolution for restaurant design., , , , and . CEC, page 2288-2295. IEEE, (2016)A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem., , , and . Expert Syst. Appl., 38 (4): 3252-3259 (2011)Dynamic multi-swarm particle swarm optimizer with harmony search., , , and . Expert Syst. Appl., 38 (4): 3735-3742 (2011)A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem., , , and . SEMCCO (1), volume 8297 of Lecture Notes in Computer Science, page 1-12. Springer, (2013)Evolutionary Computation for Theatre Hall Acoustics., , , , and . Optimization in Industry, Springer, (2019)A discrete event simulation procedure for validating programs of requirements: The case of hospital space planning., , , and . SoftwareX, (2020)A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times., , , , , , and . Int. J. Prod. Res., 59 (13): 3880-3899 (2021)