Search
Search Results
-
Matheuristics: using mathematics for heuristic design
Matheuristics are heuristic algorithms based on mathematical tools such as the ones provided by mathematical programming, that are structurally...
-
Automatic Design for Matheuristics
Matheuristics have become widespread and effective methods for tackling the generalized assignment problem (GAP) and many other NP-hard problems. In...
-
Matheuristics Algorithms and Implementations
This book is the first comprehensive tutorial on matheuristics. Matheuristics are based on mathematical extensions of previously known heuristics,...
-
LP-based heuristics for the distinguishing string and substring selection problems
This work aims to evaluate and propose matheuristics for the Distinguishing String Selection Problem (DSSP) and the Distinguishing Substring...
-
Heuristics and Metaheuristics for Fixed-Charge Network Design
Heuristics and metaheuristics are widely used to tackle difficult network design problems. We first present fundamental concepts for the development...
-
A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics
In the context of simulation-based optimisation, this paper reviews recent work related to the role of metaheuristics, matheuristics (combinations of...
-
MIP model-based heuristics for the minimum weighted tree reconstruction problem
We consider the minimum weighted tree reconstruction (MWTR) problem and two matheuristic methods to obtain optimal or near-optimal solutions: the...
-
Heuristic methods for the single-machine scheduling problem with periodical resource constraints
In the last years, researchers have been paying special attention to scheduling problems with scarce resource consumption and periodic maintenance...
-
Combined cargo allocation and multi-ship routing and scheduling problem: application in the fertilizer industry
This paper explores the complex logistics of ship routing and scheduling for fertilizer companies in Brazil, considering the challenges posed by a...
-
Preference-based and cyclic bus driver rostering problem with fixed days off
Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building...
-
Decomposition-Based Heuristics
Decompositions are methods derived from the “divide et impera” principle, dictating to break up a difficult problem into smaller ones, and to solve...
-
MIP-based solution approaches for multi-site resource-constrained project scheduling
The execution of a project is often distributed among multiple sites. The planning of such a project includes selecting a specific site for the...
-
The optimal configuration for various placement machines in PCB assembly lines
Surface Mount Technology (SMT) has become widely adopted in the electronic assembly industry for printed circuit board (PCB) processes. In most...
-
Optimizing the wine transportation process from bottling plants to ports
The wine industry is a highly competitive sector for which any efficiency improvement in the wine supply chain plays a critical role in maintaining...
-
A matheuristic for tactical locomotive and driver scheduling for the Swiss national railway company SBB Cargo AG
At the scale of Switzerland, the national railway company SBB Cargo AG has to schedule its locomotives and drivers in order to be able to pull all...
-
Flow control with ILOG Script
Chapters 5 and 9 explained how IBM ILOG Script can be used in model files, especially to perform data preparation and postprocessing tasks. However,...
-
Single-Objective Optimization
Optimization is a framework, which includes the modeling and solving of complex situations. In essence, it can be thought of as a toolkit that allows...
-
A simple and effective algorithm for the maximum happy vertices problem
In a recent paper, a solution approach to the Maximum Happy Vertices Problem has been proposed. The approach is based on a constructive heuristic...
-
