Genetic algorithm-based solution of multi-objective stochastic transportation problem
by Jaydeepkumar M. Sosa; Jayesh M. Dhodiya
International Journal of Advanced Operations Management (IJAOM), Vol. 13, No. 2, 2021

Abstract: In transportation problem (TP), a decision-maker (DM) always wishes to optimise the given objectives by effectively transporting a given item from several sources to several destinations. The present paper explores the genetic algorithm (GA)-based hybrid approach to solve multi-objective stochastic transportation problem. By using exponential membership function, different shape parameters (SPs) and aspiration levels (ALs), higher degree of satisfaction for each objective function are obtained which provides more flexibility to the decision-maker (DM) for a better decision. In this approach, a multi-objective optimisation problem first converted into a single optimisation problem, then GA is applied with operator selection, crossover, mutation, etc. The logistic distribution is used here to convert the stochastic supply and demand into the real value. Here, we consider the objective functions which are non-commensurable and conflict with each other. To interpret, evaluate, and exhibit the usefulness of the proposed method, a numerical example is given.

Online publication date: Mon, 12-Jul-2021

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 Advanced Operations Management (IJAOM):
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