Search results

While scheduling and transporting emergency materials in disasters, the emergency materials and delivery vehicles are arriving at the distributing center constantly. Meanwhile, the information of the disaster reported to the government is updating continuously. Therefore, this paper aims to propose an approach to help the government make a transportation plan of vehicles in response to the disasters addressing the problem of material demand and vehicle amount continual alteration.

After elaborating the features and process of the emergency materials transportation, this paper proposes an emergency materials scheduling model in the case of material demand and vehicle amount continual alteration. To solve this model, the paper provides the vehicle transportation route allocation algorithm based on dynamic programming and the disaster area supply sequence self-learning algorithm based on ant colony optimization. Afterwards, the paper uses the model and the solution approach to computing the optimal transportation scheme of the food supply in Lushan earthquake in China.

The case study shows that the model and the solution approach proposed by this paper are valuable to make the emergency materials transportation scheme precise and efficient. The problem of material demand and vehicle amount changing continually during the process of the emergency materials transportation is solved promptly.

The model proposed by this paper improves the existing similar models in the following aspects: the model and the solution approach can not only solve the emergency materials transportation problem in the condition of varying demand and vehicle amount but also save much computing time; and the assumptions of this model are consistent with the actual situation of the emergency relief in disasters so that the model has a broad scope of application.

With enhanced use of humanoids in demanding sectors of industrial automation and smart manufacturing, navigation and path planning of humanoid forms have become the centre of attraction for robotics practitioners. This paper aims to focus on the development and implementation of a hybrid intelligent methodology to generate an optimal path for humanoid robots using regression analysis, adaptive particle swarm optimization and adaptive ant colony optimization techniques.

Sensory information regarding obstacle distances are fed to the regression controller, and an interim turning angle is obtained as the initial output. Adaptive particle swarm optimization technique is used to tune the governing parameter of adaptive ant colony optimization technique. The final output is generated by using the initial output of regression controller and tuned parameter from adaptive particle swarm optimization as inputs to the adaptive ant colony optimization technique along with other regular inputs. The final turning angle calculated from the hybrid controller is subsequently used by the humanoids to negotiate with obstacles present in the environment.

As the current investigation deals with the navigational analysis of single as well as multiple humanoids, a Petri-Net model has been combined with the proposed hybrid controller to avoid inter-collision that may happen in navigation of multiple humanoids. The hybridized controller is tested in simulation and experimental platforms with comparison of navigational parameters. The results obtained from both the platforms are found to be in coherence with each other. Finally, an assessment of the current technique with other existing navigational model reveals a performance improvement.

The proposed hybrid controller provides satisfactory results for navigational analysis of single as well as multiple humanoids. However, the developed hybrid scheme can also be attempted with use of other smart algorithms.

Humanoid navigation is the present talk of the town, as its use is widespread to multiple sectors such as industrial automation, medical assistance, manufacturing sectors and entertainment. It can also be used in space and defence applications.

This approach towards path planning can be very much helpful for navigating multiple forms of humanoids to assist in daily life needs of older adults and can also be a friendly tool for children.

Humanoid navigation has always been tricky and challenging. In the current work, a novel hybrid methodology of navigational analysis has been proposed for single and multiple humanoid robots, which is rarely reported in the existing literature. The developed navigational plan is verified through testing in simulation and experimental platforms. The results obtained from both the platforms are assessed against each other in terms of selected navigational parameters with observation of minimal error limits and close agreement. Finally, the proposed hybrid scheme is also evaluated against other existing navigational models, and significant performance improvements have been observed.

This research aims to propose self-adaptive ant colony optimization (SACO) with changing parameters for solving time-cost optimization (TCO) problems to assist the relevant construction management firm with their technological tool.

A SACO with changing parameters based on information entropy has been employed to model TCO problem, which overcomes the intrinsic weakness of premature convergence of the basic ant colony optimization by adjusting parameters according to mean information entropy of the ant system. A computer simulation with Matlab 7.0 based on a prototype example has been carried out on the basis of SACO for TCO problem.

