This paper proposes a new two-phase hybrid metaheuristic for vehicle routing problem with time windows (VRPTW). The first phase is to minimize the number of routes by means of variable neighborhood search algorithm, while the second phase is mainly aimed at minimizing the total travel distance using tabu search algorithm. Three neighborhood search operators (All-exchange, All-2-opt, All-crossex...

Hybrid metaheuristic, an advancement over classical metaheuristic, provides a more effective search methodology. It combines several metaheuristic algorithms into one optimization mechanism. In this paper image enhancement is considered as an optimization problem. Hybrid metaheuristic techniques are used to find the optimum value for a set of parameters of a transformation function, with an aim...

This paper proposes a visualization tool for analyzing the behavior of metaheuristic algorithms. It works by reproducing graphically the solutions generated in execution time. The tool was evaluated analyzing the Hybrid Grouping Genetic Algorithm for Bin Packing (HGGA_BP). It was used to solve a benchmark with 17 instances of the one dimensional Bin Packing problem (1D-BPP). The use of the visu...

This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve ...

Metaheuristic algorithms are traditionally designed following a manual, iterative algorithm development process. While this process sometimes leads to high performing algorithms, it is labor-intensive, error-prone, difficult to reproduce, and explores only a limited number of design alternatives. In this article, we advocate the automatic design of hybrid metaheuristic algorithms. For an effect...

in this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. the goal of the proposed model is to efficiently respond to the customers’ demands in the presenc...

A novel robust hybrid metaheuristic optimization approach, which can be considered as an improvement of the recently developed bat algorithm, is proposed to solve global numerical optimization problems. The improvement includes the addition of pitch adjustment operation in HS serving as a mutation operator during the process of the bat updating with the aim of speeding up convergence, thus maki...

The permutation flow shop scheduling problem (PFSP) is one of the most well known and well studied production scheduling problems with strong industrial background. Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and hence heuristics are used to obtain good solutions in a reasonable time. The specific goal of this paper is to inve...

This paper proposes a two-phase metaheuristic approach to planning daily farm work for agriculture production corporations. The two-phase metaheuristic contains the optimization of resources assignment and searching schedule based on Genetic Algorithm and hybrid Petri nets model. In the experiment, the effect on optimizing the resource assignment and priority list, initializing population of GA...