Parameter Tuning Problem in Metaheuristics: A Self-Adaptive Local Search Algorithm for Combinatorial Problems-Reference-Cited by-同舟云学术

Parameter Tuning Problem in Metaheuristics: A Self-Adaptive Local Search Algorithm for Combinatorial Problems

Published:2019-09-14 Issue: Volume: Page:93-111
ISSN:2509-6427
Container-title:Women in Industrial and Systems Engineering
language:
Short-container-title:

Author:

Alabas-Uslu Cigdem,Dengiz Berna

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-11866-2_5

Reference56 articles.

1. Adenso-Diaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental design and local search. Oper Res 54(1):99–114

2. Alabas C (2004) Self-controlled local search heuristic for combinatorial optimization problems. PhD theses. Gazi University, Ankara

3. Alabas-Uslu C (2008) A self-tuning heuristic for a multi-objective vehicle routing problem. J Oper Res Soc 59(7):988–996

4. Alabas-Uslu C, Dengiz B (2014) A self-adaptive heuristic algorithm for combinatorial optimization problems. Int J Comput Int Sys 7(5):827–852

5. Arin A, Rabadi G, Unal R (2011) Comparative studies on design of experiments for tuning parameters in a genetic algorithm for a scheduling problem. Int J Exp Design Process Optim 2(2):103–124

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Metaheuristic–Boltzmannian optimization model: A new methodology for convergence using the Jensen–Shannon metric in continuous optimization problems;Swarm and Evolutionary Computation;2022-12

2. A systematic approach to parameter optimization and its application to flight schedule simulation software;Journal of Heuristics;2022-07-05