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...

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...

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...

We present a state-of-the-art survey of parallel meta-heuristic developments and results, discuss general design and implementation principles that apply to most meta-heuristic classes, instantiate these principles for the three meta-heuristic classes currently most extensively used—genetic methods, simulated annealing, and tabu search, and identify a number of trends and promising research dir...

This paper investigates the development of an effective heuristic to solve the set covering problem (SCP) by applying the meta-heuristic Meta-RaPS (Meta-heuristic for Randomized Priority Search). In Meta-RaPS, a feasible solution is generated by introducing random factors into a construction method. Then the feasible solutions can be improved by an improvement heuristic. In addition to applying...

This paper introduces an interesting meta-heuristic called Meta-RaPS (Meta-heuristic for Randomized Priority Search) for solving combinatorial problems . Meta-RaPS incorporates randomness within priority rules to construct a feasible solution at each iteration. In addition, Meta-RaPS includes improvement heuristics for enhancing the feasible solution already obtained. Applications discussed inc...

in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.

in this research, an integrated inventory problem is formulated for a single-vendor multiple-retailer supply chain that works according to the vendor managed inventory policy. the model is derived based on the economic order quantity in which shortages with penalty costs at the retailers` level is permitted. as predicting customer demand is the most important problem in inventory systems and th...

the travelling salesmen problem (tsp) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. in this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. solving this problem seems hard because program statement is simple and leads this problem belonging to np...