VINAY V PANICKER
Articles written in Sadhana
Volume 43 Issue 12 December 2018 Article ID 0200
This paper addresses the rail transportation of food grains undertaken by Food Corporation of India (FCI) to meet the requirements of the food security programme called Public Distribution System (PDS). The research focuses on improving the allocation of railway rakes transporting food grains to a set of storage warehouses. A penalty factor based approach is adopted to represent the considerations in transportation planning and three penalty factors such as rake penalty factor, weekly penalty factor and capacity utilization penalty factor are introduced for the purpose. The single source - multiple destination problem is formulated and solved using exact method to minimize the sum of these three penalty factor values, termed total penalty. Further, a heuristic named optimum rake allocation algorithm is developed and tested using a set of 35 probleminstances. The proposed heuristic is found to be highly efficient in terms of solution quality and computation time. A case study of FCI Kerala Region is also carried out to validate the formulated model and the proposed heuristic. The work provides valuable insights into the practical issues encountered in rail freight transportationplanning and proposes an effective solution methodology to address them.
Volume 45 All articles Published: January 2020 Article ID 0016 Original Article (Mechanical Sciences)
The literature in aircraft routing focuses on cyclic rotation with the planned maintenance being assigned to the aircraft at the end of every rotation. The rotations are a set of flights provided with sufficient Maintenance Opportunity (MO) such that the planned maintenance could be carried out for the aircraft. In thisresearch, a novel mathematical model has been introduced to the operational aircraft route assignment which considers both planned and ad hoc maintenances of the aircraft. A line-of-flight is defined as the set of geographic and time feasible flights being assigned to the hypothetical aircraft without any actual operationalconstraints. The model is formulated for the scenario where commercial planning department independently makes the line-of-flights and the maintenances have to be incorporated in those line-of-flights with minimal perturbations. In addition to the exact solution, the problem has also been solved using two heuristic solutionapproaches for the tailored module which is called the Tail Re-assignment, a problem dealt with by many airlines. The Tail Re-assignment problem can be considered as an optimization as well as feasibility problem. The objective of this research is to provide a quick solution that is feasible and near-optimal which can help in the managerial decisions in the tactical horizon. The model is tested with eight schedules with flights varying from 45 to 314, and additionally with multiple maintenance hubs and planning horizon of 20 days. The solution has all the hard constraints satisfied with the total number of onward flight rule breakages difference being minimal. The computation result shows that heuristic solutions solve the schedule for a medium-sized airline in quick time with less than 2% deviation from the exact solution.