A hybrid genetic algorithm for the Three-Index Assignment Problem
详细信息    查看全文
文摘
The Three-Index Assignment Problem (AP3) is well-known problem which has been shown to be -hard. This problem has been studied extensively, and many exact and heuristic methods have been proposed to solve it. Inspired by the classical assignment problem, we propose a new local search heuristic which solves the problem by simplifying it to the classical assignment problem. We further hybridize our heuristic with the genetic algorithm (GA). Extensive experimental results indicate that our hybrid method is superior to all previous heuristic methods including those proposed by Balas and Saltzman [Operations Research 39 (1991) 150–161], Crama and Spieksma [European Journal of Operational Research 60 (1992) 273–279], Burkard et al. [Discrete Applied Mathematics 65 (1996) 123–169], and Aiex et al. [GRASP with path relinking for the three-index assignment problem, Technical report, INFORMS Journal on Computing, in press. Available from: <http://www.research.att.com/~mgcr/doc/g3index.pdf>].

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址：北京市海淀区学院路29号 邮编：100083

电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700