Reference Hub

This research has been cited in:

Article
An evolutionary path relinking approach for the quadratic multiple knapsack problemKnowledge-Based Systems10.1016/j.knosys.2015.10.004
Article
Scatter search for the bandpass problemJournal of Global Optimization10.1007/s10898-016-0446-0
Chapter
Path-relinkingOptimization by GRASP10.1007/978-1-4939-6530-4_8
Article
Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representationComputers & Operations Research10.1016/j.cor.2023.106324
Chapter
Diversity and Equity ModelsHandbook of Heuristics10.1007/978-3-319-07124-4_61
Chapter
Diversity and Equity ModelsHandbook of Heuristics10.1007/978-3-319-07153-4_61-1
Chapter
Tabu Search and Scatter SearchSearch and Optimization by Metaheuristics10.1007/978-3-319-41192-7_20
Article
Hybrid algorithms for placement of virtual machines across geo-separated data centersJournal of Combinatorial Optimization10.1007/s10878-019-00411-3
Article
Path relinking for the vertex separator problemExpert Systems with Applications10.1016/j.eswa.2017.03.064
Article
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimizationInformation Sciences10.1016/j.ins.2014.10.010
Article
Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problemsJournal of Heuristics10.1007/s10732-022-09498-0
Article
Simulation based risk management for multi-objective optimal wind turbine placement using MOEA/DEnergy10.1016/j.energy.2017.09.103
Article
Diversification-based learning in computing and optimizationJournal of Heuristics10.1007/s10732-018-9384-y
Article
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problemComputers & Operations Research10.1016/j.cor.2016.09.005
Article
The Critical Node Detection Problem in networks: A surveyComputer Science Review10.1016/j.cosrev.2018.02.002
Chapter
Greedy Randomized Adaptive Search Procedures: Advances and ExtensionsHandbook of Metaheuristics10.1007/978-3-319-91086-4_6

Exterior Path Relinking for Zero-One Optimization

Fred Glover

Source Title: International Journal of Applied Metaheuristic Computing (IJAMC)5(3)

ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781466652637|DOI: 10.4018/ijamc.2014070101

Cite Article Cite Article

MLA

Glover, Fred. "Exterior Path Relinking for Zero-One Optimization." IJAMC vol.5, no.3 2014: pp.1-8. http://doi.org/10.4018/ijamc.2014070101

APA

Glover, F. (2014). Exterior Path Relinking for Zero-One Optimization. International Journal of Applied Metaheuristic Computing (IJAMC), 5(3), 1-8. http://doi.org/10.4018/ijamc.2014070101

Chicago

Glover, Fred. "Exterior Path Relinking for Zero-One Optimization," International Journal of Applied Metaheuristic Computing (IJAMC) 5, no.3: 1-8. http://doi.org/10.4018/ijamc.2014070101

Export Reference

Favorite Full-Issue Download

View Full Text HTML

View Full Text PDF

Abstract

Path relinking (PR) maintains a reference set of elite and diverse solutions, and generates new solutions between and beyond initiating and guiding solutions selected from this set as a foundation for an evolutionary solution process. However, in spite of the widespread application of path relinking in combinatorial optimization, almost all PR implementations only consider the between-form of PR. This note discusses the beyond-form of path relinking, which is called Exterior Path Relinking, and focuses on its relevance for diversification strategies in binary optimization. Finally, this work also observes how to combine the Exterior (beyond) and Interior (between) forms of path relinking.

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.

Username or email: *

Password: *

Forgot individual login password?

Create individual account

Exterior Path Relinking for Zero-One Optimization

MLA

APA

Chicago

Export Reference

Abstract

Request Access