This paper reports an evolutionary approach called Scatter Search, that uses the concept of Pareto optimality to obtain a good approximate Pareto frontier. In order to designate a subset of strategies to be a reference solutions a choice function called Kramer Selection is used. A variant of measure of Kemen-Snell may be used, in our case study, in order to find a diverse set to complement the ...

This paper presents a new hybridization of VNS and path-relinking on a particle swarm framework for the permutational fowshop scheduling problem with total flowtime criterion. The operators of the proposed particle swarm are based on path-relinking and variable neighborhood search methods. The performance of the new approach was tested on the bechmark suit of Taillard, and five novel solutions ...

In this paper, we propose a path relinking procedure for the fixed-charge capacitated multicommodity network design problem. Cycle-based neighbourhoods are used both to move along path between elite solutions and to generate the elite candidate set by a tabu-like local search procedure. Several variants of the method are implemented and compared. Extensive computational experiments indicate tha...

In this paper a GRASP algorithm hybridized with a composite local search and path-relinking is proposed to solve the linear ordering problem with cumulative costs. Our approach consists on adding a composite local search that helps to produce diverse good solutions and improve them trough a truncated path-relinking with local search. The computational results show that the GRASP algorithm finds...

Manufacturing supply chain planning is a key factor of manufacturing supply chain management. Assignment of the production tasks, inventory control and transportation between the plants or the enterprises needs to be considered in manufacturing supply chain planning. Extended state task network (ESTN) is proposed in order to abstractly describe the production tasks with complex product producti...

GRASP, or greedy randomized adaptive search procedure, is a multi-start metaheuristic that repeatedly applies local search starting from solutions constructed by a randomized greedy algorithm. In this chapter we review the basic building blocks of GRASP. We cover solution construction schemes, local search methods, and the use of path-relinking as a memory mechanism in GRASP. Combinatorial opti...

Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first proposed in the 1970s, based on formulations dating back to the 1960s for combining decision rules and problem constraints. In contrast to other evolutionary methods like genetic algorithms, scatter search is founded on the p...

We propose a meta-heuristic based on GRASP combined with Path Relinking to address the Two-Echelon Vehicle Routing Problem, an extension of the Capacitated Vehicle Routing Problem in which the delivery from a single depot to customers is achieved by routing and consolidating the freight through intermediate depots called satellites. The problem is treated by separating the depot-to-satellite tr...