You can view the full text of this article for free using the link below.

Title: A new approach to multi-objective transportation problem forbinding relationship between warehouse to consumer and consumer to consumer

Authors: Bhabani Mallia; Chakradhar Das; Manjula Das; Srikanta Patnaik

Addresses: Department of Mathematics, ITER, S'O'A (Deemed to be University), Bhubaneswar, 751030, Odisha, India ' Department of Mathematics, NIT, Rourkela, Odisha, India ' Centre for Applied Mathematics and Computing, ITER, S'O'A (Deemed to be University), Bhubaneswar, 751030, Odisha, India ' Department of Computer Science and Engineering, ITER, S'O'A (Deemed to be University), Bhubaneswar, 751030, Odisha, India

Abstract: A special type of multi-objective transportation problem with emphasis on consumer to consumer relationship is presented. The objective is to minimise total transportation cost along with source to consumer and consumer to consumer association/relationship in vicinity of the source. A lexicographical goal programming model has been applied. Two phase approach has been made. In the first phase the total transportation cost is minimised. In the second phase, overall independence value of the consumer to consumer association/relation is minimised. This model can give a better result than a single objective transportation model. That is because the source to consumer association/relationship is considered in the first priority to get the lowest cost and the vicinity of consumers in the periphery of the source. In the second priority grouping is made for consumers to be served in the same warehouse, provided the capacity of the source is sufficient to meet the consumer's demand.

Keywords: transportation problem; multi-objective; lexicographic goal programming; consumer to consumer relationship.

DOI: 10.1504/IJIE.2021.112327

International Journal of Intelligent Enterprise, 2021 Vol.8 No.1, pp.29 - 43

Received: 11 Oct 2018
Accepted: 11 Nov 2019

Published online: 22 Dec 2020 *

Full-text access for editors Access for subscribers Free access Comment on this article