A method of network simplification in a 4PL system

Authors:
He Zhang;Xiu Li;Wenhuang Liu
Affiliations:
National Engineering Research Center for CIMS, Dep. of Automation, Tsinghua University, Beijing, China;National Engineering Research Center for CIMS, Dep. of Automation, Tsinghua University, Beijing, China;Graduate School at Shenzhen, Tsinghua University, Shenzhen, China
Venue:
CSCWD'04 Proceedings of the 8th international conference on Computer Supported Cooperative Work in Design I
Year:
2004

Citing 2
Cited 0

Solving k-shortest and constrained shortest path problems efficiently

Annals of Operations Research
An Intelligent Brokering System to Support Multi-Agent Web-Based 4th-Party Logistics

ICTAI '02 Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In fourth party logistics (4PL), network optimization needs to synthesize the entire possible 3PL vendors to provide integrated logistics schemes, which can meet all the requirements of customers. Since there are knapsack constraints and un-knapsack constraints, the computational burden is considered to be a problem and a modest computation is required. In this paper, a 4PL optimization network-model is established and a two-process method is suggested for simplifying the corresponding 4PL network. An example is provided and some analysis is given after the calculation.