Search academic resources

The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on...

Subjects / keywords: Metaheuristics; Operations research; Combinatorial optimization; Approximation theory

Subjects / keywords: Computer science; Travelling salesman problem; Computation; Nonlinear system; Optimization problem; Artificial neural network; Mathematical optimization; Combinatorial optimization; Analog computer; Artificial intelligen...

Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., the Traveling Salesperson Problem). More recently, promising results were obtained for solving the Mult...

Interesting real world combinatorial problems are NP-complete and many of them are hard to solve by using traditional methods. However, several heuristic methods have been developed in order to obtain timely suboptimal s...

Protein Folding is an important open problem in the eld of Computational Biology Due to its com binatorial nature exact polynomial algorithms to solve it could not exist and so approximation algorithms and heurist...

This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to ...

Subjects / keywords: graphs and hypergraphs, network theory, combinatorial optimization, coding theory, block designs; Science: Mathematics

Multiple crossover per couple (MCPC) is a newly introduced crossover method which in contrast with the single crossover per couple approach (SCPC), permits more than one crossover operation for each mating pair. MCPC was...

BackgroundLast-mile logistics accounts for approximately 28% of total logistics costs and is a major contributor to urban carbon emissions. The integration of drones with electric trucks offers a path toward more efficie...

This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrain...