TY - JOUR

T1 - Solving fixed charge transportation problem with truck load constraint using metaheuristics

AU - Balaji, A. N.

AU - Mukund Nilakantan, J.

AU - Nielsen, Izabela

AU - Jawahar, N.

AU - Ponnambalam, S. G.

PY - 2019/2

Y1 - 2019/2

N2 - Fixed charge transportation (FCT) problems addressed in literature assumed shipment between a source and a destination is fulfilled in a single lot. However, in reality the lot size may exceed the capacity of the carrier and hence the shipment needs to be executed by conducting more than one trip. This gives an increased fixed charge which is proportional to the number of trips performed. This paper proposes a special case of the FCT problem were the truck load constraint is considered and is referred as the fixed charge transportation problem with truck load constraints (FCT-TLC) problem. The objective considered in this problem is to minimize the total cost of transportation without violating the supply and demand constraints. The general FCT problem is classified as NP-hard and to solve this proposed problem with additional constraints, two metaheuristic algorithms are used. A Genetic Algorithm (GA) and a Simulated Annealing Algorithm (SAA) are proposed to solve the FCT-TLC problem and the performance of the algorithms is tested on twenty randomly generated problem instances. Detailed comparative study on the computational results obtained using GA and SAA are presented. Both metaheuristics show good results for solving the proposed problem. However, SAA outperformed GA for many problems with different truck load capacities. To test the performance of the proposed algorithms, comparison with approximate and lower bound solutions for the problem with a relaxed truck capacity constraint is also presented.

AB - Fixed charge transportation (FCT) problems addressed in literature assumed shipment between a source and a destination is fulfilled in a single lot. However, in reality the lot size may exceed the capacity of the carrier and hence the shipment needs to be executed by conducting more than one trip. This gives an increased fixed charge which is proportional to the number of trips performed. This paper proposes a special case of the FCT problem were the truck load constraint is considered and is referred as the fixed charge transportation problem with truck load constraints (FCT-TLC) problem. The objective considered in this problem is to minimize the total cost of transportation without violating the supply and demand constraints. The general FCT problem is classified as NP-hard and to solve this proposed problem with additional constraints, two metaheuristic algorithms are used. A Genetic Algorithm (GA) and a Simulated Annealing Algorithm (SAA) are proposed to solve the FCT-TLC problem and the performance of the algorithms is tested on twenty randomly generated problem instances. Detailed comparative study on the computational results obtained using GA and SAA are presented. Both metaheuristics show good results for solving the proposed problem. However, SAA outperformed GA for many problems with different truck load capacities. To test the performance of the proposed algorithms, comparison with approximate and lower bound solutions for the problem with a relaxed truck capacity constraint is also presented.

KW - Fixed charge

KW - Genetic algorithm

KW - Heuristics

KW - Simulated annealing algorithm

KW - Transportation problem

KW - Truck load capacity

UR - http://www.scopus.com/inward/record.url?scp=85033480610&partnerID=8YFLogxK

U2 - 10.1007/s10479-017-2692-z

DO - 10.1007/s10479-017-2692-z

M3 - Journal article

AN - SCOPUS:85033480610

VL - 273

SP - 207

EP - 236

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1-2

ER -