Neutrosophic Transport And Assignment Issues

We all know that problems of transportation and allocation appear frequently in practical life. We need to transfer materials from production centers to consumption centers to secure the areas’ need for the transported material or allocate machines or people to do a specific job at the lowest cost, or in the shortest time. We know that the cost factors Time is one of the most important factors that decision-makers care about because it plays an “important” role in many of the practical and scientific issues that we face in our daily lives, and we need careful study to enable us to avoid losses. For this, the linear programming method was used, which is one of the research methods. Processes, where the problem data is converted into a linear mathematical model for which the optimal solution achieves the desired goal. Since these models are linear models, we can solve them using the direct simplex method and its modifications, but the specificity that these models enjoy has enabled scholars and researchers to find special methods that help us in obtaining the optimal solution. Whatever the method used, the goal is to determine the number of units transferred from any material from production centers to consumption centers, or to allocate a machine or person to do a job so that the cost or time is as short as possible. These issues were addressed according to classical logic, but the ideal solution was a specific value appropriate to the conditions in which the data was collected and does not take into account the changes that may occur in the work environment. In order to obtain results that are more accurate and enjoy a margin of freedom, we present in this book a study of transport issues and neutrosophic allocation issues and some methods for solving them. By neutrosophic issues we mean These are the problems in which the data are neutrosophic values, i.e. the required quantities and the available quantities.

In this volume, we present a set of research that was published in cooperation with a number of researchers and those interested in keeping pace with the great scientific development that our contemporary world is witnessing, and one of its products was neutrosophic science, which was founded by the American scientist and mathematical philosopher Florentin Smarandache in 1995. Through it, we present a new vision for some research methods. Operations research to the concepts of this science.

Transport issues aim to determine the number of units that will be transferred from the production centers to consumption areas so that the cost of transportation is as low as possible, taking into account the conditions of supply and demand. Due to the great importance of these issues and to obtain more accurate results that take into account all circumstances, we conducted two research studies. In the first research, we presented a formulation of neutrosophic transport issues, and in the second research, we presented some ways to find a preliminary solution to these issues, but we do not know whether the preliminary solution is optimal or not, so we will present in this research a study whose purpose is to shed light on some important methods used to improve the optimal solution to transportation issues and then reformulating them using the concepts of neutrosophic science, a science that leaves nothing to chance or circumstances but rather provides solutions with neutrosophic values. Unspecified values take into account the best and worst conditions.

One of the most important theories in linear programming is the dualistic theory and its basic idea is that for every linear model has dual linear model, so that solving the original linear model gives a solution to the dual model. Therefore, when we solving the linear programming model, we actually obtain solutions for two linear models. In this research, we present a study of the models. The neutrosophic dual and the binary simplex algorithm, which works to find the optimal solution for the original and dual models at the same time. The importance of this algorithm is evident in that it is relied upon in several operations research topics, such as integer programming algorithms, some nonlinear programming algorithms, and sensitivity analysis in linear programming.

Contributors to current issue (listed in papers’ order): Ibrahim Yasser, Abeer Twakol, A. A. Abd El-Khalek, A. A. Salama, Ahmed Sharaf Al-Din, Issam Abu Al-Qasim, Rafif Alhabib, Magdy Badran, Remya P. B, Francina Shalini, Masoud Ghods, Zahra Rostami, A. Sahaya Sudha, Luiz Flavio Autran Monteiro Gomes, K.R. Vijayalakshmi, Prakasam Muralikrishna, Surya Manokaran, Nidhi Singh, Avishek Chakraborty, Soma Bose Biswas, Malini Majumdar, Rakhal Das, Binod Chandra Tripathy, Nidhi Singh, Avishek Chakraborty, Nilabhra Paul, Deepshikha Sarma, Akash Singh, Uttam Kumar Bera, Fatimah M. Mohammed, Sarah W. Raheem, Muhammad Riaz, Florentin Smarandache, Faruk Karaaslan, Masooma Raza Hashmi, Iqra Nawaz, Kousik Das, Sovan Samanta, Kajal De, Xavier Encarnacion, Nivetha Martin, I. Pradeepa, N. Ramila Gandhi, P. Pandiammal, Aiman Muzaffar, Md Tabrez Nafis, Shahab Saquib Sohail, Abhijit Saha, Jhulaneswar Baidya, Debjit Dutta, Irfan Deli, Said Broumi, Mohsin Khalid, Neha Andaleeb Khalid, Md. Hanif Page, Qays Hatem Imran, Shilpi Pal, S. Satham Hussain, Saeid Jafari, N. Durga, Hanieh Shambayati, Mohsen Shafiei Nikabadi, Seyed Mohammad, Ali Khatami Firouzabadi, Mohammad Rahmanimanesh, Mujahid Abbas, Ghulam Murtaza, K. Porselvi, B. Elavarasan, Y. B. Jun, Chinnadurai V, Sindhu M P, K.Radhika, K. Arun Prakash, Malayalan Lathamaheswari, Ruipu Tan, Deivanayagampillai Nagarajan, Talea Mohamed, Assia Bakali, Nivetha Martin, R. Dhavaseelan, Ali Hussein Mahmood Al-Obaidi, Suman Das, Surapati Pramanik, Madad Khan, Muhammad Zeeshan, Saima Anis, Abdul Sami Awan, M. Sarwar Sindhu, Tabasam Rashid, Agha Kashif, Rajesh Kumar Saini, Atul Sangal, Manisha.

“Neutrosophic Sets and Systems” has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as the neutrosophic structures developed in algebra, geometry, topology, etc. Some articles in this issue: Neutrosophic Soft Fixed Points, Selection of Alternative under the Framework of Single-Valued Neutrosophic Sets, Application of Single Valued Trapezoidal Neutrosophic Numbers in Transportation Problem.

This volume is the first of two containing selected papers from the International Conference on Advances in Mathematical Sciences, Vellore, India, December 2017 - Volume I. This meeting brought together researchers from around the world to share their work, with the aim of promoting collaboration as a means of solving various problems in modern science and engineering. The authors of each chapter present a research problem, techniques suitable for solving it, and a discussion of the results obtained. These volumes will be of interest to both theoretical- and application-oriented individuals in academia and industry. Papers in Volume I are dedicated to active and open areas of research in algebra, analysis, operations research, and statistics, and those of Volume II consider differential equations, fluid mechanics, and graph theory.

Assignment problem (AP) is well- studied and important area in optimization. In this research manuscript, an assignment problem in neutrosophic environment, called as neutrosophic assignment problem (NAP), is introduced. The problem is proposed by using the interval-valued trapezoidal neutrosophic numbers in the elements of cost matrix. As per the concept of score function, the interval-valued trapezoidal neutrosophic assignment problem (IVTNAP) is transformed to the corresponding an interval-valued AP. To optimize the objective function in interval form, we use the order relations. These relations are the representations of choices of decision maker. The maximization (or minimization) model with objective function in interval form is changed to multi- objective based on order relations introduced by the decision makers' preference in case of interval profits (or costs). In the last, we solve a numerical example to support the proposed solution methodology.