CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Evolutionary Algorithm to improve the existing solution of Broadcast Scheduling Problem

Published on May 2012 by R. K. Shrivastava, Reenu Shrivastava, Harshalata Rohida, Khushboo Shrama
journal_cover_thumbnail

National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011
Foundation of Computer Science USA
RTMC - Number 7
May 2012
Authors: R. K. Shrivastava, Reenu Shrivastava, Harshalata Rohida, Khushboo Shrama
52b1bd60-5f2d-4aef-bded-124b26448f1a

R. K. Shrivastava, Reenu Shrivastava, Harshalata Rohida, Khushboo Shrama . An Evolutionary Algorithm to improve the existing solution of Broadcast Scheduling Problem. National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011. RTMC, 7 (May 2012), 26-30.

@article{
author = { R. K. Shrivastava, Reenu Shrivastava, Harshalata Rohida, Khushboo Shrama },
title = { An Evolutionary Algorithm to improve the existing solution of Broadcast Scheduling Problem },
journal = { National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011 },
issue_date = { May 2012 },
volume = { RTMC },
number = { 7 },
month = { May },
year = { 2012 },
issn = 0975-8887,
pages = { 26-30 },
numpages = 5,
url = { /proceedings/rtmc/number7/6671-1054/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011
%A R. K. Shrivastava
%A Reenu Shrivastava
%A Harshalata Rohida
%A Khushboo Shrama
%T An Evolutionary Algorithm to improve the existing solution of Broadcast Scheduling Problem
%J National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011
%@ 0975-8887
%V RTMC
%N 7
%P 26-30
%D 2012
%I International Journal of Computer Applications
Abstract

The present work is introducing a technique to improve the solution of an existing heuristic based Generalized Assignment Problem (GAP). The proposed approach presents the design implementation and simulation results for a Broadcast Scheduling Problem (BSP). The objective is to provide a collision free broadcast schedule which minimize the total frame length and maximize the slot utilization within in frame. In this paper the Genetic algorithm is applied in a way which is reduces the amount of involvement required to understand the existing solution. The result obtained confirms the efficiency and the effectiveness of Genetic Algorithm (GA) to provide good solution.

References
  1. Baker, B. M. and M. A. Ayechew, "A genetic algorithm for the vehicle routing problem," Computers & Operations Research, 30, 2003,pp. 787-800 .
  2. Chu PC, Beasley JE. "Agenetic algorithm for the generalized assignment problem". Computers & Operations Research ,1997
  3. Colorni A. , M. Dorigo, F. Maffioli, V. Maniezzo, G. Righini and M. Trubian, "Heuristics from nature for ard combinatorial problems," International Transactions n Operational Research, 3(1), 1996,pp. 1-21.
  4. G. Winter, J. Periaux & M. Galan, "Genetic Algorithms in Engineering and Computer Science" published by JOHN WILEY & SON Ltd. ,1995.
  5. Yeo, J. , H. Lee and S. Kim, "An Efficient Broadcast Scheduling Algorithm for TDMA Ad-hoc Networks". Computer and Operation Research ,2002.
Index Terms

Computer Science
Information Sciences

Keywords

Generalized Assignment Problem (gap) Broadcast Scheduling Problem (bsp) Genetic Algorithm (ga).