Samir Maity

Samir Maity
Aalborg University · Department of Materials and Production

M.Sc(Math), MCA, M A(Edn) Ph D Post Doc Fellow

About

35
Publications
4,091
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
375
Citations
Introduction
Skills and Expertise

Publications

Publications (35)
Article
Full-text available
The Internet of Things (IoT), a modern technology, and machine learning (ML) are used to make immediate decisions. Due to the massive development of roadside infrastructure and increasing digitalization, current procurement planning is based on primary data, and there are several paths connecting markets and cities for travel. Integrating physical...
Article
Full-text available
In a competitive online retail market, orders for assembled products such as refrigerators, air conditioners, smart televisions, etc., attract significant attention due to their high gross merchandise value. Unlike other regular products, product delivery has a two-stage process—delivery of product components and assembly and installation of the fi...
Chapter
Full-text available
The present chapter investigates some future research cases, themes, and directions in vehicular dew computing. Dew computing is a paradigm for organizing the software and hardware of on-premises computers in a cloud computing architecture. The on-the-spot computer offers services that work independently from the cloud. It seeks to maximize the cap...
Article
The COVID-19 pandemic has spread worldwide exponentially. Typically, for testing, a provincial main government hospital cum testing center collects patients' specimens from remote health centers in the minimum possible time, satisfying the 'false negativity' constraint of the first collected specimen. With infrastructural developments throughout th...
Article
In this paper, a Quantum-inspired Ant Colony Optimization (Qi-ACO) is proposed to solve a sustainable four-dimensional traveling salesman problem (4DTSP). In 4DTSP, various paths with a different number of conveyances are available to travel between any two cities. In this model, we have considered a sustainable 4DTSP in terms of emission as a cons...
Article
Full-text available
With the development of the internet and the availability of smart phones, online shopping and the number of digital buyers have increased enormously under the present social context (COVID-19). The major pitfall of this marketing system is the random non-availability of/refusal by customers. Nowadays, with the development of infrastructure, there...
Chapter
Full-text available
In this investigation, we propose a modified teaching-learning-based optimization algorithm (mTLBO) for solving the traveling salesman problems. We design an mTLBO with Boltzmann selection, novel upgradation strategy in the teaching phase, and interactive group-based crossover for learners in the learning phase. In the teaching phase, we focus on d...
Article
It is imperative to re-design the freight transport modal mix to ensure a shift from road to rail to limit energy consumption and global GHG emissions. However, one of the main barriers to the shift is the ability of the railways to handle consignments from customers with less than ‘unit’ train loads. In such cases, railways have to combine consign...
Article
Full-text available
This paper develops a model for shipping of container vessels to fulfill the demand and supply in various ports in a fixed time frame with dynamic demand and supply of each port under fuzzy environment. The time frame is divided into sub-frames which are operation time and travelling time. Speed optimization, simultaneous loading, unloading operati...
Chapter
Full-text available
Here, we propose an Opposition-based Genetic Algorithm (OBGA) to design and solve a Multi-path Routing Problem with Risk (MPRPwR). We consider a person purchasing some precious products (jewellery, electronic gadgets, etc.) from some different shops/wholesalers at different places with predetermined demands and having some risks of theft along the...
Article
Full-text available
The traveling purchaser problem (TPP) is a notable generalization of the traveling salesman problem (TSP) which involves selecting a subset of markets at a minimum traveling cost such that the demand for each product is satisfied. A solid green traveling purchaser problem (SGTPP) is a TPP in which, at each market, some conveyances are available to...
Article
As the carbon emission (CE) from a vehicle depends on the factors such as the surface condition of the traveled route, conveyance type, load, speed, curb weight of the vehicles, etc., nowadays, consideration of the appropriate route, conveyance and corresponding CE are given maximum importance in eco-friendly transportation systems. The present stu...
Article
This paper develops a modified formulation of the traveling purchaser problem (TPP), in capacitated markets with the availability of both original and substitute products where purchaser focuses on minimizing an imprecise procurement cost using multiple vehicle types. We also develop an environment-friendly green procurement planning through suitab...
Chapter
Full-text available
This investigation took an attempt to solve the cluster traveling salesman problem (CTSP) by the heuristic approach. In this problem, nodes are clustered with given a set of vertices (nodes). Given the set of vertices is divided into a prespecified number of clusters. The size of each cluster is also pre-specified. The main aim is to find the least...
Article
In this paper we model a Covering Solid Travelling Salesman Problem (CSTSP), a generalization of a two dimensional Covering Sales-man Problem (CSP) which is reduced to a Solid Travelling sales man problem (STSP) and solved by using a modified Genetic Algorithm (MGA). A salesman starts from an initial node and visits a subset of nodes only for once...
Article
Full-text available
In the present study, a Novel Memetic Genetic Algorithm (NMGA) is developed to solve the Traveling Salesman Problem (TSP). The proposed NMGA is the combination of Boltzmann probability selection and a multi-parent crossover technique with known random mutation. In the proposed multi-parent crossover parents and common crossing point are selected ra...
Article
Full-text available
This paper addresses a rough multi-objective genetic algorithm (R-MOGA) to solve constrained multi-objective solid travelling salesman problems (CMOSTSPs) in rough, fuzzy rough and random rough environments. In the proposed R-MOGA, “3- and 5-level linguistic-based rough age oriented selection” and “adaptive crossover” are used along with a new gene...
Article
Full-text available
This paper presents new rough set based genetic algorithms (RSGAs) to solve constrained solid travelling salesman problems (CSTSPs) with restricted conveyances (CSTSPwR) having uncertain costs and times as interval values. To grow the impreciseness in soft computing (SC), the proposed RSGAs, a rough set based age-dependent selection technique and a...
Chapter
Full-text available
In this paper, we proposed a hybridized soft computing technique to solve a restricted 4-dimensional TSP (r-4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. Here, some restrictions on paths and conveyances are imposed. The algorithm is a hybridization of genetic algorithm (GA) and swap ope...
Conference Paper
Full-text available
In this article, we model an “Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility” (ICCSTSPC), a generalization of Covering Salesman Problem (CSP), in fuzzy environment. A salesman begins from an initial node, visits a subset of nodes exactly once using any one of appropriate vehicles available at each step, so that un...
Article
In this paper, a hybridized algorithmic approach to solve 4- dimensional Travelling Salesman Problem (4DTSP) where different paths with various number of conveyances are available to travel between two cities. The algorithm is a hybridization of rough set based ant colony optimization (rACO) with genetic algorithm (GA). The initial solutions are pr...
Article
Full-text available
In this paper, a Rough Genetic Algorithm (RGA) is proposed to solve constrained solid travelling salesman problems (CSTSPs) in crisp and bi-fuzzy coefficients. In the proposed RGA, we developed a ‘rough set based selection’ (7-point scale) technique and ‘comparison crossover’ with new generation dependent mutation. A solid travelling salesman probl...
Article
In this paper, an Adaptive Genetic Algorithm (AGA) is developed to solve constrained solid travelling salesman problems (CSTSPs) in crisp, fuzzy and rough environments. In the proposed AGA, we model it with ‘probabilistic selection’ technique and ‘adaptive crossover’ with random mutation. A solid travelling salesman problem (STSP) is a tavelling sa...
Article
Full-text available
In this paper, we propose an improved genetic algorithm (IGA) to solve Constrained Solid Travelling Salesman Problems (CSTSPs) in crisp, fuzzy, rough, and fuzzy-rough environments. The proposed algorithm is a combination of probabilistic selection, cyclic crossover, and nodes-oriented random mutation. Here, CSTSPs in different uncertain environment...

Questions

Question (1)
Question
latest adaptation with the weighted parameter W?

Network

Cited By