Makespan minimizing on multiple travel salesman problem with a learning effect of visiting time

-The multiple traveling salesman problem (MTSP) involves the assignment and sequencing procedure simultaneously. The assignment of a set of nodes to each visitors and determining the sequence of visiting of nodes for each visitor. Since specific range of process is needed to be carried out in nodes in commercial environment, several factors associated with routing problem are required to be taken into account. This research considers visitors’ skill and category of customers which can affect visiting time of visitors in nodes. With regard to learning-by-doing, visiting time in nodes can be reduced. And different class of customers which are determined based on their potential purchasing of power specifies that required time for nodes can be vary. So, a novel optimization model is presented to formulate MTSP, which attempts to ascertain the optimum routes for salesmen by minimizing the makespan to ensure the balance of workload of visitors. Since this problem is an NP-hard problem, for overcoming the restriction of exact methods for solving practical large-scale instances within acceptable computational times. So, Artificial Immune System (AIS) and the Firefly (FA) metaheuristic algorithm are implemented in this paper and algorithms parameters are calibrated by applying Taguchi technique. The solution methodology is assessed by an array of numerical examples and the overall performances of these metaheuristic methods are evaluated by analyzing their results with the optimum solutions to suggested problems. The results of statistical analysis by considering 95% confidence interval for calculating average relative percentage of deviation (ARPD) reveal that the solutions of proposed AIS algorithm has less variation and Its’ confidence interval of closer than to zero with no overlapping with that of FA. Although both proposed meta-heuristics are effective and efficient in solving small-scale problems, in medium and large scales problems, AIS had a better performance in a shorter average time. Finally, the applicability of the suggested pattern is implemented in a case study in a specific company, namely Kalleh

When the path is never shortest: a reality check on shortest path biocomputation

Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route optimisation and labyrinth navigation, but their outputs are typically difficult to reproduce and somewhat abstract in nature, suggesting that both experimental design and analysis in the field require standardising. This chapter details laboratory experimental data which probe the path finding process in two single-celled protistic model organisms, Physarum polycephalum and Paramecium caudatum, comprising a shortest path problem and labyrinth navigation, respectively. The results presented illustrate several of the key difficulties that are encountered in categorising biological behaviours in the language of computing, including biological variability, non-halting operations and adverse reactions to experimental stimuli. It is concluded that neither organism examined are able to efficiently or reproducibly solve shortest path problems in the specific experimental conditions that were tested. Data presented are contextualised with biological theory and design principles for maximising the usefulness of experimental biocomputer prototypes.Comment: To appear in: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

Multi-level evolutionary algorithms resource allocation utilizing model-based systems engineering

This research presents an innovative approach to solve the resource allocation problems using Multi-level Evolutionary Algorithms. Evolutionary Algorithms are used to solve resource allocation problems in different domains and their results are then incorporated into a higher level system solution using another Evolutionary Algorithm to solve base camp planning problems currently faced by the U.S. Department of Defense. Two models are introduced to solve two domain specific models: a logistics model and a power model. The logistic model evaluates routes for logistics vehicles on a daily basis with a goal of reducing fuel usage by delivery trucks. The evaluation includes distance traveled and other constraints such as available resource levels and priority of refilling. The Power model incorporates an open source electrical distribution simulator to evaluate the placement of structures and generators on a map to reduce fuel usage. These models are used as the fitness function for two separate Evolutionary Algorithms to find solutions that reduce fuel consumption within the individual domains. A multi-level Evolutionary Algorithm is then presented, where the two Evolutionary Algorithms share information with a higher level Evolutionary Algorithm that combines the results to account for problem complexity from the interfacing of these systems. The results of using these methods on 5 different base camp sizes show that the techniques provide a considerable reduction of fuel consumption. While the Evolutionary Algorithms show significant improvement over the current methods, the multi-level Evolutionary Algorithm shows better performance than using individual Evolutionary Algorithms, with the results showing a 19.25 % decrease in fuel consumption using the multi-level Evolutionary Algorithm --Abstract, page iii