Bounds and valid inequalities for the fixed-route vehicle-refueling problem

被引：2
|
作者：
Schulz, Arne [1 ]
Suzuki, Yoshinori [2 ]
机构：
[1] Univ Hamburg, Inst Operat Management, Moorweidenstrasse 18, D-20148 Hamburg, Germany
[2] Iowa State Univ, Ivy Coll Business, Dept Supply Chain Management, 2340 Gerdin Business Bldg, Ames, IA 50011 USA
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2022年 / 170卷
关键词：
Bounds; Validinequalities; Mixed-integerprogramming; DECISION-SUPPORT-SYSTEM; MODEL;
D O I：
10.1016/j.cie.2022.108340
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The fixed-route vehicle-refueling problem is a daily scheduling problem used by truck companies that seeks the best set of refueling stations (truck stops) for a given route. The paper introduces valid inequalities, lower bounds, as well as methods to reduce the number of stops that can be visited directly after a given stop. We show in a comprehensive computational study that our model formulation reduces the average computation times in comparison with a standard MIP formulation by over 78% on average and by 95% for instances with 2000 truck stops. Instances with 2000 truck stops are solved in less than 0.3 s.
引用
收藏
页数：8
相关论文
共 8 条
1