Dynamic trucking equilibrium through a freight exchange

John Miller, Yu Nie*

*Corresponding author for this work

Research output: Contribution to journalConference article

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 languageEnglish (US)
Pages (from-to)320-340
Number of pages21
JournalTransportation Research Procedia
Volume38
DOIs
StatePublished - Jan 1 2018
Event23rd International Symposium on Transportation and Traffic Theory, ISTTT 2019 - Lausanne, Switzerland
Duration: Jul 24 2018Jul 26 2018

Fingerprint

Trucks
profit
equilibrium model
system model
interaction
Profitability
heuristics
Optimal systems
efficiency
China
Visibility
experiment
Experiments

Keywords

  • Dynamic trucking equilibrium
  • Hyperpath
  • Method of successive average
  • Online freight exchange
  • Variational inequality problem

ASJC Scopus subject areas

  • Transportation

Cite this

@article{1f38ac42af1242a9a70ff126d9064e5d,
title = "Dynamic trucking equilibrium through a freight exchange",
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.",
keywords = "Dynamic trucking equilibrium, Hyperpath, Method of successive average, Online freight exchange, Variational inequality problem",
author = "John Miller and Yu Nie",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.trpro.2019.05.018",
language = "English (US)",
volume = "38",
pages = "320--340",
journal = "Transportation Research Procedia",
issn = "2352-1457",
publisher = "Elsevier BV",

}

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 journalConference 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 -