Indian Journal of Science and Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


In this paper, we consider the step fixed-charge transportation problem where is one of the most important problems in transportation research area. To tackle such an NP-hard problem, we present Genetic Algorithm (GA). Since crossover and mutation operators have significant role on the algorithm's quality, some crossover and mutation operators are tested in this work. For this aim, several problem sizes are generated at random and then through extensive computational experiments, appropriate GA parameter values were chosen. Besides, the efficiency and convergence of the proposed algorithms was evaluated by solution quality. The results showed that the GA was more robust and consistently outperformed Simulated Annealing (SA) for all instances.

Keywords

Genetic Algorithm, Step Fixed Charge Transportation Problem, Transportation Problem
User