Solving the e-commerce logistics problem using anti-predatory NIA
by Rohit Kumar Sachan; Tarun Kumar; Dharmender Singh Kushwaha
International Journal of Intelligent Engineering Informatics (IJIEI), Vol. 8, No. 1, 2020

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.

Online publication date: Fri, 28-Feb-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Engineering Informatics (IJIEI):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com