A Dynamic Information Sending Model and the Optimization Algorithm for Customer Relationship Management

A dynamic discount information sending problem and its bi-level programming model for customer relationship management were presented in this paper. The intelligent algorithms were proposed to optimize the model. The simulated annealing algorithm (SA) was applied to optimize the brand information sending policy in up-level. The customerspsila purchase behaviors were simulated by cellular automata (CA). The SA used three neighborhoods to expand the search region on the basis of binary-coding. The state of cellular was affected by the neighbor state, the frequency of purchase, the interval of purchase and the message sending policy of the cellular. An experiment was used to testify the validity of the algorithms to the bi-level optimization model for customer relationship management, and some significative conclusions were gotten in this example.