Search all articles

In order to enhance the performance of shuffled frog leaping algorithm in solving optimization problem, this paper added the mutation operator to original shuffled frog leaping algorithm, an improved shuffled frog-leaping algorithm of solving TSP was proposed. Simulation results show that the improved...

Objective: A novel Greedy Randomized Adaptive Search Procedure was proposed in this paper to resolve the traveling salesman problem, which is proven to be NP-complete in most cases. Methods: The proposed novel algorithm has two phases. In the first phase the novel algorithm finds an initial solution...

For deep tunnels, their engineering geological and hydro-geological conditions are highly changeable and complex. Rough construction often triggers or produces accidents, such as water inrush, mud inrush, landslides etc. For informational dynamic design and construction of tunnels, it is of vital importance...

With the progress of society, the continuous improvement of living standards, people are increasingly strong demand for fitness. Fitness equipment plays a very important role in the national fitness. Therefore, it has important significance to the reasonable distribution route for fitness equipment business....

The TSP is a typical NPproblem. Therefore it is very important to the optimization for solving TSP problem. The genetic algorithm is one of ideal methods in solving it. However, the traditional genetic algorithm has the problems of slow convergence speed and local optimum. Aiming at the existing problems,...

West Africa is hit by the most unprecedented outbreak of Ebola virus and the medication that can resist the virus has been discovered. This paper establishes a mathematical model to discuss determination of the transportation organization scheme. In the model, we choose several major Ebola treatment...

Fog haze weather frequently appears in recent years. Fog haze not only makes the travel inconvenient, also has a harmful effect on body. Fog haze brings serious security hidden danger to the power grid safety and power equipment operation. The lightest situation is shortening the time of saturated salt...

The Time-Dependent Traveling Salesman Problem (TDTSP) is a generalization of the Traveling Salesman Problem (TSP) and Traveling Repairman Problem (TRP). In the TSP and TRP, the travel time to travel is assumed to be constant. However, in practice, the travel times vary according to several factors that...

Firefly algorithm, a new type of swarm intelligence in optimization, has a good performance in combinatorial optimization problem. For Traveling Salesmen Problem (TSP), this process proposes an optimized path approach based on the modified firefly algorithm. In order to avoid a local optimum, an elitist...

Traveling sales problem (TSP) is one of the classical optimization problems and NP-complete. The Challenge in implementing TSP is how to determine the shortest distance from a traveling route of N cities where each N city visited precisely once at time. In this paper, we attempt to analyze the completion...

Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem. The Particle Swarm Optimization has been proven to succeed in lots of problems, but the PSO algorithm is challenging due to a variety of factors such as easy to fall into local optimal solution and the convergence...

Marriage in Honey Bees Optimization (MBO) is a swarm-intelligence method. To improve its optimization performance, the Nelder-Mead method is used combined with MBO. The paper proposed an improved Marriage in Honey Bees Optimization algorithm. The local characteristic is obtained by Nelder-Mead Method...

Traveling Salesman Problems is a classical kind of combined optimization problems. Solving TSP effectively can produce very important theoretical value in computable theory, and also has very high applied value in practice. Solving travel salesman problems by using some traditional algorithms is limited,...

Ant colony algorithm (ACA) is a very effective way for traveling salesman problem (TSP) due to the positive feedback and the distributed parallel computing mechanism. But it has many drawbacks, for example, long search time, precocity and stagnation. In order to speed up convergence rate and ensure the...

In this paper we revisit the memetic evolutionary family of metaheuristics, called Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), whose members combine Furuhashi's Bacterial Evolutionary Algorithm and various discrete local search techniques. These algorithms have proven to be efficient...

An intuitionistic fuzzy hybrid discrete particle swarm optimization (IF-HDPSO) is proposed for solving travelling salesman problem (TSP). By defining intuitionistic fuzzy charisma function, the IF-HDPSO algorithm exploits some other individuals to participate in the updates of velocity and position except...

Fuzzy logic has been a useful tool for modeling complex problems, with the use of fuzzy variables and fuzzy rules, and in this paper we use a fuzzy system for parameter adaptation in the Ant Colony Optimization (ACO meta-heuristic). In this case we perform the dynamic adaptation of Alpha and Rho parameters;...

