Journal of Heuristics
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Incomplete MaxSAT approaches for combinatorial testing
Journal of Heuristics - Tập 28 - Trang 377-431 - 2022
We present a Satisfiability (SAT)-based approach for building Mixed Covering
Arrays with Constraints of minimum length, referred to as the Covering Array
Number problem. This problem is central in Combinatorial Testing for the
detection of system failures. In particular, we show how to apply Maximum
Satisfiability (MaxSAT) technology by describing efficient encodings for
different classes of compl...
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems
Journal of Heuristics - Tập 14 - Trang 169-181 - 2007
Optimization heuristics are often compared with each other to determine which
one performs best by means of worst-case performance ratio reflecting the
quality of returned solution in the worst case. The domination number is a
complement parameter indicating the quality of the heuristic in hand by
determining how many feasible solutions are dominated by the heuristic solution.
We prove that the Ma...
A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints
Journal of Heuristics - Tập 19 - Trang 757-795 - 2013
This paper proposes a three-phase matheuristic solution strategy for the
capacitated multi-commodity fixed-cost network design problem with
design-balance constraints. The proposed matheuristic combines exact and
neighbourhood-based methods. Tabu search and restricted path relinking
meta-heuristics cooperate to generate as many feasible solutions as possible.
The two meta-heuristics incorporate ne...
A corridor method based hybrid algorithm for redundancy allocation
Journal of Heuristics - Tập 22 - Trang 405-429 - 2014
In this paper a hybrid algorithm for the redundancy allocation problem is
presented. The problem is the allocation of redundant components within
series-parallel systems. We present an algorithm that deals with the classical
formulation, where at least one component per subsystem must be included in the
final configuration, as well as the $$k$$ -out-of- $$n$$ formulation, in which
at least $$k$$ c...
Backbone guided tabu search for solving the UBQP problem
Journal of Heuristics - Tập 19 - Trang 679-695 - 2011
We propose a backbone-guided tabu search (BGTS) algorithm for the Unconstrained
Binary Quadratic Programming (UBQP) problem that alternates between two phases:
(1) a basic tabu search procedure to optimize the objective function as far as
possible; (2) a strategy using the TS notion of strongly determined variables to
alternately fix and free backbone components of the solutions which are
estimate...
Local search for a multi-drop multi-container loading problem
Journal of Heuristics - Tập 19 - Trang 275-294 - 2011
We consider a complex variant of the Container Loading Problem arising from a
real-world industrial application. It includes several features such as multiple
containers, box rotation, and bearable weight, which are of importance in many
practical situations. In addition, it also considers the situation in which
boxes have to be delivered to different destinations (multi-drop). Our solution
techni...
Adaptive Reservoir Evolutionary Algorithm: An Evolutionary On-Line Adaptation Scheme for Global Function Optimization
Journal of Heuristics - Tập 10 - Trang 555-586 - 2004
This paper introduces a novel global optimization heuristic algorithm based on
the basic paradigms of Evolutionary Algorithms (EA). The algorithm greatly
extends a previous strategy proposed by the authors in Munteanu and Lazarescu
(1998). In the newly designed algorithm the exploration/exploitation of the
search space is adapted on-line based on the current features of the landscape
that is being...
Matheuristics to optimize refueling and maintenance planning of nuclear power plants
Journal of Heuristics - Tập 27 - Trang 63-105 - 2020
Planning the maintenance of nuclear power plants is a complex optimization
problem, involving a joint optimization of maintenance dates, fuel constraints
and power production decisions. This paper investigates Mixed Integer Linear
Programming (MILP) matheuristics for this problem, to tackle large size
instances used in operations with a time scope of 5 years, and few restrictions
with time window ...
A heuristic solution method for node routing based solid waste collection problems
Journal of Heuristics - Tập 19 - Trang 129-156 - 2011
This paper considers a real world waste collection problem in which glass,
metal, plastics, or paper is brought to certain waste collection points by the
citizens of a certain region. The collection of this waste from the collection
points is therefore a node routing problem. The waste is delivered to special
sites, so called intermediate facilities (IF), that are typically not identical
with the ...
Tổng số: 543
- 1
- 2
- 3
- 4
- 5
- 6
- 10