Ant lion optimisation algorithm for two stage supply chain network associated with fixed charges

P. Manimaran and M.K. Marichelvam

International Journal of Services and Operations Management, 2020, vol. 37, issue 3, 407-425

Abstract: In this paper, an effective ant lion optimisation (ALO) algorithm is proposed for two stage supply chain network associated with fixed charge transportation problem (FCTP) which is strongly NP-hard. In a FCTP, fixed cost is incurred for every route, along with the variable cost that is proportional to the amount shipped. In some circumstances, the variable cost is associated with quadratic variables in which the cost function will be nonlinear. The aim of this paper is to determine the least cost transportation plan that minimises the total variable and fixed costs while satisfying the supply and demand requirements of each plant and customer. The performance of the proposed ALO is compared in terms of total cost with other algorithms addressed in the literature such as genetic algorithm, simulated annealing and ant colony optimisation. The computational results reveal that the proposed ALO provides better solutions.

Keywords: ant lion optimisation; ALO; fixed cost; NP-hard; transportation problem; fixed charge transportation problem; FCTP; combinatorial optimisation. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=111035 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:37:y:2020:i:3:p:407-425

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().