Graph coloring problem (GCP) is one of the most studied combinatorial optimization problems. It is important in theory and practice. There have been many algorithms for graph coloring problem, including exact algorithms and (meta-)heuristic algorithms. In this paper, we attempt another meta-heuristic method⎯particle swarm optimization to graph coloring problem. Particle swarm optimization (PSO)...

In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a number of tasks to a number of processors, subject to a set of constraints, and in such a way a given cost function to be minimized. We introduce a novel formulation of the problem, in which each processor is limited in the...

The integrated product mix-outsourcing optimization is a major problem in manufacturing enterprise. Generally, heuristic or meta-heuristic solution approaches are used to optimize such problems. Heuristic approaches for these problems include Theory of Constraints (TOC) and Standard Accounting. Sometimes heuristic approaches are inefficient especially in large problems and instead, in these cas...

This paper reviews a majority of the nature-inspired algorithms, including heuristic and meta-heuristic bio-inspired non-bio-inspired focusing on their source inspiration studying potential applications in drones. About 350 algorithms have been studied, comprehensive classification is introduced based sources inspiration, bio-based, ecosystem-based, social-based, physics-based, chemistry-based,...

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

This study considers quality aspects in the process planning of a reconfigurable manufacturing system. The goal is to analyze how variation impacts planning, i.e., cost-based design and modular features. Besides this, analysis helps identifying number conforming failed products delivered by plan. First, multi-objective mixed integer non-linear programming model proposed that contains novel obje...

response surface methodology is a common tool in optimizing processes. it mainly concerns situations when there is only one response of interest. however, many designed experiments often involve simultaneous optimization of several quality characteristics. this is called a multiresponse surface optimization problem. a common approach in dealing with these problems is to apply desirability funct...

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optim...