Combinatorial Optimization and Refinery Operations Resource Solutions Reachability at the location

Abstract

In applied mathematics literature ƒ??Combinatorial Optimizationƒ? is a topic consists of finding an optimal object from a finite set of objects. VRP meaning vehicle routing problem combined with TSP or travelling salesman problem and MSP minimum spanning tree problems are some of the examples of Combinatorial Optimization topics. This topic further complicates while vehicle route and terminal junctions are assigned with certain constraints. The paper also contain an example concerning mathematical model of a routed ship engine carried crude/refined oil vessel shipped from a port to download at several destination petroleum refinery ports and the ship operation schedule is based on the multistage decision making process. The Indian oil petroleum refinery processors uses the petrochemical solutions carried with the proper vessel ship shuttles from abroad crude petroleum exploring oil wells, uploaded at abroad seaport and dispatched to Indian refinery locality seaports within definite sea routes periodically, in time inventory schedules. The routed ship engine carried crude/refined oil vessel download at several Indian Seaport is compared to a multistage decision making model for uniform distribution of energy resource solutions considering the operational resource material needs. The algorithm for solving the problem is a specific combinatorial optimization problem solving technique is focused in the paper.

Keywords

Combinatorial Optimization Multi stage decision making. Vehicle Routing Problem

  • Research Identity (RIN)

  • License

    Attribution 2.0 Generic (CC BY 2.0)

  • Language & Pages

    English, 25-32

  • Classification

    FOR CODE: 861199