Papers published on a yearly basis
Papers
More filters
TL;DR: A finite time horizon inventory problem for a deteriorating item having two separate warehouses, one is a own warehouse of finite dimension and other a rented warehouse, is developed with interval-valued lead-time under inflation and time value of money by Fast and Elitist Multi-objective Genetic Algorithm.
127 citations
TL;DR: In this article, an inventory model for an item is developed in a stochastic environment with price-dependent demand over a finite time horizon, and a closed form solution to maximize the expected average profit is obtained when demand is constant.
125 citations
TL;DR: A multi-item inventory model with two-storage facilities is developed with advertisement, price and displayed inventory level-dependent demand in a fuzzy environment (purchase cost, investment amount and storehouse capacity are imprecise).
109 citations
TL;DR: For the developed EPQ model, the total profit has been maximized to obtain the optimum production rate and production run time in the system and algorithms have been developed for finding the optimal profit of the imperfect production inventory model.
91 citations
TL;DR: The efficiency of the algorithm is adequate with respect to the accuracy and the consistency for solving standard TSPs (Symmetric as well as Asymmetric) compared to the existing algorithms in the literature.
Abstract: In this research paper, Artificial Bee Colony algorithm is modified with multiple update rules and K-opt operation to solve the Traveling Salesman Problem. Here the features of swap sequences and swap operations on the sequence of cities (solution/path) of the problem are used to create different solution (path) update rules of the algorithm. Eight different rules are proposed to update solutions in the algorithm. Updation of a solution by an employed bee or by an onlooker bee is done by a randomly selected rule from the rule set using Roulette Wheel selection process. In the scout bee phase of the algorithm, the perturbation technique, K-opt operation is applied on any stagnant solution for a fixed number of times for the possible improvement of it. The K-opt operation is again used at the end of the search process to improve the quality of the final solution (if possible). Proposed method is tested with a set of benchmark test problems from TSPLIB and it is observed that the efficiency of the algorithm is adequate with respect to the accuracy and the consistency for solving standard TSPs (Symmetric as well as Asymmetric) compared to the existing algorithms in the literature.
85 citations
Authors
Showing all 18 results
| Name | H-index | Papers | Citations |
|---|---|---|---|
| Manas Kumar Maiti | 22 | 66 | 1286 |
| Anwesha Mukherjee | 15 | 52 | 709 |
| Jayanta Kumar Dey | 11 | 25 | 403 |
| Abul Kalam Biswas | 10 | 19 | 238 |
| Joydeb Manna | 9 | 15 | 505 |
| Subhabrata Mabhai | 4 | 9 | 92 |
| Madhab Mondal | 3 | 3 | 46 |
| Rajkumar Guchhait | 3 | 11 | 35 |
| Nababrata Ghoshal | 3 | 10 | 35 |
| A. K. Dhar | 1 | 1 | 12 |
| M. K. Maiti | 1 | 1 | 23 |
| K. Maiti | 1 | 1 | 1 |
| Samiran Kumar | 1 | 2 | 1 |
| Buddhadeb Maity | 1 | 1 | 7 |
| Tapan Kumar Maity | 1 | 1 | 7 |