3 resultados para Pareto-optimal solutions
Resumo:
Pulse fishing may be a global optimal strategy in multicohort fisheries. In this article we compare the pulse fishing solutions obtained by using global numerical methods with the analytical stationary optimal solution. This allows us to quantify the potential benefits associated with the use of periodic fishing in the Northern Stock of hake. Results show that: first, management plans based exclusively on traditional reference targets as Fmsy may drive fishery economic results far from the optimal; second, global optimal solutions would imply, in a cyclical manner, the closure of the fishery for some periods and third, second best stationary policies with stable employment only reduce optimal present value of discounted profit in a 2%.
Resumo:
The Linear Ordering Problem is a popular combinatorial optimisation problem which has been extensively addressed in the literature. However, in spite of its popularity, little is known about the characteristics of this problem. This paper studies a procedure to extract static information from an instance of the problem, and proposes a method to incorporate the obtained knowledge in order to improve the performance of local search-based algorithms. The procedure introduced identifies the positions where the indexes cannot generate local optima for the insert neighbourhood, and thus global optima solutions. This information is then used to propose a restricted insert neighbourhood that discards the insert operations which move indexes to positions where optimal solutions are not generated. In order to measure the efficiency of the proposed restricted insert neighbourhood system, two state-of-the-art algorithms for the LOP that include local search procedures have been modified. Conducted experiments confirm that the restricted versions of the algorithms outperform the classical designs systematically. The statistical test included in the experimentation reports significant differences in all the cases, which validates the efficiency of our proposal.
Resumo:
33 p.