Browsing by Author "Mathirajan, M."

Now showing 1 - 4 of 4

A machine learning algorithm for scheduling a burn-in oven problem
(Inderscience Publishers, 2023) Mathirajan, M.; Reddy, S.; Vimala Rani, M.V.; Dhaval, P.
This study applies artificial neural network (ANN) to achieve more accurate parameter estimations in calculating job-priority-data of jobs and the same is applied in a proposed dispatching rule-based greedy heuristic algorithm (DR-GHA) for efficiently scheduling a burn-in oven (BO) problem. The integration of ANN and DR-GHA is called as a hybrid neural network (HNN) algorithm. Accordingly, this study proposed eight variants of HNN algorithms by proposing eight variants of DR-GHA for scheduling a BO. The series of computational analyses (empirical and statistical) indicated that each of the variants of proposed HNN is significantly enhancing the performance of the respective proposed variants of DR-GHA for scheduling a BO. That is, more accurate parameter estimations in calculating job-priority-data for DR-GHA via back-propagation ANN leads to high-quality schedules w.r.t. total weighted tardiness. Further, proposed HNN variant: HNN-ODD is outperforming relatively with other HNN variants and provides very near optimal/estimated solution. © © 2023 Inderscience Enterprises Ltd.
An experimental evaluation of heuristic algorithms for bus-depot matching problem of urban road transport systems
(2010) Mathirajan, M.; Hariharakrishnan, C.V.; Ramachandran, V.
This research is motivated by a bus-depot matching problem observed in Urban Road Transport Systems (URTS). In URTS, buses are parked overnight at depots. Starting points of routes are usually different from depot locations. A bus has to cover the distance from its depot to the starting point of its route before being engaged on regular service. Likewise, buses usually do not provide service to the depot at the end of the service period. The distance travelled by a bus in a day from a depot to a starting terminus and/or from the ending or last terminus back to the depot without carrying passengers is known as 'dead kilometers'. The dead kilometers can be reduced by efficiently allocating the buses to depots. In the literature this problem is solved using mathematical model and heuristic algorithms. However, there is no detailed computational analysis to highlight the merits and demerits of various solution methodologies, so far addressed in the literature. In this study a set of heuristic algorithms are considered to make an efficient decisions in buses-depots matching problem. A computational experiment is carried out to understand the efficiency of the heuristic algorithms considered in this study for various large size problems in comparison with exact solutions. From the computational analysis, two out of the five heuristic algorithms considered in this study, resulted very close to exact solutions in most of the problem instances. All the heuristic algorithms considered in this study takes very meager computational time in Pentium IV for the large size problem of 30 depots and 5,031 buses considered in this study. © Operational Research Society of India 2011.
An experimental study of newly proposed initial basic feasible solution methods for a transportation problem
(Springer, 2022) Mathirajan, M.; Reddy, S.; Vimala Rani, M.V.
This study presents an extensive experimental study of heuristic methods or initial basic feasible solution (IBFS) methods, which is one of the main steps to achieve an optimal or accepted (near-optimal) solution, for a transportation problem (TP). In this study, we proposed 23 new IBFS methods (18 new IBFS methods, and 5 variants of existing IBFS methods) for a TP. We conducted a series of experimental analyses with 640 randomly generated problem instances to study the performance efficiency of the 23 newly proposed IBFS methods in comparison with (a) solutions obtained from 11 latest IBFS methods published in the literature, and (b) optimal solution obtained from linear programming approach. Our multiple performance analyses revealed that the first six ranking positions (with respect to the total transportation cost obtained from each of the 34 IBFS methods over 640 problem instances) are related to the newly proposed IBFS methods and the 7th to 10th ranking positions are related to the existing IBFS methods. Furthermore, the first two best performing newly proposed IBFS methods are yielding near to optimal solution (with 0% to 2% loss of optimality). So, these can be easily integrated as the sub-module to solve any complex decision-making problems such as Logistics/Supply Chain Management. © 2021, Operational Research Society of India.
An experimental evaluation of heuristic algorithms for bus-depot matching problem of urban road transport systems
(2010) Mathirajan, M.; Hariharakrishnan, C.V.; Ramachandran, V.
This research is motivated by a bus-depot matching problem observed in Urban Road Transport Systems (URTS). In URTS, buses are parked overnight at depots. Starting points of routes are usually different from depot locations. A bus has to cover the distance from its depot to the starting point of its route before being engaged on regular service. Likewise, buses usually do not provide service to the depot at the end of the service period. The distance travelled by a bus in a day from a depot to a starting terminus and/or from the ending or last terminus back to the depot without carrying passengers is known as 'dead kilometers'. The dead kilometers can be reduced by efficiently allocating the buses to depots. In the literature this problem is solved using mathematical model and heuristic algorithms. However, there is no detailed computational analysis to highlight the merits and demerits of various solution methodologies, so far addressed in the literature. In this study a set of heuristic algorithms are considered to make an efficient decisions in buses-depots matching problem. A computational experiment is carried out to understand the efficiency of the heuristic algorithms considered in this study for various large size problems in comparison with exact solutions. From the computational analysis, two out of the five heuristic algorithms considered in this study, resulted very close to exact solutions in most of the problem instances. All the heuristic algorithms considered in this study takes very meager computational time in Pentium IV for the large size problem of 30 depots and 5,031 buses considered in this study. Operational Research Society of India 2011.