Convex Analysis: (pms-28)

Research in metaheuristics for combinatorial optimization problems has lately experienced a noteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus of research has changed from being rather algorithm-oriented to being more problem-oriented. Nowadays the focus is on solving the problem at hand in the best way possible, rather than promoting a certain metaheuristic. This has led to an enormously fruitful cross-fertilization of different areas of optimization. This cross-fertilization is documented by a multitude of powerful hybrid algorithms that were obtained by combining components from several different optimization techniques. Hereby, hybridization is not restricted to the combination of different metaheuristics but includes, for example, the combination of exact algorithms and metaheuristics. In this work we provide a survey of some of the most important lines of hybridization. The literature review is accompanied by the presentation of illustrative examples.

/pdf/hybrid-metaheuristics-in-combinatorial-optimization-a-survey-1yn8riabpc.pdf

Hybrid metaheuristics in combinatorial optimization: A survey

Using the analytic network process (ANP) in a SWOT analysis - A case study for a textile firm

On the extent analysis method for fuzzy AHP and its applications

Purpose – The purpose of this paper is to present a detailed literature review of the recent applications of the analytic hierarchy process (AHP) and analytic network process (ANP) group decision‐making methodologies.Design/methodology/approach – Among more than 600 related papers published in the period 2005‐2009, a total of 232 application articles published in highly reputed international academic journals were selected and referenced in this paper. Papers were categorized according to application areas, subject titles, publication date, country of origin, academic journals, and integrated methodologies, and are summarized herein by various tables and charts.Findings – The findings show that during the years 2005‐2009, use of the AHP technique has continued to increase exponentially. Moreover, it is expected that ANP will gain more popularity in the future, as the benefits of ANP become better understood. Applications of AHP have been dominant in manufacturing, followed by the environmental management ...

The analytic hierarchy process and analytic network process: an overview of applications

Determining key capabilities in technology management using fuzzy analytic hierarchy process: A case study of Turkey

Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations

Given n items and m knapsacks, the Generalized Assignment Problem (GAP) is to find the optimum assignment of each item to exactly one knapsack, without exceeding the capacity of any knapsack. This problem can also be described as the optimal assignment of n jobs to mcapacitated agents. During the last three decades, many papers have been published on the GAP. In this survey we mainly concentrate on its real‐life applications in scheduling, timetabling, telecommunication, facility location, transportation, production planning, etc. We also mention some of the most recent solution approaches: from state‐of‐the‐art metaheuristics to variable neighborhood search algorithms and from exact solution procedures to simple heuristic algorithms.

A Survey of the Generalized Assignment Problem and Its Applications

In this work we are concerned with the Clarke–Wright savings method for the classical capacitated vehicle routing problem. This is an NP-hard problem and numerous heuristic solution methods have be...

https://link.springer.com/content/pdf/10.1057%2Fpalgrave.jors.2601916.pdf

Temel Öncan

Papers

Determining key capabilities in technology management using fuzzy analytic hierarchy process: A case study of Turkey

Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations

A Survey of the Generalized Assignment Problem and Its Applications

A new enhancement of the Clarke and wright savings heuristic for the capacitated vehicle routing problem

MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem