Tabu search for the multilevel generalized assignment problem

Article Abstract:

The multilevel generalized assignment problem (MGAP) of task allocation considers agents as capable of performing tasks at more than one efficiency level. This differentiates it from classical generalized assignment problems (GAP). A heuristic approach which uses a novel tabu search (TS) application was developed to solve the MGAP. The TS method's search neighborhoods are defined by ejection chains. The TS method was also effective in solving difficult GAP events.

Models, Production planning

---

Tabu search - wellsprings and challenges

Article Abstract:

Tabu search, a method utilized in optimization, sprang into existence from a graduate intelligence course that sought solutions to integer programming problems in the early 1960s. Tabu is a word used by Tongans in Polynesia to indicate things that are sacred and cannot be touched. The fundamental link to the meaning of tabu in tabu search may be the fact that tabus are transmitted by means of a social memory which is subject to modification over time.

Operations Research, Methods, Management science, History, Integer programming, Problem solving

---

Logic cuts for multilevel generalized assignment problems

Article Abstract:

In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. All contiguous 1-cuts for every knapsack in large MGAP's problems are generated and the effects of adding these cuts in the experimental results are reported.

Mathematical logic, Mathematical ability, Symbolic and mathematical logic

Similar abstracts:

• Abstracts: An efficient algorithm for a generalized joint replenishment problem. An efficient optimal solution method for the joint replenishment problem
• Abstracts: A heuristic solution for fuzzy mixed-model line balancing problem. Fuzzy stochastic goal programming problems
• Abstracts: A heuristic algorithm for the asymmetric capacitated vehicle routing problem. A clustering algorithm for item assignment in a synchronized zone order picking system
• Abstracts: A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment
• Abstracts: Two simulated annealing-based heuristics for the job shop scheduling problem. Deterministic job-shop scheduling: past, present and future

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