You can view the full text of this article for free using the link below.

Title: Solving the e-commerce logistics problem using anti-predatory NIA

Authors: Rohit Kumar Sachan; Tarun Kumar; Dharmender Singh Kushwaha

Addresses: Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology Allahabad, Allahabad, 211004, India ' Department of Computer Science & Engineering, G.L. Bajaj Institute of Technology & Management, Greater Noida, 201306, India ' Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology Allahabad, Allahabad, 211004, India

Abstract: E-commerce is expanding their roots in every business. Fast, efficient, reliable, timely delivery of goods and optimal transportation cost are the major challenges in e-commerce. To overcome these challenges, e-commerce companies are using a well-planned arrangement of warehouses and distribution centres (logistics network). This logistics network also reduces the operational cost and capital investment of an e-commerce company. This study proposes a novel solution to deal with e-commerce logistics problem (ECLP) using anti-predatory NIA (APNIA). The proposed approach is useful for identifying cities where warehouses and distribution centres can be established; and allocating the distribution centres to warehouse in order to reduce total cost of goods transportation. The proposed approach is also useful for predicting the number of warehouses to be established for optimal logistics network. The experimental evaluation reveals that the proposed method achieves 2.30% lower gap value and 20% more consistent optimal results as compared to the genetic algorithm.

Keywords: APNIA; anti-predatory NIA; distribution centre; e-commerce; establishment cost; genetic algorithm; goods; HLP; hub location problem; logistics; meta-heuristic; spoke; transportation cost; warehouse.

DOI: 10.1504/IJIEI.2020.105436

International Journal of Intelligent Engineering Informatics, 2020 Vol.8 No.1, pp.54 - 76

Received: 20 Dec 2018
Accepted: 22 Nov 2019

Published online: 20 Feb 2020 *

Full-text access for editors Access for subscribers Free access Comment on this article