A family of market-based shipment methodologies for delivery supply chain

Seog Chan Oh; Soundar R.T. Kumara; Shang Tae Yee; Jeffrey D. Tew

doi:10.1109/WSC.2005.1574449

A family of market-based shipment methodologies for delivery supply chain

Seog Chan Oh, Soundar R.T. Kumara, Shang Tae Yee, Jeffrey D. Tew

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Load building is an important step to make the delivery supply chain efficient. We present a family of load makeup algorithms using market control-based strategy, named LoadMarket, in order to build efficient loads where each load consists of a certain number of finished products having destinations. LoadMarket adopts minimum spanning tree graph algorithm for generating initial endowment for Load Traders who cooperate to minimize either total travel distance or the variance with respect to the travel distances of loads through a spot market or double-sided auction market mechanism. For the simulated load shipment market, the efficiency of the LoadMarket algorithms is analyzed using simulation experiments.

Original language	English (US)
Title of host publication	Proceedings of the 2005 Winter Simulation Conference
Pages	1759-1765
Number of pages	7
DOIs	https://doi.org/10.1109/WSC.2005.1574449
State	Published - 2005
Event	2005 Winter Simulation Conference - Orlando, FL, United States Duration: Dec 4 2005 → Dec 7 2005

Publication series

Name	Proceedings - Winter Simulation Conference
Volume	2005
ISSN (Print)	0891-7736

Other

Other	2005 Winter Simulation Conference
Country/Territory	United States
City	Orlando, FL
Period	12/4/05 → 12/7/05

All Science Journal Classification (ASJC) codes

Software
Modeling and Simulation
Computer Science Applications

Access to Document

10.1109/WSC.2005.1574449

Cite this

@inproceedings{741d19d1baaa4c5a9fb8ccb627cefd35,

title = "A family of market-based shipment methodologies for delivery supply chain",

abstract = "Load building is an important step to make the delivery supply chain efficient. We present a family of load makeup algorithms using market control-based strategy, named LoadMarket, in order to build efficient loads where each load consists of a certain number of finished products having destinations. LoadMarket adopts minimum spanning tree graph algorithm for generating initial endowment for Load Traders who cooperate to minimize either total travel distance or the variance with respect to the travel distances of loads through a spot market or double-sided auction market mechanism. For the simulated load shipment market, the efficiency of the LoadMarket algorithms is analyzed using simulation experiments.",

author = "Oh, {Seog Chan} and Kumara, {Soundar R.T.} and Yee, {Shang Tae} and Tew, {Jeffrey D.}",

year = "2005",

doi = "10.1109/WSC.2005.1574449",

language = "English (US)",

isbn = "0780395204",

series = "Proceedings - Winter Simulation Conference",

pages = "1759--1765",

booktitle = "Proceedings of the 2005 Winter Simulation Conference",

note = "2005 Winter Simulation Conference ; Conference date: 04-12-2005 Through 07-12-2005",

}

TY - GEN

T1 - A family of market-based shipment methodologies for delivery supply chain

AU - Oh, Seog Chan

AU - Kumara, Soundar R.T.

AU - Yee, Shang Tae

AU - Tew, Jeffrey D.

PY - 2005

Y1 - 2005

N2 - Load building is an important step to make the delivery supply chain efficient. We present a family of load makeup algorithms using market control-based strategy, named LoadMarket, in order to build efficient loads where each load consists of a certain number of finished products having destinations. LoadMarket adopts minimum spanning tree graph algorithm for generating initial endowment for Load Traders who cooperate to minimize either total travel distance or the variance with respect to the travel distances of loads through a spot market or double-sided auction market mechanism. For the simulated load shipment market, the efficiency of the LoadMarket algorithms is analyzed using simulation experiments.

AB - Load building is an important step to make the delivery supply chain efficient. We present a family of load makeup algorithms using market control-based strategy, named LoadMarket, in order to build efficient loads where each load consists of a certain number of finished products having destinations. LoadMarket adopts minimum spanning tree graph algorithm for generating initial endowment for Load Traders who cooperate to minimize either total travel distance or the variance with respect to the travel distances of loads through a spot market or double-sided auction market mechanism. For the simulated load shipment market, the efficiency of the LoadMarket algorithms is analyzed using simulation experiments.

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

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

U2 - 10.1109/WSC.2005.1574449

DO - 10.1109/WSC.2005.1574449

M3 - Conference contribution

AN - SCOPUS:33846654255

SN - 0780395204

SN - 9780780395206

T3 - Proceedings - Winter Simulation Conference

SP - 1759

EP - 1765

BT - Proceedings of the 2005 Winter Simulation Conference

T2 - 2005 Winter Simulation Conference

Y2 - 4 December 2005 through 7 December 2005

ER -

A family of market-based shipment methodologies for delivery supply chain

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this