Abstract
This paper proposes a new hyperpath-based dynamic trucking equilibrium (DTE) assignment model. Unlike existing freight assignment models, we focus on the interactions between individual truck operators that solely compete for loads advertised on an online freight exchange. The competitors are assumed to follow optimal bidding and routing strategies - represented using a hyperpath - to maximize their expected profit. The proposed DTE model (1) predicts system-wide truck flows (including empty truck flows), (2) identifies efficiency improvements gained by network-wide visibility, and (3) lays the foundation for building a system optimal model. We rewrite the DTE conditions as a variational inequality problem (VIP) and discuss the analytical properties of the formulation, including solution existence. A heuristic solution algorithm is developed to solve the VIP, which consists of three modules: a dynamic network loading procedure for mapping hyperpath flows onto the freight network, a column generation scheme for creating hyperpaths as needed, and a method of successive average for equilibrating profits on existing hyperpaths. The model and the solution algorithm are validated by numerical experiments constructed from empirical data collected in China. The results show that the DTE solutions outperform with wide margin the benchmark solutions that either ignore inter-truck interactions or operate trucks according to suboptimal routing and bidding decisions.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 320-340 |
| Number of pages | 21 |
| Journal | Transportation Research Procedia |
| Volume | 38 |
| DOIs | |
| State | Published - Jan 1 2018 |
| Event | 23rd International Symposium on Transportation and Traffic Theory, ISTTT 2019 - Lausanne, Switzerland Duration: Jul 24 2018 → Jul 26 2018 |
Fingerprint
Keywords
- Dynamic trucking equilibrium
- Hyperpath
- Method of successive average
- Online freight exchange
- Variational inequality problem
ASJC Scopus subject areas
- Transportation
Cite this
}
Dynamic trucking equilibrium through a freight exchange. / Miller, John; Nie, Yu.
In: Transportation Research Procedia, Vol. 38, 01.01.2018, p. 320-340.Research output: Contribution to journal › Conference article
TY - JOUR
T1 - Dynamic trucking equilibrium through a freight exchange
AU - Miller, John
AU - Nie, Yu
PY - 2018/1/1
Y1 - 2018/1/1
N2 - This paper proposes a new hyperpath-based dynamic trucking equilibrium (DTE) assignment model. Unlike existing freight assignment models, we focus on the interactions between individual truck operators that solely compete for loads advertised on an online freight exchange. The competitors are assumed to follow optimal bidding and routing strategies - represented using a hyperpath - to maximize their expected profit. The proposed DTE model (1) predicts system-wide truck flows (including empty truck flows), (2) identifies efficiency improvements gained by network-wide visibility, and (3) lays the foundation for building a system optimal model. We rewrite the DTE conditions as a variational inequality problem (VIP) and discuss the analytical properties of the formulation, including solution existence. A heuristic solution algorithm is developed to solve the VIP, which consists of three modules: a dynamic network loading procedure for mapping hyperpath flows onto the freight network, a column generation scheme for creating hyperpaths as needed, and a method of successive average for equilibrating profits on existing hyperpaths. The model and the solution algorithm are validated by numerical experiments constructed from empirical data collected in China. The results show that the DTE solutions outperform with wide margin the benchmark solutions that either ignore inter-truck interactions or operate trucks according to suboptimal routing and bidding decisions.
AB - This paper proposes a new hyperpath-based dynamic trucking equilibrium (DTE) assignment model. Unlike existing freight assignment models, we focus on the interactions between individual truck operators that solely compete for loads advertised on an online freight exchange. The competitors are assumed to follow optimal bidding and routing strategies - represented using a hyperpath - to maximize their expected profit. The proposed DTE model (1) predicts system-wide truck flows (including empty truck flows), (2) identifies efficiency improvements gained by network-wide visibility, and (3) lays the foundation for building a system optimal model. We rewrite the DTE conditions as a variational inequality problem (VIP) and discuss the analytical properties of the formulation, including solution existence. A heuristic solution algorithm is developed to solve the VIP, which consists of three modules: a dynamic network loading procedure for mapping hyperpath flows onto the freight network, a column generation scheme for creating hyperpaths as needed, and a method of successive average for equilibrating profits on existing hyperpaths. The model and the solution algorithm are validated by numerical experiments constructed from empirical data collected in China. The results show that the DTE solutions outperform with wide margin the benchmark solutions that either ignore inter-truck interactions or operate trucks according to suboptimal routing and bidding decisions.
KW - Dynamic trucking equilibrium
KW - Hyperpath
KW - Method of successive average
KW - Online freight exchange
KW - Variational inequality problem
UR - http://www.scopus.com/inward/record.url?scp=85074948529&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85074948529&partnerID=8YFLogxK
U2 - 10.1016/j.trpro.2019.05.018
DO - 10.1016/j.trpro.2019.05.018
M3 - Conference article
AN - SCOPUS:85074948529
VL - 38
SP - 320
EP - 340
JO - Transportation Research Procedia
JF - Transportation Research Procedia
SN - 2352-1457
ER -