The test results show that the SACO for TCO model can generate a better cost under the same duration and achieve a better Pareto front than other models. Therefore, the SACO can be regarded as a useful approach for solving construction project TCO problems.

Further research on selection parameters should be conducted to further improve the robustness of the SACO for TCO model.

The modelling results can help the construction management to good result of TCO problems in construction sites.

A new approach to study the TCO model is proposed based on SACO.

This study aims to propose a new airport gate assignment method to effectively improve the comprehensive operation capacity and efficiency of hub airport. Gate assignment is one of the most important tasks for airport ground operations, which assigns appropriate airport gates with high efficiency reasonable arrangement.

In this paper, on the basis of analyzing the characteristics of airport gates and flights, an efficient multi-objective optimization model of airport gate assignment based on the objectives of the most balanced idle time, the shortest walking distances of passengers and the least number of flights at apron is constructed. Then an improved ant colony optimization (ICQACO) algorithm based on the ant colony collaborative strategy and pheromone update strategy is designed to solve the constructed model to fast realize the gate assignment and obtain a rational and effective gate assignment result for all flights in the different period.

In the designed ICQACO algorithm, the ant colony collaborative strategy is used to avoid the rapid convergence to the local optimal solution, and the pheromone update strategy is used to quickly increase the pheromone amount, eliminate the interference of the poor path and greatly accelerate the convergence speed.

The actual flight data from Guangzhou Baiyun airport of China is selected to verify the feasibility and effectiveness of the constructed multi-objective optimization model and the designed ICQACO algorithm. The experimental results show that the designed ICQACO algorithm can increase the pheromone amount, accelerate the convergence speed and avoid to fall into the local optimal solution. The constructed multi-objective optimization model can effectively improve the comprehensive operation capacity and efficiency. This study is a very meaningful work for airport gate assignment.

An efficient multi-objective optimization model for hub airport gate assignment problem is proposed in this paper. An improved ant colony optimization algorithm based on ant colony collaborative strategy and the pheromone update strategy is deeply studied to speed up the convergence and avoid to fall into the local optimal solution.

Software reliability models in the past few years attracted researchers to build an accurate model in the software engineering. Testing is an important factor in the software development cycle.

As testing improves quality and reliability of the application by identifying the bugs in it. Also, it defines the behavior and state of the product based on the defined principles and mechanisms. Conventional reliability models use statistical distributions to attain realistic features.

The ability to predict the bugs in the application during development phase itself is a proper testing practice which saves the time and increases the efficiency of the application. Efficient management and timely release of the product is based on this reliability testing and ant colony optimization (ACO)-based testing is an important optimization model which is available for testing the application.

Conventional ant colony optimization used test case generation as its common approach for testing the reliability of the application. ACO uses pheromone activity and it is related in testing of application and provides a simple positive mechanism by identifying the inactivity and precociousness.

Optimization algorithms can differ in performance for a specific problem. Hybrid approaches, using this difference, might give a higher performance in many cases. This paper presents a hybrid approach of Genetic Algorithm (GA) and Ant Colony Optimization (ACO) specifically for the Integrated Process Planning and Scheduling (IPPS) problems. GA and ACO have given different performances in different cases of IPPS problems. In some cases, GA has outperformed, and so do ACO in other cases. This hybrid method can be constructed as (I) GA to improve ACO results or (II) ACO to improve GA results. Based on the performances of the algorithm pairs on the given problem scale. This proposed hybrid GA-ACO approach (hAG) runs both GA and ACO simultaneously, and the better performing one is selected as the primary algorithm in the hybrid approach. hAG also avoids convergence by resetting parameters which cause algorithms to converge local optimum points. Moreover, the algorithm can obtain more accurate solutions with avoidance strategy. The new hybrid optimization technique (hAG) merges a GA with a local search strategy based on the interior point method. The efficiency of hAG is demonstrated by solving a constrained multi-objective mathematical test-case. The benchmarking results of the experimental studies with AIS (Artificial Immune System), GA, and ACO indicate that the proposed model has outperformed other non-hybrid algorithms in different scenarios.

