Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches
- 1 December 1995
- journal article
- Published by Springer Nature in OR Spectrum
- Vol. 17 (4) , 211-225
- https://doi.org/10.1007/bf01720977
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- Strategies with memories: local search in an application oriented environmentOR Spectrum, 1995
- A robust heuristic for the Generalized Assignment ProblemAnnals of Operations Research, 1994
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Dynamic tabu list management using the reverse elimination methodAnnals of Operations Research, 1993
- A user's guide to tabu searchAnnals of Operations Research, 1993
- A storage assignment policy in a man-on-board automated storage/retrieval systemInternational Journal of Production Research, 1992
- A hybrid algorithm for the generalized assignment problemOptimization, 1991
- Tabu search techniquesOR Spectrum, 1989
- Optimal assignment of orders to parallel working subplants without splittingComputer Integrated Manufacturing Systems, 1989
- A comparison of techniques for solving the fleet size and mix vehicle routing problemOR Spectrum, 1984