Results 11 to 20 of about 1,705 (196)
Contemporary approaches in matheuristics an updated survey
Annals of Operations ResearchMatheuristics are problem independent frameworks that use mathematical programming tools to obtain high quality heuristic solutions. They are structurally general enough to be applied to different problems with little adaptation to their abstract ...
Marco A Boschetti +2 more
exaly +6 more sources
Matheuristics for optimizing the network in German wagonload traffic
EURO Journal on Computational Optimization, 2017 In this paper, we consider a capacitated multiple allocation hub location problem derived from a practical application in network design of German wagonload traffic.
Julia Sender +2 more
exaly +4 more sources
A Parallel Algorithm for Matheuristics: A Comparison of Optimization Solvers [PDF]
Electronics (Switzerland), 2020 Metaheuristic and exact methods are one of the most common tools to solve Mixed-Integer Optimization Problems (MIPs). Most of these problems are NP-hard problems, being intractable to obtain optimal solutions in a reasonable time when the size of the ...
Martin Gonzalez +2 more
exaly +3 more sources
Automatic Design for Matheuristics [PDF]
, 2021 Matheuristics have become widespread and effective methods for tackling the generalized assignment problem (GAP) and many other NP-hard problems. In fact, in this book we have many such methods, ranging from metaheuristics and mathematical programming techniques but mainly to real matheuristics.
Maniezzo, Vittorio +2 more
openaire +2 more sources
, 2016 As its name suggests, a matheuristic is the hybridization of mathematical programming with metaheuristics. The hallmark of matheuristics is the central role played by the mathematical programming model, around which the overall heuristic is built.
Fischetti Martina, Fischetti Matteo
core +3 more sources
The effect of different initial solutions on the metaheuristic algorithms for the single allocation p-hub center and routing problem [PDF]
PeerJ Computer ScienceThis article introduces methods for initializing a single-trajectory-based metaheuristic, specifically a simulated annealing (SA) algorithm, using constructive heuristics.
Abdul Kader Kassoumeh +2 more
doaj +3 more sources
Management and Production Engineering ReviewIn the logistics center (warehouse or distribution center), customer orders need to be picked up by the pickers. In this research, we examine the order-picking problem with sequencedependent constraints with two decision variables (container start time ...
K. Czerniachowska +2 more
semanticscholar +2 more sources
Matheuristics: Optimization, Simulation and Control
, 2009 Matheuristics are heuristic algorithms made by the interoperation of metaheuristics and mathematic programming (MP) techniques. An essential feature is the exploitation in some part of the algorithms of features derived from the mathematical model of the problems of interest, thus the definition "model-based metaheuristics" appearing in the title of ...
Marco A. Boschetti +3 more
openaire +3 more sources
Special issue on: “matheuristics” [PDF]
EURO Journal on Computational Optimization, 2014 n ...
Claudia Archetti +2 more
doaj +4 more sources
A comparative analysis of two matheuristics by means of merged local optima networks [PDF]
European Journal of Operational Research, 2021 We present a comparative analysis of two hybrid algorithms for solving combinatorial optimisation problems. The first one is a specific variant of an established family of techniques known as large neighbourhood search (LNS).
C. Blum, G. Ochoa
semanticscholar +2 more sources