A plan for transportation and distribution the products based on multi-objective travelling salesman problem in fuzzy environmental

Transportation and distribution are the most important elements in the work system for any company, which are of great importance in the success of the chain work. Al-Rabee factory is one of the largest ice cream factories in Iraq and it is considered one of the most productive and diversified factories with products where its products cover most areas of the capital Baghdad, however, it lacks a distribution system based on scientific and mathematical methods to work in the transportation and distribution processes, moreover, these processes need a set of important data that cannot in any way be separated from the reality of fuzziness industrial environment in Iraq, which led to use the fuzzy sets theory to reduce the levels of uncertainty. The decision-maker has several goals that he aspires to accomplish for two stages, so, the decision-maker adopted in his work system on a multi-objective travelling salesman problem. A network of paths for transportation and distribution of the products has been designed based on a multi-objective travelling salesman problem, by building a mathematical model that finds the best paths for each stage, taking into account the goals required by the decision-maker. The results obtained from the use of (Lingo) software showed the importance of these methods in determining the optimal path for the processes of collecting and transporting milk from their collection centers to the Al-Rabee factory as a first stage, as well as transporting the final products and distributing them from the Al-Rabee factory to the shopping centers as a second stage

Dhouib-Matrix-TSP1 Method to Optimize Octagonal Fuzzy Travelling Salesman Problem Using α-Cut Technique

This paper proposes the optimization of the fuzzy travel salesman problem by using the α-Cut technique as a ranking function and the Dhouib-Matrix-TSP1 as an approximation method. This method is enhanced by the standard deviation metric and obtains a minimal tour in fuzzy environment where all parameters are octagonal fuzzy numbers. Fuzzy numbers are converted into a crisp number thanks to the ranking function α-Cut. The proposed approach in details is discussed and illustrated by a numerical example. This method helps in designing successfully the tour to a salesman on navigation through the distance matrix so that it minimizes the total fuzzy distance

A Perturbed Self-organizing Multiobjective Evolutionary Algorithm to solve Multiobjective TSP

Travelling Salesman Problem (TSP) is a very important NP-Hard problem getting focused more on these days. Having improvement on TSP, right now consider the multi-objective TSP (MOTSP), broadened occurrence of travelling salesman problem. Since TSP is NP-hard issue MOTSP is additionally a NP-hard issue. There are a lot of algorithms and methods to solve the MOTSP among which Multiobjective evolutionary algorithm based on decomposition is appropriate to solve it nowadays. This work presents a new algorithm which combines the Data Perturbation, Self-Organizing Map (SOM) and MOEA/D to solve the problem of MOTSP, named Perturbed Self-Organizing multiobjective Evolutionary Algorithm (P-SMEA). In P-SMEA Self-Organizing Map (SOM) is used extract neighborhood relationship information and with MOEA/D subproblems are generated and solved simultaneously to obtain the optimal solution. Data Perturbation is applied to avoid the local optima. So by using the P-SMEA, MOTSP can be handled efficiently. The experimental results show that P-SMEA outperforms MOEA/D and SMEA on a set of test instances

Many-Objective Genetic Type-2 Fuzzy Logic Based Workforce Optimisation Strategies for Large Scale Organisational Design

Workforce optimisation aims to maximise the productivity of a workforce and is a crucial practice for large organisations. The more effective these workforce optimisation strategies are, the better placed the organisation is to meet their objectives. Usually, the focus of workforce optimisation is scheduling, routing and planning. These strategies are particularly relevant to organisations with large mobile workforces, such as utility companies. There has been much research focused on these areas. One aspect of workforce optimisation that gets overlooked is organisational design. Organisational design aims to maximise the potential utilisation of all resources while minimising costs. If done correctly, other systems (scheduling, routing and planning) will be more effective. This thesis looks at organisational design, from geographical structures and team structures to skilling and resource management. A many-objective optimisation system to tackle large-scale optimisation problems will be presented. The system will employ interval type-2 fuzzy logic to handle the uncertainties with the real-world data, such as travel times and task completion times. The proposed system was developed with data from British Telecom (BT) and was deployed within the organisation. The techniques presented at the end of this thesis led to a very significant improvement over the standard NSGA-II algorithm by 31.07% with a P-Value of 1.86-10. The system has delivered an increase in productivity in BT of 0.5%, saving an estimated £1million a year, cut fuel consumption by 2.9%, resulting in an additional saving of over £200k a year. Due to less fuel consumption Carbon Dioxide (CO2) emissions have been reduced by 2,500 metric tonnes. Furthermore, a report by the United Kingdom’s (UK’s) Department of Transport found that for every billion vehicle miles travelled, there were 15,409 serious injuries or deaths. The system saved an estimated 7.7 million miles, equating to preventing more than 115 serious casualties and fatalities

Traveling Salesman Problem

The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance