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:
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......
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......
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 ......
On global warming: Flow-based soft global constraints
Journal of Heuristics - Tập 12 - Trang 347-373 - 2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that can be represented by a flow in a graph. Such constraints are softened by adding violation arcs to the graph and then computing a minimum-weight flow in the extended graph to measure the violation. We present efficient pr......
Basic variable neighborhood search for the minimum sitting arrangement problem
Journal of Heuristics - Tập 26 - Trang 249-268 - 2020
The minimum sitting arrangement (MinSA) problem is a linear layout problem consisting in minimizing the number of errors produced when a signed graph is embedded into a line. This problem has been previously tackled by theoretical and heuristic approaches in the literature. In this paper we present a basic variable neighborhood search (BVNS) algorithm for solving the problem. First, we introduce a......
The parking allocation problem for connected vehicles
Journal of Heuristics - Tập 26 - Trang 377-399 - 2018
In this paper, we propose a parking allocation model that takes into account the basic constraints and objectives of a problem where parking lots are assigned to vehicles. We assume vehicles are connected and can exchange information with a central intelligence. Vehicle arrival times can be provided by a GPS device, and the estimated number of available parking slots, at each future time moment an......
Hybrid evolutionary algorithm for the b-chromatic number
Journal of Heuristics - Tập 21 - Trang 501-521 - 2015
The b-chromatic number of a graph
$$G$$
is a maximum integer
$$\varphi (G)$$
for which there......
Pareto-based evolutionary multiobjective approaches and the generalized Nash equilibrium problem
Journal of Heuristics - Tập 26 - Trang 561-584 - 2020
Pareto-based evolutionary multiobjective approaches are methods that use the Pareto dominance concept to guide the search of evolutionary algorithms towards the Pareto frontier of a problem. To address the challenge of providing an entire set of optimal solutions they use specially designed mechanisms for preserving search diversity and maintaining the non-dominated solutions set. The limitation o......
Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances
Journal of Heuristics - Tập 26 - Trang 851-883 - 2020
This work presents a statistically principled method for estimating the required number of instances in the experimental comparison of multiple algorithms on a given problem class of interest. This approach generalises earlier results by allowing researchers to design experiments based on the desired best, worst, mean or median-case statistical power to detect differences between algorithms larger......
Reactive Tabu Search and Sensor Selection in Active Structural Acoustic Control Problems
Journal of Heuristics - Tập 4 - Trang 199-220 - 1998
A Reactive Tabu Search (RTS) is examined. In addition to a dynamic tabu tenure RTS also detects when the search has entered an unproductive area and restarts RTS based on distinctive features of the unproductive area. We explore the effectiveness of RTS over a static tabu list (of a kind used in many implementations) for a two variable unconstrained discrete optimization model with 9 nearly identi......
Tổng số: 543
- 1
- 2
- 3
- 4
- 5
- 6
- 10