SOLVING THE OPTIMAL NETWORK PROBLEM

被引：9

作者：

BOFFEY, TB

HINXMAN, AI

机构：

[1] Department of Computational and Statistical Science, University of Liverpool, Liverpool

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1979年 / 3卷 / 05期

关键词：

D O I：

10.1016/0377-2217(79)90118-8

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A heuristic method for solving the optimal network problem is proposed and shown to yield high quality results. Solution methods based on Branch-and-Bound techniques are also considered in some detail. The effects of making various approximations, when calculating lower bounds, is discussed and the concept of forced moves introduced. The various methods are applied to a series of problems which include networks with link construction cost not proportional to length and with trip demands tij not all equal. © 1979.

引用

页码：386 / 393

页数：8

共 11 条

[1] OPTIMAL NETWORK PROBLEM - BRANCH-AND-BOUND ALGORITHM [J].

BOYCE, DE ;

FARHI, A ;

WEISCHEDEL, R .

ENVIRONMENT AND PLANNING A, 1973, 5 (04) :519-533

[2]

DIONNE R, 1977, 238 U MONTR DEP INF

[3] EXPERIMENTS WITH GRAPH TRAVERSER PROGRAM [J].

DORAN, JE ;

MICHIE, D .

PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL AND PHYSICAL SCIENCES, 1966, 294 (1437) :235-&

[4]

HOANG HH, 1973, MANAGE SCI, V19, P488

[5]

JOHNSON DS, 1976, COMPLEXITY NETWORK D

[6]

MARTELLO S, 1977, EUROP J OPERATIONAL, P1

[7]

Nilsson N.J., 1971, PROBLEM SOLVING METH

[8]

Pearman A. D., 1974, Engineering Optimization, V1, P37, DOI 10.1080/03052157408960575

[9]

PEARMAN AD, 1977, CP77 P COMB PROGR C, P224

[10]

SCOTT AJ, 1971, COMBINATORIAL PROGRA

← 1 2 →