Amiya Biswas

ORCID: 0000-0003-3469-5042
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Optimization and Mathematical Programming
  • Scheduling and Optimization Algorithms
  • Fuzzy Systems and Optimization
  • Vehicle Routing Optimization Methods
  • Metaheuristic Optimization Algorithms Research
  • Advanced Multi-Objective Optimization Algorithms
  • Religion and Sociopolitical Dynamics in Nigeria
  • Facility Location and Emergency Management
  • Water resources management and optimization
  • Advanced Control Systems Optimization
  • Supply Chain and Inventory Management
  • Fractional Differential Equations Solutions
  • Urban and Freight Transport Logistics
  • Advanced Manufacturing and Logistics Optimization
  • Optimization and Packing Problems
  • Nonlinear Differential Equations Analysis
  • Scheduling and Timetabling Solutions

National Institute of Technology Durgapur
2020-2022

Cooch Behar Panchanan Barma University
2017-2020

Tecnológico de Monterrey
2018

University of Burdwan
2014

In this paper, we have described an inventory model for a deteriorating item having preservation facility with trade credit policy. The demand is ramp type. Shortages are allowed due to the waiting time arrival of next lot. two models type demand. We solved these by using separate numerical example. supplied concavity objective function each (winner case). Finally, performed sensitivity analysis and made conclusion accordingly.

10.1504/ijmor.2020.110895 article EN International Journal of Mathematics in Operational Research 2020-01-01

10.1007/s00521-022-07683-7 article EN Neural Computing and Applications 2022-08-13

In this paper, we have modeled a decision making problem of tea industry as multi-objective optimization in interval environment.The goal is to maximize the overall profit well minimize total production cost subject given resource constraints depending on budget, storage space and allotted processing times different machines.For purpose, has been formulated integer linear programming with objectives.To solve problem, proposed extended elitist non-dominated sorting genetic algorithm...

10.5267/j.uscm.2014.7.004 article EN Uncertain Supply Chain Management 2014-01-01

The goal of this paper is to propose an approach based on genetic algorithm for solving unbalanced assignment problem with lesser number agents than the jobs under assumption that cost/time assigning a job agent interval number. Also additional constraint maximum allowable agent(s) considered. In proposed approach, existing real coded extended valued fitness help order relations (Bhunia and Samanta, 2014) two different versions crossover operators developed, one newly one-point other,...

10.1504/ijlsm.2017.083222 article EN International Journal of Logistics Systems and Management 2017-01-01

The goal of this paper is to propose an approach based on genetic algorithm for solving unbalanced assignment problem with lesser number agents than the jobs under assumption that cost/time assigning a job agent interval number. Also additional constraint maximum allowable agent(s) considered. In proposed approach, existing real coded extended valued fitness help order relations (Bhunia and Samanta, 2014) two different versions crossover operators developed, one newly one-point other,...

10.1504/ijlsm.2017.10003920 article EN International Journal of Logistics Systems and Management 2017-01-01

In this paper, we have described an inventory model for a deteriorating item having preservation facility with trade credit policy. The demand is ramp type. Shortages are allowed due to the waiting time arrival of next lot. two models type demand. We solved these by using separate numerical example. supplied concavity objective function each (winner case). Finally, performed sensitivity analysis and made conclusion accordingly.

10.1504/ijmor.2020.10032449 article EN International Journal of Mathematics in Operational Research 2020-01-01

In this paper, an approach based on genetic algorithm has been proposed for solving multi-objective unbalanced assignment problems with restriction of job(s) to different agents which may arise due the inability/poor efficiency performing certain jobs by some dealing additional constraint maximum number that can be performed agent. As cost and time are considered as most important factors managerial decision in economic/industrial establishments, so here total completion two prime...

10.1504/ijmor.2018.092967 article EN International Journal of Mathematics in Operational Research 2018-01-01

In this paper, an approach based on genetic algorithm has been proposed for solving multi-objective unbalanced assignment problems with restriction of job(s) to different agents which may arise due the inability/poor efficiency performing certain jobs by some dealing additional constraint maximum number that can be performed agent. As cost and time are considered as most important factors managerial decision in economic/industrial establishments, so here total completion two prime...

10.1504/ijmor.2018.10013178 article EN International Journal of Mathematics in Operational Research 2018-01-01
Coming Soon ...