Parameter tuning for local-search-based matheuristic methods
DOI10.1155/2017/1702506zbMATH Open1380.90287OpenAlexW2776789493MaRDI QIDQ680781FDOQ680781
Authors: Guillermo Cabrera-Guerrero, Carolina Lagos, Carolina Castañeda, Franklin Johnson, Fernando Paredes, Enrique Cabrera
Publication date: 29 January 2018
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/1702506
Recommendations
optimization problemscapacitated facility locationcombining heuristics and mathematical programmingmatheuristic methodsmixed integer (non)linear programming problemsNP-hard combinatorial optimization
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- A tabu search approach to the uncapacitated facility location problem
- Title not available (Why is that?)
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- General local search methods
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- A survey on matheuristics for routing problems
- Heuristics for dynamic and stochastic inventory-routing
- A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- A tabu search approach to machine scheduling
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
Uses Software
This page was built for publication: Parameter tuning for local-search-based matheuristic methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680781)