SOLVING TRANSPORTATION PROBLEMS WITH NONLINEAR SIDE CONSTRAINTS WITH TABU SEARCH

被引：34

作者：

CAO, BY ^{[1
]}

UEBE, G ^{[1
]}

机构：

[1] UNIV ARMED FORCES HAMBURG,DEPT ECON & ORG SCI,D-22039 HAMBURG,GERMANY

来源：

COMPUTERS & OPERATIONS RESEARCH | 1995年 / 22卷 / 06期

关键词：

D O I：

10.1016/0305-0548(94)00055-D

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

An algorithm based on tabu search ideas is developed to solve transportation problems with nonlinear side constraints. We show how to superimpose the tabu search (TS) framework conveniently on basis exchange (or ''pivoting'') operations specialized to the transportation network context, and thereby to guide these operations to overcome the limitations of local optimality. Using an exact algorithm as a benchmark, our computational study demonstrates the effectiveness of the procedure, and suggests the relevance of similar TS applications for solving other optimization problems that can be formulated as network problems with complicated nonlinear side constraints.

引用

页码：593 / 603

页数：11