作者: S. Salcedo-Sanz , Á. Perez-Bellido , E. Ortiz-García , A. Portilla-Figueras , M. Naldi
DOI: 10.1109/HIS.2008.38
关键词: Quality of service 、 Computer network 、 Real-time computing 、 Upper and lower bounds 、 Evolutionary algorithm 、 Source code 、 Service (business) 、 Evolutionary computation 、 Computer science 、 Huffman coding 、 Tree (data structure)
摘要: Call centers represent now an important channel for customer care activities. Most services provided by call are accomplished in automated way to save operational costs. The is guided through a menu of options, which can be represented as service tree, down the desired service. In order meet QoS constraints tree must designed minimize average time. An optimization algorithm, based on combined use Dandelion encoding and evolutionary operators, proposed here design trees with minimum algorithm provides whose time lower than that obtained reference Huffman coding typically within 2% absolute bound entropic bound.