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:
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 M......
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......
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......
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 ......
A multiobjective metaheuristic for a mean-risk multistage capacity investment problem
Journal of Heuristics - Tập 16 - Trang 85-115 - 2008
We propose a multiobjective local search metaheuristic for a mean-risk multistage capacity investment problem with irreversibility, lumpiness and economies of scale in capacity costs. Conditional value-at-risk is considered as a risk measure. Results of a computational study are presented and indicate that the approach is capable of producing high-quality approximations to the efficient sets with ......
A Response to “On method overfitting”
Journal of Heuristics - Tập 5 - Trang 109-111 - 1999
If special-purpose methods can be overfitted to benchmarks, so can general methods.
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......
Tổng số: 543
- 1
- 2
- 3
- 4
- 5
- 6
- 10