Abstract
In resource allocation problems, it is possible to define the local efficiency of a small change, namely the ratio of change in value to marginal cost. This efficiency can be used to “guide” the exploration of an otherwise stochastic method like simulated annealing. An algorithm embodying this idea, termed efficiency-guided addition, subtraction, and permutation, (EGASP), is described for problems akin to the traveling salesman problem.
Original language | English (US) |
---|---|
Pages (from-to) | 394-396 |
Number of pages | 3 |
Journal | Journal of Guidance, Control, and Dynamics |
Volume | 11 |
Issue number | 5 |
DOIs | |
State | Published - 1988 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Aerospace Engineering
- Space and Planetary Science
- Electrical and Electronic Engineering
- Applied Mathematics