Institutional designs to face the dark side of total allowable catches

Setting total allowable catches (TACs) is an endogenous process in which different agents and institutions, often with conflicting interests and opportunistic behaviour, try to influence policy-makers. Such policy-makers, far from being the benevolent social planners many would wish them to be, may also pursue self-interest when making final decisions. Although restricted knowledge of stock abundance and population dynamics, and weakness in enforcement, have effects, these other factors may explain the reason why TAC management has failed to guarantee sustainable exploitation of fish resources. Rejecting the exogeneity of the TAC and taking advantage of fruitful debate on economic policy (i.e. the rules vs. discretion debate, and that surrounding the independence of central banks), two institutional developments are analysed as potential mechanisms to face up to misconceptions about TACs: long-term harvest control rules, and a central bank of fish.

The Linear Ordering Problem Revisited

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.

Instances of combinatorial optimization problems: complexity and generation

138 p.