Results 171 to 180 of about 1,438 (207)
Some of the next articles are maybe not open access.
An iterative matheuristic for the inventory routing problem
Computers and Operations Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Simen T Vadseth +2 more
exaly +3 more sources
A matheuristic algorithm for the share-a-ride problem
Expert Systems With Applications, 2023Vincent F Yu +2 more
exaly +2 more sources
A matheuristic for the firefighter problem on graphs
International Transactions in Operational Research, 2019AbstractIn this paper, we describe a computational study conducted on The Firefighter Problem (FFP), which models fire spreading and containment in a graph. Once the fire breaks out on a set of vertices, the goal is to save as many vertices as possible with limited resources.
Natanael Ramos +2 more
openaire +1 more source
A matheuristic for the cell formation problem
Optimization Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rian Gabriel S. Pinheiro +3 more
openaire +1 more source
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
openaire +1 more source
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
openaire +1 more source
Matheuristics for the capacitated p‐median problem
International Transactions in Operational Research, 2014AbstractThe improvement in the performance of computers and mathematical programming techniques has led to the development of a new class of algorithms called matheuristics. Associated with an improvement of Mixed Integer Programming (MIP) solvers, these methods have successfully solved plenty of combinatorial optimization problems. This paper presents
Fernando Stefanello +2 more
openaire +1 more source
A Matheuristic for the Dial-a-Ride Problem
2011The Dial-a-Ride is a transport system on demand. A fleet of vehicles, without fixed routes and schedules, carries people from their pickup points to their delivery points, during a pre-specified time interval. It can be modeled as an N P-hard routing and scheduling problem, with a suitable mixed integer programming formulation. Exact approaches to this
Roberto Wolfler Calvo +1 more
openaire +1 more source
A Matheuristic Algorithm for the Inventory Routing Problem
Transportation Science, 2020This work addresses a challenging inventory routing problem that arises from a practical application faced by air-product companies, including Air Liquide. Given its computational complexity and industrial importance, this problem (denoted as IRP-Challenge2016) was presented as the topic of the French Operational Research and Decision Support Society ...
Zhouxing Su +4 more
openaire +1 more source
Matheuristics for slot planning of container vessel bays [PDF]
European Journal of Operational Research, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandra Korach +2 more
openaire +3 more sources