Optimised Search Heuristics: A Mapping of Procedures and Combinatorial Optimisation Problems

Fernandes, Susana; Lourenço, Helena

doi:10.2139/ssrn.2718137

Cited by 3 publications

(2 citation statements)

References 71 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Talbi (), Dumitrescu and Stützle (), Puchinger and Raidl (), Fernandes and Lourenço (), and Jourdan et al. () presented different taxonomies for such hybrid methods and a survey of the published studies which use these techniques.…”

Section: Introductionmentioning

confidence: 99%

Matheuristics for the capacitated p‐median problem

Stefanello

Araújo

Müller

2014

Int Trans Operational Res

View full text Add to dashboard Cite

The improvement in the performance of computers and mathematical programming techniques has led to the development of a new class of algorithms called matheuristics. Associated with an improvement of Mixed Integer Programming (MIP) solvers, these methods have successfully solved plenty of combinatorial optimization problems. This paper presents a matheuristic approach that hybridizes local search based metaheuristics and mathematical programming techniques to solve the capacitated p-median problem. The proposal considers reduced mathematical models obtained by a heuristic elimination of variables that are unlikely to belong to a good or optimal solution. In addition, a partial optimization algorithm based on the reduction is proposed. All mathematical models are solved by an MIP solver. Computational experiments on five sets of instances confirm the good performance of our approach.The first work on the CPMP appeared in scientific literature in the 1980s (Mulvey and Beck, 1984;Pirkul, 1987). Osman and Christofides (1994) used a hybrid approach that combines simulated annealing and tabu search and randomly generated 20 instances with size ranging from 50 to 100 customers to test the proposed methods. Maniezzo et al. (1998) presented an evolutionary method and an effective local search technique to solve the CPMP. Computational results showed the effectiveness of the proposed approach on five sets of instances, including those proposed by Osman and Christofides. More recently, Baldacci et al. (2002) proposed a new method based on a set partitioning formulation. The authors presented computational results on instances from the literature and proposed new sets of test problems with additional constraints: bounds on the cluster cardinality and incompatibilities between entities. Senne (2002, 2004) presented a column-generation method integrated to Lagrangean/surrogate relaxation to calculate lower bounds. Their proposed method identifies new productive columns, accelerating the computational process. Computational results were presented on instances generated based on a geographic database from the city São José dos Campos. Ahmadi and Osman (2005) proposed a combination of metaheuristics in a framework called GRAMPS (greedy random adaptive memory search method). A scatter search approach was proposed by Scheuerer and Wendolsky (2006), who evaluated it on instances from the literature, obtaining several new best solutions. Díaz and Fernández (2006) presented a hybrid scatter search and path relinking algorithm. The authors have run a series of computational experiments evaluating the proposed methods on instances from the literature, including instances corresponding to 737 cities in Spain. Both algorithms were evaluated separately; however, the combination of path relinking and scatter search gave the best results. Fleszar and Hindi (2008) solved the CPMP using variable neighborhood search to define sets of medians and the CPLEX package to solve assignment problems. Chaves et al. (2007) presented a hybrid heuristic ...

show abstract

Section: Introductionmentioning

confidence: 99%

Matheuristics for the capacitated p‐median problem

Stefanello

Araújo

Müller

2014

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…The exact method provides the optimal solution of such subproblems while the heuristic search allows the exploration of the problem space at a lower computational cost. In Talbi (2002), Dumitrescu and Stützle (2003), Puchinger and Raidl (2005), Fernandes and Lourenço (2006) and Jourdan, Basseur and Talbi, (2009) are described distinct taxonomies for the hybrid methods and a survey of published studies using this technique, including works on scheduling problem.…”

Section: Introductionmentioning

confidence: 99%

MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times

et al. 2014

View full text Add to dashboard Cite

In this paper we study the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. We consider the objective of minimizing the maximum completion time of the latest job, usually referred to as makespan. We propose a new MIP-based heuristic combining atomic moves such as insertion, ejection and closure, in order to generate sequences of such atomic moves minimizing the makespan. This heuristic employs a commercial solver to search the neighborhood in a multi-start algorithm. Our approach performed well in computational experiments targeting two sets of benchmark instances previously used in the literature Keywords: MIP-based neighborhood, hybrid metaheuristics, unrelated parallel machine scheduling problem, makespan. heurística baseada em programação matemática para o problema de programação de tarefas em máquinas paralelas não relacionadas com tempo de preparação dependente da sequência e da máquina.

show abstract

A Hybridised Evolutionary Algorithm for Multi-Criterion Minimum Spanning Tree Problems

Davis-Moradkhan

Browne

2008

2008 Eighth International Conference on Hybrid Intelligent Systems

View full text Add to dashboard Cite

Optimised Search Heuristics: A Mapping of Procedures and Combinatorial Optimisation Problems

Cited by 3 publications

References 71 publications

Matheuristics for the capacitated p‐median problem

Matheuristics for the capacitated p‐median problem

MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times

A Hybridised Evolutionary Algorithm for Multi-Criterion Minimum Spanning Tree Problems

Contact Info

Product

Resources

About