Solving the Response Time Variability Problem by means of metaheuristics

The Response Time Variability Problem (RTVP) is a combinatorial NP-hard problem which has a wide range of real-life applications. It has recently appeared in the literature and has therefore not been widely discussed to date. The RTVP has been solved in other works by mixed integer linear programming (for small instances) and heuristics, but metaheuristic procedures have not previously been used. In this paper, a solution to the RTVP by means of multi-start, GRASP and PSO procedures is proposed. We report on our computational experiments and draw conclusions.

[1]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[2]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[3]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[4]  Manuel Laguna,et al.  Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..

[5]  Wieslaw Kubiak,et al.  Response Time Variability 1 , 2004 .

[6]  Rami G. Melhem,et al.  Time slot allocation for real-time messages with negotiable distance constraints , 1998, Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245).

[7]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.