## About

22

Publications

6,890

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

132

Citations

Citations since 2016

Introduction

I am now associated with the Laboratoire des Sciences du Numérique de Nantes (LS2N), University of Nantes, IMT Atlantique, Nantes, France as a Postdoctoral researcher.

Additional affiliations

August 2021 - present

August 2021 - present

August 2019 - August 2021

Education

January 2013 - April 2018

July 2010 - June 2012

July 2006 - June 2010

## Publications

Publications (22)

The Maximal Covering Location Problem (MCLP) is concerned with the optimal placement of a fixed number of facilities to cover the maximum number of customers. This article considers a new variant of MCLP where both the coverage radii of facilities and the distance between customer and facility are fuzzy. Moreover, the finite capacity of each facili...

The maximal covering location problem (MCLP) is a well-known combinatorial optimization problem with several applications in emergency and military services as well as in public services. Traditionally, MCLP is a single objective problem where the objective is to maximize the sum of the demands of customers which are served by a fixed number of ope...

In this article, the single allocation p-hub location problem (SApHLP) with a ring backbone network for content placement in VoD services is proposed. In VoD services, a large volume of digital data is kept as data segments in spatially distributed hubs. In SApHLP, each user is restricted to be allocated only to a single hub, and here hubs form a r...

In video-on-demand (VoD) services, large volumes of digital data are kept at hubs which are spatially distributed over large geographic areas and users are connected to these hubs based on their demands. In this article, we consider a large database of video files, that are pre-partitioned to multiple segments based on the demand patterns of users....

The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem having single-objective function. The objective of UFLP is to find a subset of facilities from a given set of potential facility locations such that the sum of the opening costs of the opened facilities and the service cost to serve all the custome...

The Single-Row Facility Layout Problem (SRFLP) is a well-known combinatorial optimization problem. The objective of SRFLP is to find out the arrangement of facilities with given lengths on a line so that the weighted sum of the distances between all pairs of facilities is minimized. This problem is known to be NP-hard. Hence, a population-based imp...

The tool indexing problem (TIP) is the problem of allocating cutting tools to different slots in a tool magazine of Computer Numerically Controlled machine to reduce the processing time of jobs on the machine. This is one of the mostly encountered optimization problems in manufacturing systems. In TIP, the number of tools used by the machine is at...

A well-known combinatorial optimization problem, known as the uncapacitated facility location problem (UFLP) is considered in this article. A deterministic heuristic algorithm and a randomized heuristic algorithm are presented to solve UFLP. Though the proposed deterministic heuristic algorithm is very simple, it produces good solution for each ins...

For a fixed integer \(D (\ge 3)\) and \(\lambda \) \(\in \) \({\mathbb {Z}}^+\), a \(\lambda \)-L(D, 2, 1)-labeling of a graph \(G = (V, E)\) is the problem of assigning non-negative integers (known as labels) from the set \(\{0, \ldots , \lambda \}\) to the vertices of G such that if any two vertices in V are one, two and three distance apart from...

The maximal covering location problem (MCLP) deals with the problem of finding an optimal placement of a given number of facilities within a set of customers. Each customer has a specific demand and the facilities are to be placed in such a way that the total demand of the customers served by the facilities is maximized. In this article an improved...

Motivated by a frequency assignment problem, we demonstrate, for a fixed positive integer k, how to label an infinite square grid with a possibly small number of integer labels, ranging from 0 to λ − 1, in such a way that labels of adjacent vertices differ by at least k, vertices connected by a path of length two receive values which differ by at l...

Given a fixed $k$ $\in$ $\mathbb{Z}^+$ and $\lambda$ $\in$ $\mathbb{Z}^+$, the objective of a $\lambda$-$L(k, k-1, \ldots, 2, 1)$-labeling of a graph $G$ is to assign non-negative integers (known as labels) from the set $\{0, \ldots, \lambda-1\}$ to the vertices of $G$ such that the adjacent vertices receive values which differ by at least $k$, ver...

Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorit...

Given a set P of n objects in two dimensional plane and a positive integer k ( ≤ n), we have considered the problem of partitioning P into k clusters of circular shape so as to minimize the following two objectives: (i) the sum of radii of these k circular clusters and (ii) the number of points of P covered by more than one circular cluster. The NS...