With the development of society, more and more people are gradually realizing the importance of automobiles. Automobiles are not only an important means of transportation for people, but also a manifestation of the improvement of people’s quality of life. Therefore, through the development of automobiles,...

By investigating the statistical data of the fuel consumption of urban residents’ life in Guilin area from 2012 to 2013, the emission factors were determined after referenced literatures from home and abroad. Through the methods above, the author finally calculates the annual atmospheric pollutant emissions...

Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc. While Traveling Salesman Problem (TSP) focuses on searching a path of minimum traveling distance to visit...

The objective of travelling salesman problem (TSP) is to find the optimal Hamiltonian cycle (OHC) and it has been proven to be NP-complete. A heuristic method is proposed for TSP. It is realized with four steps. A set of approximations are computed with the 2-opt move algorithm firstly. Secondly, a frequency...

Artificial Bee Colony Algorithm (ABCA) is a novel swarm intelligence algorithm which a colony of artificial bees cooperate in finding good solutions for numerical optimization problems and combinatorial optimization problems. Traveling Salesman Problem (TSP) is a famous combinatorial optimization problem...

Elliptic curve cryptography(ECC) is one of the most important public key cryptography. The koblitz curve is a special kind of elliptic curve in ECC. The e1liptic curve cryptosystem (ECC) which is based on elliptic curve discrete logarithm problem. As of today the security of an ECC is determined by the...

Stochastic Traveling Salesman Problem (S-TSP) with Partial Visibility and Randomized Edge Weights is a critical challenge in disaster management where uncertainty and dynamic conditions hinder effective rescue operations. To address this, five optimization algorithms, Genetic Algorithm (GA), Ant Colony...

Combinatorial Problems (NP hard Problem) have always been a hard task to be solved to optimal level but for the efficiency and finding the best possible solution in a certain span of time it has been solved to suboptimal level. During the study for solving the combinatorial problems to suboptimal level...

TSP problem is a typical combinatorial optimization problem, which has been applied in many fields in real life. InÿtheÿsolutionÿofÿTSP, it is no doubt that it will reduce some unnecessary calculations if the approximate path is determined in advance. Sequential access restrictions combined with the...

The development of information and communication technologies (ICT) has changed learning system in universities, including its course materials. Offline course materials have been outdated, gradually replaced by online-based materials. As the course aiming at preparing students to become not only scientists...

In order to extend the application of ant colony algorithm (ACA), many scholars combined the ant colony algorithm with immune algorithm (IA) or other algorithms to solve the problem of slow convergence. To fully solve the too long search time, easily falling into local optimization, slow convergence...

As an attempt to solve Permutation Optimisation Problems (POP) by using CLONALG (Clonal Selection Algorithm), a well-established artificial immune system, Traveling Salesman Problem (TSP) is studied as an example in this paper. Operators of CLONALG, especially the hyper-mutation operators are analyzed...

This paper aiming at the traffic control of fight to solve the problem of fight delay. To reinforce the traffic control, we build the aircraft queue scheduling model, which include two sub-models. When the amount of landing flights exceeds the runway capacity, the problem can transfer to the traveling...

The Traveling Salesman Problem is a combinatorial optimization problem, the problem has been shown to belong to the NPC problem, the possible solution of Traveling Salesman Problem and the scale of the cities have the exponential relation, so the more bigger of the scale. In this paper, improve the search...

The mechanisms and basic principles about ant colony algorithm is researched, and in system point of view such characteristics as positive feedback, self-organizing systems, and distributed computing of the ant colony algorithm are analyzed. Analysis, verify and classify improved optimization algorithm...

Wood was treated with guanyl urea phosphate (GUP) to impart flame retardant. The flame retarding behavior of samples was valued by cone calorimeter and thermalgravimetric analysis. The flammability parameters, including rate of heat release (RHR), total heat release (THR), total mass loss (TML) and mass...

The main work of this thesis is to study and discuss flame retardant properties of the flexible polyurethane foam (FPUF) added with borax as flame retardant. The flammability parameters, including limiting oxygen index(LOI), rate of heat release (RHR), total heat release (THR), total mass loss (TML)...

