Solving multi-objective fixed charged transportation problem using a modified particle swarm optimization algorithm

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Particle Swarm Optimization (PSO) is population-based algorithm established and enhanced to solve a wide variety of real-life problems. During the last decade, different aspects of PSO have been modified and many variants have been proposed. In this paper, a modified PSO is proposed to solve multi-objective fixed charge transportation problem wherein it optimizes the transportation cost (variable and fixed) as well as time to deliver goods from sources to destinations satisfying certain constraints. The method starts with the variable cost only and then with addition of fixed cost, iterates toward optimal Pareto pair. The simulation results show a significant performance gain by the proposed method and prove it as a competent alternative to existing methods.

Cite

CITATION STYLE

APA

Singh, G., & Singh, A. (2021). Solving multi-objective fixed charged transportation problem using a modified particle swarm optimization algorithm. In Lecture Notes on Data Engineering and Communications Technologies (Vol. 53, pp. 373–386). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-981-15-5258-8_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free