Hybrid Metaheuristics

Name: Hybrid Metaheuristics | 11th International Workshop, HM 2019, Concepción, Chile, January 16-18, 2019, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

11th International Workshop, HM 2019, Concepción, Chile, January 16-18, 2019, Proceedings

Maria J. Blesa Aguilera Christian Blum Haroldo Gambini Santos Pedro Pinacho-Davidson Julio Godoy del Campo(Herausgeber*in)

Springer (Verlag)

Erschienen am 7. Januar 2019

X, 209 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-030-05983-5 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Contents
Generic CP-Supported CMSA for Binary Integer Linear Programs
1 Introduction
2 Related Work
3 Original CMSA in the Context of BIPs
4 Generic Way of Generating Solutions for BIPs
4.1 Basic Solution Construction Mechanism
4.2 CP Supported Construction Mechanism
4.3 An Additional Algorithmic Aspect
5 Experimental Evaluation
5.1 Considered Problem Instances
5.2 Parameter Setting
5.3 Results
6 Conclusions
References
Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO
1 Introduction
2 The RCPS-NPV Problem
2.1 MIP Model
3 The Proposed Algorithm
3.1 Construct, Merge, Solve and Adapt
3.2 Parallel Ant Colony Optimisation
3.3 Scheduling Tasks
4 Experiments and Results
4.1 Comparison: CMSA Versus LRACO
5 Conclusion
A CMSA Parameter Selection
References
An Efficient Heuristic to the Traveling Salesperson Problem with Hotel Selection
1 Introduction
2 A Heuristic for TSPHS
2.1 Initial Solution
2.2 Local Search Procedure
2.3 Perturbation
3 Computational Experiments
4 Conclusions
References
Strategies for Iteratively Refining Layered Graph Models
1 Introduction
2 Mathematical Formalization
2.1 Traveling Salesman Problem with Time Windows
2.2 Layered Graph Model
2.3 Reduced Layered Graphs
2.4 Other Problems
3 Algorithmic Framework
3.1 Iterative Refinement Algorithm
3.2 Refinement Procedures
4 Computational Study
4.1 Experiments
5 Conclusion and Future Work
References
Fixed Set Search Applied to the Traveling Salesman Problem
1 Introduction
2 GRASP
3 Fixed Set Search
3.1 Fixed Set
3.2 Randomized Greedy Algorithm with Preselected Elements
3.3 Learning Mechanism
4 Results
5 Conclusion
References
A Hybrid GRASP/VND Heuristic for the Design of Highly Reliable Networks
1 Motivation
2 Uniformly Most-Reliable Graphs
2.1 Definition
2.2 Breakthroughs
2.3 Findings
2.4 Equivalent Combinatorial Problem
3 Metaheuristics
3.1 VND
3.2 GRASP/VND Heuristic
4 Results
5 Conclusions and Trends for Future Work
References
Game of Patterns and Genetic Algorithms Under a Comparative Study
1 Introduction
2 The Game of Patterns
3 The Genetic Algorithms
4 Performance Measure of Comparison
5 Numerical Examples
5.1 Goldstein Price Problem, p=1
5.2 Rastrigin Problem, p=2
5.3 Tang Problem, p=3
5.4 W Problem, p=4
6 Conclusions and Future Research
References
Stochastic Local Search Algorithms for the Direct Aperture Optimisation Problem in IMRT
1 Introduction
1.1 IMRT: An Overview
2 Stochastic Local Search Algorithms for DAO
2.1 Selecting a Promising Beamlet
2.2 Representation of the DAO Search Space
2.3 Intensity-Based Beamlet Targeted Search
2.4 Aperture-Based Beamlet Targeted Search
3 Experiments
3.1 Parameter Configuration
3.2 Initialisation Method
3.3 Comparison of Performance
4 Conclusions
References
Hybridization of Stochastic Tunneling with (Quasi)-Infinite Time-Horizon Tabu Search
1 Introduction
1.1 Stochastic Tunneling
1.2 Tabu Search
2 (Quasi-)Infinite History via Bloom Filters
2.1 Proposed Hybrid Algorithm
2.2 Potential Shortcomings
3 Experimental Setup
3.1 Test Case
3.2 Experimental Details
3.3 Hyperparameters
4 Results
5 Conclusions
References
A Self-adaptive Differential Evolution with Fragment Insertion for the Protein Structure Prediction Problem
1 Introduction
2 The Protein Structure Prediction Problem (PSPP)
2.1 Protein Representation
2.2 Energy Landscapes
2.3 Prediction Assessment
3 Self-adaptive Differential Evolution (SaDE)
4 SaDE with Fragment Insertion
5 Experiments Setup
6 Results and Analysis
7 Conclusions and Future Work
References
Scheduling Simultaneous Resources: A Case Study on a Calibration Laboratory
1 Introduction
2 Problem Definition
3 Literature Overview
3.1 Multiple Resource Scheduling
3.2 Batching in Two-Stage Flowshops
3.3 The Ant Colony Optimization
4 Solution Strategies
4.1 A Mixed-Integer Formulation
4.2 An Ant Colony Optimization Approach
5 Results and Analysis
6 Final Remarks
References
Optimization of the Velocity Profile of a Solar Car Used in the Atacama Desert
1 Introduction
2 Methodology
2.1 Description of AntuNekul II
2.2 Problem Characterization
2.3 Solar Irradiance Estimation
2.4 Dynamic Model of the HEV
2.5 Velocity Profile Optimization
2.6 Constraints
2.7 Test Instances
2.8 Metaheuristics
3 Results
3.1 World Solar Challenge Instance
3.2 Atacama Solar Race 2018 Instance
4 Discussion and Conclusions
References
Local Search Methods for the MRCPSP-Energy
1 Introduction
2 Literature Review
3 Proposed Local Search Approaches
3.1 MIP Extra Restrictions
3.2 Heuristic Approach
4 Computational Results
5 Concluding Remarks
References
Adaptation of Late Acceptance Hill Climbing Algorithm for Optimizing the Office-Space Allocation Problem
1 Introduction
2 Office-Space Allocation Problem (OFA)
3 Late Acceptance Hill Climbing Algorithm
3.1 Adaptation of LAHC for the (OFA)
4 Experimental Results and Discussions
4.1 Experimental Design
4.2 Experimental Results
4.3 Comparative Results
5 Conclusion
References
Applying an Iterated Greedy Algorithm to Production Programming on Manufacturing Environment Controlled by the PBC Ordering System
1 Introduction
2 The Iterated Greedy
3 Problem Description
4 The IG Algorithm
5 Results and Analysis
6 Conclusions
References
A Symbiotic Organisms Search Algorithm for Blood Assignment Problem
Abstract
1 Introduction
2 Methodology
3 Symbiotic Organisms Search Algorithm
4 Experimental Setting and Dataset Generation
4.1 Results and Discussion
5 Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken