How to translate text using browser tools
4 May 2019 Optimal Design of Node Distribution in Maritime Logistics Network of Fruit and Vegetable Supply Chain
Junnan Hua, Shuhong Gu, Lei Zhang
Author Affiliations +
Abstract

Hua, J.; Gu, S., and Zhang, L., 2018. Optimal design of node distribution in maritime logistics network of fruit and vegetable supply chain. In: Liu, Z.L. and Mi, C. (eds.), Advances in Sustainable Port and Ocean Engineering. Journal of Coastal Research, Special Issue No. 83, pp. 814–818. Coconut Creek (Florida), ISSN 0749-0208.

There is a high cost in maritime logistics of supply chain of fruit and vegetable, so it is necessary to optimize and research the node distribution of marine logistics network in the fruit and vegetable supply chain. The current method has a problem about high cost. Therefore, this paper proposes an optimization method of distribution of maritime logistic network nodes in the fruit and vegetable supply chain based on the improved ant colony algorithm. Firstly, this method built the problem model of distribution optimization of logistics node, and used the improved ant colony algorithm for optimizing node distribution of maritime logistics, and then solved the objective function value. Under the constraint conditions, our method optimized the final result so as to complete the distribution optimization of maritime logistics network nodes on the supply chain of fruits and vegetables. Experimental result shows that the cost of the method proposed in this paper is low.

©Coastal Education and Research Foundation, Inc. 2018
Junnan Hua, Shuhong Gu, and Lei Zhang "Optimal Design of Node Distribution in Maritime Logistics Network of Fruit and Vegetable Supply Chain," Journal of Coastal Research 83(sp1), 814-818, (4 May 2019). https://doi.org/10.2112/SI83-133.1
Received: 12 November 2017; Accepted: 16 January 2018; Published: 4 May 2019
KEYWORDS
ant colony algorithm
Fruit and vegetable supply chain
maritime logistics
network node
RIGHTS & PERMISSIONS
Get copyright permission
Back to Top