An overview of weighted goal programming: a multi-objective transportation problem with some fresh viewpoints

Goal programming (GP) is one of the widely used and effective method of solving real-world multi-objective decision-making problems. The term “multi-objective transportation problem” (MOTP) covers a specific class of vector maximum (minimum) linear programming problem that typically has multiple, co...

Full description

Saved in:
Bibliographic Details
Published in:Central European journal of operations research Vol. 32; no. 3; pp. 557 - 568
Main Authors: Gütmen, Selma, Roy, Sankar Kumar, Weber, Gerhard-Wilhelm
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2024
Springer
Springer Nature B.V
Subjects:
ISSN:1435-246X, 1613-9178
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Goal programming (GP) is one of the widely used and effective method of solving real-world multi-objective decision-making problems. The term “multi-objective transportation problem” (MOTP) covers a specific class of vector maximum (minimum) linear programming problem that typically has multiple, competing, and incompatible objective functions. In this article, GP and weighted goal programming (WGP) are summarized in MOTP. Furthermore, its advantages over GP are illustrated by a theorem. Additionally, by utilizing WGP, a solution procedure is articulated for MOTP. Finally, an application on screen-panels of mobile devices is presented to explore the applicability. The paper ends with a conclusion and including an outlook to future studies, whereby we address internal and external transportation, and view the internal one with a broader understanding of logistics.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1435-246X
1613-9178
DOI:10.1007/s10100-023-00861-5