Solving fixed charge transportation problem with truck load constraint using metaheuristics

A. N. Balaji (), J. Mukund Nilakantan (), Izabela Nielsen (), N. Jawahar () and S. G. Ponnambalam ()
Additional contact information
A. N. Balaji: K.L.N. College of Engineering
J. Mukund Nilakantan: Aalborg University
Izabela Nielsen: Aalborg University
N. Jawahar: Thiagarajar College of Engineering
S. G. Ponnambalam: Monash University Malaysia

Annals of Operations Research, 2019, vol. 273, issue 1, No 8, 207-236

Abstract: Abstract 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.

Keywords: Fixed charge; Transportation problem; Truck load capacity; Genetic algorithm; Simulated annealing algorithm; Heuristics (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2692-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:273:y:2019:i:1:d:10.1007_s10479-017-2692-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2692-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().