Solving the Response Time Variability Problem by means of metaheuristics

Authors:
Alberto García;Rafael Pastor;Albert Corominas
Affiliations:
Institut d'Organització i Control de Sistemes Industrials (IOC), Universitat Politècnica de Catalunya, Barcelona, Spain;Institut d'Organització i Control de Sistemes Industrials (IOC), Universitat Politècnica de Catalunya, Barcelona, Spain;Institut d'Organització i Control de Sistemes Industrials (IOC), Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
Proceedings of the 2006 conference on Artificial Intelligence Research and Development
Year:
2006

Citing 3
Cited 5

Time Slot Allocation for Real-Time Messages with Negotiable Distance Constrains

RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
A discrete version of particle swarm optimization for flowshop scheduling problems

Computers and Operations Research
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

Operations Research

Introducing dynamic diversity into a discrete particle swarm optimization

Computers and Operations Research
Solving the Response Time Variability Problem by means of Multi-start and GRASP metaheuristics

Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Solving the response time variability problem by means of a psychoclonal approach

Journal of Heuristics
Using aggregation to reduce response time variability in cyclic fair sequences

Journal of Scheduling
A parametric multi-start algorithm for solving the response time variability problem

LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.