Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal

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.