Mechanisms for local search

Article Abstract:

The performance of two local search methods for combinatorial optimization problems are investigated. Specifically, the first-improving and best-improving pivot rules for choosing a neighboring point with an improved objective function are evaluated within the context of a random model and a structured model, respectively. Numerical experiments with the travelling salesman problem and the quadratic assignment problem using a variant of the two pivot rules are also carried out.

Cases, Combinatorial optimization, Traveling-salesman problem

---

Random search in the one-dimensional cutting stock problem

Article Abstract:

A random search algorithm to the selection of good cutting patterns is introduced and modified for solving the one-dimensional cutting stock problem. To this end, a sequential heuristic for solving the problem with minimal aggregated trim loss and/or minimal number of different patterns is developed. The heuristic results in different but equal solutions with respect to the absolute trim loss.

Case studies

---

The influence of the fitness evaluation method on the performance of multiobjective search algorithms

Article Abstract:

A study is conducted to examine the influence of various fitness evaluation methods on the performance of two multiobjective search algorithms.

United Kingdom, Science & research, Evaluation, Physical fitness

Similar abstracts:

• Abstracts: Guided local search and its application to the traveling salesman problem. Estimating the Held-Karp lower bound for the geometric TSP
• Abstracts: Small business market research. Predictive segmentation in action: using CHAID to segment loyalty card holders
• Abstracts: A cross-national study on the impact of management teams on the rapid internationalization of small firms. The impact of efficacy on work attitudes across cultures
• Abstracts: A bound for the Symmetric Travelling Salesman problem through matroid formulation. Semidefinite descriptions of cones defining spectral mask constraints

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.