Manpower allocation using genetic annealing

✍ Scribed by Nicolas Abboud; Masahiro Inuiguchi; Masatoshi Sakawa; Yoshio Uemura

• Book ID: 104339597
• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 259 KB
• Volume: 111
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(97)00326-3

✦ Synopsis

In this paper, we focus on a real size manpower allocation problem. It was modeled after a real world problem of distributing the salesmen force over the branches of a company. The problem includes multiple objectives and the number of salesmen at each branch is unspeci®ed. Conventional integer programming approach and conventional metaheuristics seem to have problems with solving the large size version of this problem. The versatility of our proposed heuristics based on a modi®cation of genetic annealing is exempli®ed through solving the real size manpower allocation problem. For comparison sake, several small sized versions were solved using our method, conventional integer programming approach, and some well known metaheuristics.