Results 11 to 20 of about 1,438 (207)
A matheuristic for large-scale capacitated clustering [PDF]
Computers & Operations Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mario Gnägi, Philipp Baumann
openaire +2 more sources
A fix-and-optimize matheuristic for university timetabling [PDF]
Journal of Heuristics, 2018 University course timetabling covers the task of assigning rooms and time periods to courses while ensuring a minimum violation of soft constraints that define the quality of the timetable. These soft constraints can have attributes that make it difficult for mixed-integer programming solvers to find good solutions fast enough to be used in a practical
Michael Lindahl +2 more
openaire +4 more sources
A Matheuristic for Joint Optimal Power and Scheduling Assignment in DVB-T2 Networks [PDF]
Algorithms, 2020 Because of the introduction and spread of the second generation of the Digital Video Broadcasting—Terrestrial standard (DVB-T2), already active television broadcasters and new broadcasters that have entered in the market will be required to (re ...
Fabio D’Andreagiovanni +2 more
doaj +3 more sources
A matheuristic for exam timetabling
IFAC-PapersOnLine, 2016 Exam timetabling is a tedious task faced in universities. We present a matheuristic to solve the exam timetabling problem related to the Toronto benchmark. We propose first a non-linear formulation used to find an initial feasible solution. We briefly describe a former linear formulation and introduce a new compact linear formulation.
Arbaoui, Taha +2 more
openaire +4 more sources
A matheuristic for the stochastic facility location problem
Journal of Heuristics, 2021 In this paper, we describe a matheuristic to solve the stochastic facility location problem which determines the location and size of storage facilities, the quantities of various types of supplies stored in each facility, and the assignment of demand locations to the open facilities, which minimize unmet demand and response time in lexicographic order.
Renata Turkes +2 more
openaire +3 more sources
A unified matheuristic for solving multi-constrained traveling salesman problems with profits
EURO Journal on Computational Optimization, 2017 In this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search.
Rahma Lahyani +2 more
doaj +3 more sources
Parameter Tuning for Local-Search-Based Matheuristic Methods [PDF]
Complexity, 2017 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 ...
Guillermo Cabrera-Guerrero +5 more
doaj +2 more sources
A survey on matheuristics for routing problems [PDF]
EURO Journal on Computational Optimization, 2014 In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework.
Claudia Archetti, M.Grazia Speranza
doaj +5 more sources
A Matheuristic for the Multivehicle Inventory Routing Problem
INFORMS Journal on Computing, 2017 We consider the inventory routing problem, in which a supplier has to replenish a set of customers by means of a limited fleet of capacitated vehicles over a discrete time horizon. The goal is to minimize the total cost of the distribution that comprises the inventory cost at the supplier and at the customers and the routing cost.
Claudia Archetti +2 more
openaire +2 more sources
A matheuristic for the traveling salesman problem with positional consistency constraints [PDF]
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +2 more sources