𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tabu search Hooke and Jeeves algorithm for unconstrained optimization

✍ Scribed by K.S. Al-Sultan; M.A. Al-Fawzan

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
566 KB
Volume
103
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A parallel tabu search for conformationa
A parallel tabu search for conformational energy optimization of oligopeptides
✍ Morales, L. B.; GarduοΏ½o-JuοΏ½rez, R.; Aguilar-Alvarado, J. M.; Riveros-Castro, F. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 213 KB πŸ‘ 2 views

We have developed and implemented a tabu search heuristic (TS) to determine the best energy minimum for oligopeptides. Our test molecule was Met-enkephalin, a pentapetide that over the years has been used as a validation model for many global optimizers. The test potential energy function was ECEPP/

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami

A tabu search algorithm for the multi-tr
A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
✍ JosΓ© BrandΓ£o; Alan Mercer πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 907 KB

This paper describes a novel tabu search heuristic for the multi-trip vehicle routing and scheduling problem (MTVRSP). The method was developed to tackle real distribution problems, taking into account most of the constraints that appear in practice. In the MTVRSP, besides the constraints that are c

A combined global and local search metho
A combined global and local search method to deal with constrained optimization for continuous tabu search
✍ Xi Chen; Jing Yang; Zhaohua Li; Daqing Tian; Zhijiang Shao πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 269 KB

## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some