An L(4, 3, 2, 1)-labeling of a graph is a function which assigns label to each vertex of the graph such that if two vertices are one, two, three and four distance apart then assigned labels must have a difference of at least 4, 3, 2 and 1 respectively between them. This paper presents L(4, 3, 2, 1)-labeling number for simple graphs such as complete...

Given a set P of n-points (customers) on the plane and a positive integer k (1 ≤ k ≤ n), the objective is to find a placement of k circles (facilities) such that the union of k circles contains all the points of P and the sum of the radii of the circles is minimized. We have proposed a Genetic Algorithm (GA) to solve this problem. In this context,...

It is often needed to install limited number of facilities to address the demand of customers due to resource constraints and thus the requirement to provide service to all customers is not possible to meet. In such situation, the facilities are installed (placed) so that the maximum demand can be met. The problem of installing (locating) such faci...

Abstract— The cost of optical backbone network has increased nowadays. So we need to reduce this cost. One of the major contributory costs is the power consumed by the underlying network. Power may also be consumed by different network equipments viz. add-drop multiplexers (ADM), Network Interface Device (NID), Optical Network Terminal (ONT), elect...

## Questions

Questions (7)

Dear all,

I want to start learning discrete choice-based optimization so that I can use it later for my research works. I want to know about free courses, books, study materials available on this topic. Any suggestions will be appreciated.

Thanks,

Soumen Atta

Hi everyone,

We have implemented four metaheuristic algorithms to solve an optimization problem. Each algorithm is repeated 30 times for an instance of the problem, and we have stored the best objective function values for 30 independent runs for each algorithm.

We want to compare these four algorithms. Apart from maximum, minimum, average, and standard deviation, is there any statistical measure for comparison?

Alternatively, we have four independent samples each of size 30, and we want to test the null hypothesis that the means (or, medians) of these four samples are equal against an alternative hypothesis that they are not. What kind of statistical test should we perform?

Regards,

Soumen Atta

Hello everyone,

We have the following integer programming problem with two integer decision variables, namely x and y:

Min F(f(x), g(y))

subject to the constraints

x <= x

_{b},y <= y

_{b},x, y non-negative integers.

Here, the objective function F is a function of f(x) and g(y). Both the functions f and g can be computed in linear time. Moreover, the function F can be calculated in linear time. Here, x

_{b}and y_{b}are the upper bounds of the decision variables x and y, respectively.How do we solve this kind of problem efficiently? We are not looking for any metaheuristic approaches.

I appreciate any help you can provide. Particularly, it would be helpful for us if you can provide any materials related to this type of problem.

Regards,

Soumen Atta

I am solving an NP-Hard combinatorial optimization problem. I have developed two meta-heuristics to solve this problem. I am getting almost similar results using both the algorithms. I want to compare the performance of these two algorithms using some statistical tests.

I have applied each algorithm 30 times to an instance of the problem, and I have recorded the best-found objective function value for each experiment. Therefore, for each instance of the problem, I have two sets of 30 best-found solutions obtained using the two algorithms.

It would be nice if someone can suggest me the best statistical test that I can apply.

Thanks in advance.

I am looking for research articles that exactly consider the single depot heterogeneous vehicles pickup and delivery problem with time windows. By heterogeneous vehicles, I mean vehicles having different loading capacities.

There are many articles published where single depot and many vehicles with the same loading capacity is considered for the pickup and delivery problem with time windows (PDPTW). I am now looking for research articles (if any such exist) where loading capacities of vehicles are different.

Thanks,

Soumen

Given a positive weighted undirected complete graph with

*n*vertices and an integer*k*, find the minimum weight Hamiltonian cycle of length*k*in it.Note that the value of

*k*is very very less than the value of*n*.Is there any efficient algorithm to solve this problem?

Thanks in advance.

I want to run an optimization model written in OPL (CPLEX). I am a newbie of using CPLEX. I have tried to run the program in my own Desktop PC, but it takes too much of time. So, I want to use cloud resources. I have tried to use the IBM cloud, but I am unable to register there as I don't have any IBM ID. I am a PhD student. So, I want to use cloud resource for free. Any help in this regard is highly appreciated.