Discrete Differential Evolution Algorithm for Solving the Terminal Assignment Problem

Terminal Assignment is an important problem in telecommunication networks. The main objective is to assign a given collection of terminals to a given collection of concentrators. In this paper, we propose a Discrete Differential Evolution (DDE) algorithm for solving the Terminal Assignment problem. Differential Evolution algorithm is an evolutionary computation algorithm. This method has proved to be of practical success in a variety of problem domains. However, it does not perform well on dealing with Terminal Assignment problem because it uses discrete decision variables. To remedy this, a DDE algorithm is proposed to solve this problem. The results are compared to those given by some existing heuristics. We show that the proposed DDE algorithm is able to achieve feasible solutions to Terminal Assignment instances, improving the results obtained by previous approaches.

[1]  Xin Yao,et al.  Non-standard cost terminal assignment problems using tabu search approach , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[2]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[3]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[4]  Xin Yao,et al.  Hybrid Evolutionary Approaches to Terminal Assignment in Communications Networks , 2005 .

[5]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times , 2008, IEEE Congress on Evolutionary Computation.

[6]  Xin Yao,et al.  A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[7]  Mehmet Fatih Tasgetiren,et al.  A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[8]  Miguel A. Vega-Rodríguez,et al.  A Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problem , 2009, IWANN.

[9]  Sami Khuri,et al.  Heuristic algorithms for the terminal assignment problem , 1997, SAC '97.

[10]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

[11]  Miguel A. Vega-Rodríguez,et al.  Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm , 2008, DCAI.

[12]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[13]  Mehmet Fatih Tasgetiren,et al.  A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[14]  Miguel A. Vega-Rodríguez,et al.  A Hybrid DE Algorithm with a Multiple Strategy for Solving the Terminal Assignment Problem , 2010, SETN.

[15]  Roger L. Wainwright,et al.  Terminal assignment in a communications network using genetic algorithms , 1994, CSC '94.

[16]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[17]  Luis Martínez-López,et al.  COMAS: A Multi-agent System for Performing Consensus Processes , 2011, DCAI.