Paper Info
Title
Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal.
Abstract
This paper explores the study of multi-choice multi-objective transportation problem (MCMTP) under the light of conic scalarizing function. MCMTP is a multi-objective transportation problem (MOTP) where the parameters such as cost, demand and supply are treated as multi-choice parameters. A general transformation procedure using binary variables is illustrated to reduce MCMTP into MOTP. Most of the MOTPs are solved by goal programming (GP) approach, but the solution of MOTP may not be satisfied all times by the decision maker when the objective functions of the proposed problem contains interval-valued aspiration levels. To overcome this difficulty, here we propose the approaches of revised multi-choice goal programming (RMCGP) and conic scalarizing function into the MOTP, and then we compare among the solutions. Two numerical examples are presented to show the feasibility and usefulness of our paper. The paper ends with a conclusion and an outlook on future studies.
Year
DOI
Venue
2017
10.1007/s10479-016-2283-4
Annals OR
Keywords
Field
DocType
Transportation problem, Multi-objective decision making, Multi-choice programming, Goal programming, Conic scalarization, Interval uncertainty
Mathematical optimization,Transportation theory,Goal programming,Conic section,Supply and demand,Mathematics,Decision maker,Binary number
Journal
Volume
Issue
ISSN
253
1
1572-9338
Citations 
PageRank 
References 
10
0.68
11
Authors
4
Name
Order
Citations
PageRank
Sankar Kumar Roy110414.63
Gurupada Maity2303.22
Gerhard-wilhelm Weber321036.23
Sirma Zeynep Alparslan Gök4403.91