The design of the evolutionary algorithm with learning capability from past search
experiences has attracted growing research interests in recent years. It has been …

This paper applies a hybrid simulated annealing–tabu search algorithm to solve the
Traveling Salesman Problem (TSP). Fully considering the characteristics of the hybrid …

The overall quality of last-mile delivery in terms of operational costs and customer
satisfaction is primarily affected by traditional logistics planning and the consideration and …

Most combinatorial optimization problems belong to the NP-complete or NP-hard classes,
which means that they may require an infeasible processing time to be solved by an …

This paper introduces a new hybrid algorithmic nature inspired approach based on Honey
Bees Mating Optimization for successfully solving the Euclidean Traveling Salesman …

In last-mile delivery, on-line retailers deliver goods from local distribution centers to endpoint
customers using a fleet of vehicles. This problem is often related to vehicle routing problems …

To improve the design and control of FC (fuel cell) models, it is important to extract their
unknown parameters. Generally, the parameter extraction problems of FC models can be …

In this paper, we proposed a new crossover operator and a population initialization method
for solving multiple traveling salesmen (MTSP) problem in genetic algorithm (GA) …

We investigate heuristic search algorithms to generate high-quality micromanagement in
combat scenarios for real-time strategy (RTS) games. Macro-and micromanagement are two …

The Travelling Salesman Problem or the TSP is a representative of a large class of problems
known as combinatorial optimization problems. In the ordinary form of the TSP, a map of …