Méthodes heuristiques pour le problème du T-coloriage avec ensembles

IF 1.8 4区管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Rairo-Operations Research Pub Date : 1998-01-01 DOI:10.1051/RO/1998320100751

M. Jiang

引用次数: 4

Abstract

We are interested in heuristics for the set T-coloring problem, in order to solve a huge frequency allocation problem in civil aviation. The goal is to minimize the frequency bandwidth. Two heuristic methods are studied and experimented: dynamic Order and Tabu search. An hybridisation of these methods is used as well. The results show a swift convergence of the dynamic Order, and the Tabu search is a good tool to improve solutions.

查看原文本刊更多论文

集合t着色问题的启发式方法

为了解决民用航空中一个巨大的频率分配问题，我们对集合t染色问题的启发式方法感兴趣。目标是最小化频率带宽。研究并实验了两种启发式方法:动态顺序搜索和禁忌搜索。这些方法的杂交也被使用。结果表明，动态阶数收敛速度快，禁忌搜索是改进解的一个很好的工具。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Rairo-Operations Research 管理科学-运筹学与管理科学

CiteScore

3.60

自引率

22.20%

发文量

206

审稿时长

>12 weeks

期刊介绍： RAIRO-Operations Research is an international journal devoted to high-level pure and applied research on all aspects of operations research. All papers published in RAIRO-Operations Research are critically refereed according to international standards. Any paper will either be accepted (possibly with minor revisions) either submitted to another evaluation (after a major revision) or rejected. Every effort will be made by the Editorial Board to ensure a first answer concerning a submitted paper within three months, and a final decision in a period of time not exceeding six months.