This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...

In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...

Numerous multistage planning problems in finance involve nonlinear and nonconvex decision controls. One of the simplest is the fixed-mix • Research supported in part by NSF grant CCR-9102660 and Air Force grant AFOSR-91-0359. We acknowledge the assistance of Michael T. Tapia in preparing this paper for publication. investment strategy. At each stage during the planning horizon, an in· vestor re...

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 study considers scheduling in Hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. This problem does not study in the literature, so far. Flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. After modeling the p...

Abstract Reducing material waste and computation time are primary objectives in cutting packing problems (C &P). A solution to the C &P problem consists of many steps, including grouping items be nested arrangement grouped on a large object. Current algorithms use meta-heuristics solve directly without explicitly addressing problem. In this paper, we propose new pipeline for nesting tha...

Abstract A variety of meta-heuristics have shown promising performance for solving multi-objective optimization problems (MOPs). However, existing may the best on particular MOPs, but not perform well other MOPs. To improve cross-domain ability, this paper presents a hyper-heuristic algorithm based adaptive epsilon-greedy selection (HH_EG) select and combine low-level heuristics (LLHs) during e...

Many efficient meta-heuristics were developed to solve the vehicle routing problem (VRP). However, these heuristics often require large computation times and significant effort to implement. In this paper we propose a simple and efficient heuristic that only uses the Clarke and Wright’s savings heuristic, the 2-opt and the 3-opt improvement heuristics. It will be shown that the proposed heurist...