A tabu search algorithm for the capacitated shortest spanning tree problem

被引：0
|
作者：
Sharaiha, YM
Gendreau, M
Laporte, G
Osman, IH
机构：
[1] UNIV MONTREAL,CTR RECH TRANSPORTS,MONTREAL,PQ H3C 3J7,CANADA
[2] UNIV LONDON IMPERIAL COLL SCI TECHNOL & MED,SCH MANAGEMENT,LONDON SW7 2PG,ENGLAND
[3] UNIV KENT,DEPT MATH & STAT,CANTERBURY CT2 7NF,KENT,ENGLAND
来源：
NETWORKS | 1997年 / 29卷 / 03期
关键词：
Capacitated shortest spanning tree; tabu search;
D O I：
10.1002/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynamic data structures developed to speed up the algorithm. Computational results on new randomly generated instances and on instances taken from the literature indicate that the proposed approach produces high-quality solutions within reasonable computing times. (C) 1997 John Wiley & Sons, Inc.
引用
收藏
页码：161 / 171
页数：11
相关论文
共 50 条
  • [1] Tabu search for generalized minimum spanning tree problem
    Wang, Zhenyu
    Che, Chan Hou
    Lim, Andrew
    [J]. PRICAI 2006: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4099 : 918 - 922
  • [2] Tabu Search Algorithm for for Capacitated Vehicle Routing Problem
    Ren, Chunyu
    [J]. MATERIALS PROCESSING AND MANUFACTURING III, PTS 1-4, 2013, 753-755 : 3060 - 3063
  • [3] A genetic algorithm for the Capacitated Minimum Spanning Tree problem
    de Lacerda, Estefane George Macedo
    de Medeiros, Manoel Firmino
    [J]. 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 725 - +
  • [4] A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
    Adam Kasperski
    Mariusz Makuchowski
    Paweł Zieliński
    [J]. Journal of Heuristics, 2012, 18 : 593 - 625
  • [5] A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
    Kasperski, Adam
    Makuchowski, Mariusz
    Zielinski, Pawe
    [J]. JOURNAL OF HEURISTICS, 2012, 18 (04) : 593 - 625
  • [6] A tabu search heuristic for the generalized minimum spanning tree problem
    Oncan, Temel
    Cordeau, Jean-Francois
    Laporte, Gilbert
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (02) : 306 - 319
  • [7] A tabu search algorithm for nonlinear minimum spanning tree problems
    Katagiri, Hideki
    Nishizaki, Ichiro
    Sakawa, Masatoshi
    Kato, Kosuke
    Uno, Takeshi
    Hayashida, Tomohiro
    [J]. IMECS 2007: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2007, : 2357 - +
  • [8] A deterministic tabu search algorithm for the capacitated arc routing problem
    Brandao, Jose
    Eglese, Richard
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) : 1112 - 1126
  • [9] An exact algorithm for the capacitated shortest spanning arborescence
    Toth, P
    Vigo, D
    [J]. ANNALS OF OPERATIONS RESEARCH, 1995, 61 : 121 - 141
  • [10] A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
    Lu, Yongliang
    Benlic, Una
    Wu, Qinghua
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 144
12345