This paper aims to incorporate a hybridized advanced sine-cosine algorithm (ASCA) and advanced ant colony optimization (AACO) technique for optimal path search with control over multiple mobile robots in static and dynamic unknown environments.

The controller for ASCA and AACO is designed and implemented through MATLAB simulation coupled with real-time experiments in various environments. Whenever the sensors detect obstacles, ASCA is applied to find their global best positions within the sensing range, following which AACO is activated to choose the next stand-point. This is how the robot travels to the specified target point.

Navigational analysis is carried out by implementing the technique developed here using single and multiple mobile robots. Its efficiency is authenticated through the comparison between simulation and experimental results. Further, the proposed technique is found to be more efficient when compared with existing methodologies. Significant improvements of about 10.21 per cent in path length are achieved along with better control over these.

Systematic presentation of the proposed technique attracts a wide readership among researchers where AI technique is the application criteria.

This paper aims to describe a new hybrid ant colony optimization (ACO) algorithm developed to solve facility layout problems (FLPs) formulated as quadratic assignment problems (QAPs).

A hybrid ACO algorithm which combines max‐min ant system (MMAS) (i.e. a variant of ACO) with genetic algorithm (GA) has been developed. The hybrid algorithm is further improved with the use of a novel minimum pheromone threshold strategy (MPTS).

The hybrid algorithm shows satisfactory results in the experimental evaluation due to the synergy and collaboration between MMAS and GA. The results also show that the use of MPTS helps them to achieve such performance, by promoting search diversification.

The experimental evaluation presented emphasizes more on the search performance or pattern of the hybrid algorithm. Detailed computational work could reveal other strengths of the algorithm.

The developmental work presented in this paper could be used by researchers and practitioners to solve QAPs. Its use may also be expanded to solve other combinatorial optimization and engineering problems.

This paper provides useful insights into the development of a hybrid ACO algorithm that combines MMAS with GA for solving QAPs.

The purpose of this paper is to propose a new population-based metaheuristic optimization algorithm, assimilation-accommodation mixed continuous ant colony optimization (ACACO), to improve the accuracy of Takagi-Sugeno-Kang-type fuzzy systems design.

The original N solution vectors in ACACO are sorted and categorized into three groups according to their ranks. The Research Learning scheme provides the local search capability for the best-ranked group. The Basic Learning scheme uses the ant colony optimization (ACO) technique for the worst-ranked group to approach the best solution. The operations of assimilation, accommodation, and mutation in Mutual Learning scheme are used for the middle-ranked group to exchange and accommodate the partial information between groups and, globally, search information. Only the N top-best-performance solutions are reserved after each iteration of learning.

The proposed algorithm outperforms some reported ACO algorithms for the fuzzy system design with the same number of rules. The performance comparison with various previously published neural fuzzy systems also shows its superiority even with a smaller number of fuzzy rules to those neural fuzzy systems.

Future work will consider the application of the proposed ACACO to the recurrent fuzzy network.

The originality of this work is to mix the work of the well-known psychologist Jean Piaget and the continuous ACO to propose a new population-based optimization algorithm whose superiority is demonstrated.

Ant colony algorithm is widely used in recent years as a heuristic algorithm. It provides a new way to solve complicated combinatorial optimization problems. Having been enlightened by the behavior of ant colony's searching for food, positive feedback construction and distributed computing combined with certain heuristics are adopted in the algorithm, which makes it easier to find better solution. This paper introduces a series of ant colony algorithm and its improved algorithm of the basic principle, and discusses the ant colony algorithm application situation. Finally, several problems existing in the research and the development prospect of ACO are reviewed.