Parameter Tuning for Local-Search-Based Matheuristic Methods
Algorithms that aim to solve optimisation problems by combining heuristics and mathematical programming have attracted researchers’ attention. These methods, also known as matheuristics, have been shown to perform especially well for large, complex optimisation problems that include both integer and...
Saved in:
| Main Authors: | Guillermo Cabrera-Guerrero, Carolina Lagos, Carolina Castañeda, Franklin Johnson, Fernando Paredes, Enrique Cabrera |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2017/1702506 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems
by: Julio Mario Daza-Escorcia, et al.
Published: (2024-11-01) -
Comparing variable neighbourhood search algorithms for the direct aperture optimisation in radiotherapy
by: Mauricio Moyano, et al.
Published: (2025-08-01) -
Advanced Optimization in E-Commerce Logistics: Combining Matheuristics With Random Forests for Hub Location Efficiency
by: Kassem Danach, et al.
Published: (2025-01-01) -
Comparing Evolutionary Strategies on a Biobjective Cultural Algorithm
by: Carolina Lagos, et al.
Published: (2014-01-01) -
A Matheuristic Iterative Approach for Profit-Oriented Line Planning Applied to the Chinese High-Speed Railway Network
by: Di Liu, et al.
Published: (2020-01-01)