Composite variable formulations for express shipment service network design

被引:104
作者
Armacost, AP [1 ]
Barnhart, C
Ware, KA
机构
[1] USAF Acad, Dept Management, Colorado Springs, CO 80840 USA
[2] MIT, Dept Civil & Environm Engn, Cambridge, MA 02139 USA
[3] United Parcel Serv, Operat Res Grp, Louisville, KY 40223 USA
关键词
D O I
10.1287/trsc.36.1.1.571
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we describe a new approach to solving the express shipment service network design problem. Conventional polyhedral methods for network design and network loading problems do not consistently solve instances of the planning problem we consider. Under a restricted version of the problem, we transform conventional formulations to a new formulation using what we term composite variables. By removing flow decisions as explicit decisions, this extended formulation is cast purely in terms of the design elements. We establish that its linear programming relaxation gives stronger lower bounds than conventional approaches. We apply this composite variable formulation approach to the UPS Next Day Air delivery network and demonstrate potential annual cost savings in the hundreds of millions of dollars.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 37 条
[1]   WHEN TREES COLLIDE - AN APPROXIMATION ALGORITHM FOR THE GENERALIZED STEINER PROBLEM ON NETWORKS [J].
AGRAWAL, A ;
KLEIN, P ;
RAVI, R .
SIAM JOURNAL ON COMPUTING, 1995, 24 (03) :440-456
[2]  
ARMACOST AP, 2002, IN PRESS INTERFACES
[3]   Network design using cut inequalities [J].
Barahona, F .
SIAM JOURNAL ON OPTIMIZATION, 1996, 6 (03) :823-837
[4]   Air network design for express shipment service [J].
Barnhart, C ;
Schneur, RR .
OPERATIONS RESEARCH, 1996, 44 (06) :852-863
[5]  
BARNHART C, 2000, EXTENDING FLEET ASSI
[6]   From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems [J].
Bertsimas, D ;
Teo, CP .
OPERATIONS RESEARCH, 1998, 46 (04) :503-514
[7]   Minimum cost capacity installation for multicommodity network flows [J].
Bienstock, D ;
Chopra, S ;
Gunluk, O ;
Tsai, CY .
MATHEMATICAL PROGRAMMING, 1998, 81 (02) :177-199
[8]  
Bienstock D., 1996, INFORMS Journal on Computing, V8, P243, DOI 10.1287/ijoc.8.3.243
[9]   COMPUTATIONAL EXPERIENCE WITH A DIFFICULT MIXED-INTEGER MULTICOMMODITY FLOW PROBLEM [J].
BIENSTOCK, D ;
GUNLUK, O .
MATHEMATICAL PROGRAMMING, 1995, 68 (02) :213-237
[10]   A hybrid Tabu Search/Branch-and-Bound algorithm for the direct flight network design problem [J].
Büdenbender, K ;
Grünert, T ;
Sebastian, HJ .
TRANSPORTATION SCIENCE, 2000, 34 (04) :364-380