A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem

Authors:
K. Antony Arokia Durai Raj;Chandrasekharan Rajendran
Affiliations:
Department of Management Studies, Indian Institute of Technology Madras, Chennai 600036, India;Department of Management Studies, Indian Institute of Technology Madras, Chennai 600036, India
Venue:
Computers and Operations Research
Year:
2012

Citing 6
Cited 1

A branch-and-bound method for the fixed charge transportation problem

Management Science
A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution

Computers and Operations Research
Genetic Algorithms

Genetic Algorithms
Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach

Computers and Industrial Engineering - Supply chain management
A Comparison of Two Representations for the Fixed Charge Transportation Problem

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Direct Representation and Variation Operators for the Fixed Charge Transportation Problem

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature

A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Transportation of goods in a supply chain from plants to customers through distribution centers (DCs) is modeled as a two-stage distribution problem in the literature. In this paper we propose genetic algorithms to solve a two-stage transportation problem with two different scenarios. The first scenario considers the per-unit transportation cost and the fixed cost associated with a route, coupled with unlimited capacity at every DC. The second scenario considers the opening cost of a distribution center, per-unit transportation cost from a given plant to a given DC and the per-unit transportation cost from the DC to a customer. Subsequently, an attempt is made to represent the two-stage fixed-charge transportation problem (Scenario-1) as a single-stage fixed-charge transportation problem and solve the resulting problem using our genetic algorithm. Many benchmark problem instances are solved using the proposed genetic algorithms and performances of these algorithms are compared with the respective best existing algorithms for the two scenarios. The results from computational experiments show that the proposed algorithms yield better solutions than the respective best existing algorithms for the two scenarios under consideration.