With the improvement of people’s living standards and the increase of rural tourism quality requirements, Mudanjiang snow town tourism has become a popular tourist resort. The travel website provides plenty of information, and tourists can arrange the route according to their own plans. However, most...

Gangue as flame retardant was used to flexible poly (vinyl chloride) (PVC), and the flame retardant properties of PVC were investigated by the limiting oxygen index, and cone calorimeter tests (CONE). The CONE result indicated that the rate of heat release (HRR) and total heat release (THR) of PVC treated...

Based on the ant colony algorithm analysis and research, this paper proposed an improved ant colony algorithm. Through updating pheromone and optimal search strategy, then applied to the Traveling Salesman Problem (TSP), effectively improved the searching capability of the algorithm. Finally through...

Travelling salesman problem (TSP) is a fundamental combinatorial optimization model studied in the operations research community for nearly half a century. It belongs to the class of NP-Complete problems. It has been proved that evolutionary algorithms are effective and efficient, with respect to the...

Expanded graphite (EG) was used as a flame retardant and mixed with the flexible polyurethane foam (FPUF). The effects of EG on flame retardant properties of FPUF were studied by limiting oxygen index(LOI), rate of heat release (RHR), total heat release (THR), total mass loss (TML) and mass loss rate...

In order to research electronic balance application in PM2.5 ~ PM10 particle "weighing method" detection. This article studied operational principle and relative merits of 3 common detection methods including TEOM analytic method, beta-ray analytic method and weighting analytic method for PM2.5 ~ PM10...

In this paper, two smoothing effects are firstly pointed out by analysis and by experiment on Traveling Salesman Problem(TSP) instances. We design a novel algorithm which runs stochastic local search under the SSS framework. The function determining the accepting probability of uphill moves is designed...

Less Flexibility First(LFF) principle is inspired and developed by enhancing some rule-of-thumb guidelines resulting from the generation-long work experience of human professionals in ancient days. In this paper, we generalize this principle to the classical Traveling Salesman Problem and propose a tour...

In this paper, a novel ant colony optimization (ACO) simulation platform is developed by MATLAB/GUI toolbox to solve traveling salesman problem (TSP). The modular design concept is applied to divide platform into four main modules. The function modules are designed by using MATLAB/GUI toolbox. The development,...

It is very difficult to predict bridge deflection deformation accurately due to a variety of complex factors. Based on the TSP Ant Colony Algorithm model, combined with the actual deflection of a bridge, the Ant Colony Algorithm model of deflection prediction has eventually been established after determining...

Chaotic neural network has a wide range of applications, especially in uncertain time-series prediction. Aihara Neural Network takes refractoriness into consideration and shows superiority in solution to TSP. The inspiration was from peers’ work on specifically targeted on deep brain by nanometre materials....

Multiprocessor system plays an important role in the computer, in order to improve the parallel computing performance of the system, its essence is to solve a multiprocessor system task scheduling algorithm of NP problem, and the TSP (traveling salesman problem) is a typical NP-complete problem. This...

The Jakarta Old-City Area is a geographical spatial unit that has been appointed as an urban heritage of Jakarta. This study discusses the application of urban heritage management in Jakarta Old-City Area. This is related to the fact that Jakarta Old-City Area is used for many activities, including conservation...

The purpose of this study is to evaluate the effectiveness of TSP courses by EDI UNJ. The TSP Program Evaluation by the EDI Center UNJ focused on four aspects including: (1) context, (2) input, (3) process, and (4) product between the 2011/2012 academic year and the 2015/2016 academic year. Viewed from...

Macroscopic models are in general not suit-able for modeling adaptive ridership control since they do not consider individual vehicle arrivals, which are a necessary input to adaptive traffic ridership. The use of a global weighting factor also unavoidably assumes that the passengers in a transit vehicle...

Dairy cows live in a comfortable environment with a THI of less than 72, if it’s higher than it can be affected by heat stress conditions that are indicated by changes in the concentration of the thyroxine hormone. This study aims to determine the level of thyroxine hormone in dairy cows that were given...