THE EQUITY CONSTRAINED SHORTEST-PATH PROBLEM

被引：24

作者：

GOPALAN, R ^{[1
]}

BATTA, R ^{[1
]}

KARWAN, MH ^{[1
]}

机构：

[1] SUNY BUFFALO, DEPT IND ENGN, BUFFALO, NY 14260 USA

来源：

COMPUTERS & OPERATIONS RESEARCH | 1990年 / 17卷 / 03期

关键词：

D O I：

10.1016/0305-0548(90)90006-S

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper examines the problem of finding the shortest path on a network subject to "equity" constraints. A Lagrangean dual bounding approach is utilized, which relaxes the "complicating constraints" of the problem. After solving the Lagrangean dual, the duality gap is closed by finding the t shortest paths with respect to the Lagrangean function. Both looping and loopless paths are considered. A quick-and-dirty heuristic procedure is also suggested. We report a sampling of our computational experiences with the model. © 1990.

引用

页码：297 / 307

页数：11

共 17 条

[1] DEVELOPING A RISK COST FRAMEWORK FOR ROUTING TRUCK MOVEMENTS OF HAZARDOUS MATERIALS [J].