Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions

Miguel Andres Figliozzi; Hani S. Mahmassani; Patrick Jaillet

doi:10.3141/1882-02

Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions

Miguel Andres Figliozzi^*, Hani S. Mahmassani, Patrick Jaillet

^*Corresponding author for this work

Civil and Environmental Engineering

Research output: Contribution to journal › Article › peer-review

26 Scopus citations

Abstract

Technologies for a dynamic truckload pickup-and-delivery problem in a competitive environment by use of sequential auctions are compared. In this environment, demands arrive randomly over time and are described by pickup-and-delivery locations and hard time windows. On demand arrival, carriers compete for the loads in a second-price auction. Four fleet assignment technologies with different degrees of sophistication are tested with simulations. The technologies differ in how they deal with the combinatorial and stochastic elements of the online problem. A one-step look-ahead dynamic vehicle routing technology that tries to estimate the impacts of current decisions on serving future loads (not yet arrived) is introduced. The performance of each technology is analyzed in relation to different demand characteristics.

Original language	English (US)
Pages (from-to)	10-18
Number of pages	9
Journal	Transportation Research Record
Issue number	1882
DOIs	https://doi.org/10.3141/1882-02
State	Published - Jan 1 2004

ASJC Scopus subject areas

Civil and Structural Engineering
Mechanical Engineering

Access to Document

10.3141/1882-02

Cite this

@article{b3d90d242d894928ad4910426715e1f9,

title = "Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions",

abstract = "Technologies for a dynamic truckload pickup-and-delivery problem in a competitive environment by use of sequential auctions are compared. In this environment, demands arrive randomly over time and are described by pickup-and-delivery locations and hard time windows. On demand arrival, carriers compete for the loads in a second-price auction. Four fleet assignment technologies with different degrees of sophistication are tested with simulations. The technologies differ in how they deal with the combinatorial and stochastic elements of the online problem. A one-step look-ahead dynamic vehicle routing technology that tries to estimate the impacts of current decisions on serving future loads (not yet arrived) is introduced. The performance of each technology is analyzed in relation to different demand characteristics.",

author = "Figliozzi, {Miguel Andres} and Mahmassani, {Hani S.} and Patrick Jaillet",

year = "2004",

month = jan,

day = "1",

doi = "10.3141/1882-02",

language = "English (US)",

pages = "10--18",

journal = "Transportation Research Record",

issn = "0361-1981",

publisher = "US National Research Council",

number = "1882",

}

TY - JOUR

T1 - Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions

AU - Figliozzi, Miguel Andres

AU - Mahmassani, Hani S.

AU - Jaillet, Patrick

PY - 2004/1/1

Y1 - 2004/1/1

N2 - Technologies for a dynamic truckload pickup-and-delivery problem in a competitive environment by use of sequential auctions are compared. In this environment, demands arrive randomly over time and are described by pickup-and-delivery locations and hard time windows. On demand arrival, carriers compete for the loads in a second-price auction. Four fleet assignment technologies with different degrees of sophistication are tested with simulations. The technologies differ in how they deal with the combinatorial and stochastic elements of the online problem. A one-step look-ahead dynamic vehicle routing technology that tries to estimate the impacts of current decisions on serving future loads (not yet arrived) is introduced. The performance of each technology is analyzed in relation to different demand characteristics.

AB - Technologies for a dynamic truckload pickup-and-delivery problem in a competitive environment by use of sequential auctions are compared. In this environment, demands arrive randomly over time and are described by pickup-and-delivery locations and hard time windows. On demand arrival, carriers compete for the loads in a second-price auction. Four fleet assignment technologies with different degrees of sophistication are tested with simulations. The technologies differ in how they deal with the combinatorial and stochastic elements of the online problem. A one-step look-ahead dynamic vehicle routing technology that tries to estimate the impacts of current decisions on serving future loads (not yet arrived) is introduced. The performance of each technology is analyzed in relation to different demand characteristics.

UR - http://www.scopus.com/inward/record.url?scp=14044264819&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=14044264819&partnerID=8YFLogxK

U2 - 10.3141/1882-02

DO - 10.3141/1882-02

M3 - Article

AN - SCOPUS:14044264819

SN - 0361-1981

SP - 10

EP - 18

JO - Transportation Research Record

JF - Transportation Research Record

IS - 1882

ER -

Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this