Heuristic approach for bandwidth consecutive multi-coloring problem

Author:

Srivastava Stuti1,Bansal Richa1,Thapar Antika1

Affiliation:

1. Department of Mathematics, Faculty of Science, Dayalbagh Educational Institute, Agra, U.P., India

Abstract

Bandwidth consecutive multicoloring problem is also known as a b-coloring problem. Let G = (V, E) be a graph where V is the set of vertices and E is the set of edges. Let each vertex v of V has a positive integer weight b (v) and each edge (v, w) of E has a non-negative integer weight b (v, w). A bandwidth consecutive multicoloring of a graph is a problem of assigning b (v) consecutive positive integers to each vertex v of V in such a manner that the difference between all the integers of vertex v and all the integers of vertex w is greater than b (v, w). The maximum integer assigned in this coloring is called the span of the coloring. The b-coloring is the problem of minimizing this span. No metaheuristic is proposed for general graphs so far for this problem till date as it is strongly NP-hard. In this paper, we proposed three heuristics for the problem including a greedy randomized adaptive search procedure (GRASP). The efficiency of these algorithms is tested on benchmark graphs and their performance is compared among themselves. Experimental results showed that among all three proposed heuristics, GRASP performed well for the given problem.

Publisher

IOS Press

Subject

Artificial Intelligence,General Engineering,Statistics and Probability

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3