Results 91 to 100 of about 17,281 (197)

Multiple crossover genetic algorithm for the multiobjective traveling salesman problem

Electronic Notes in Discrete Mathematics, 2010
Abstract Many crossover operators have been proposed and adapted to different combinatorial optimization problems. In particular, many permutation based crossovers are well designed for the traveling salesman problem (TSP) which is among the most-studied combinatorial optimization problems. However, there is no evidence that one crossover operator is
Semya Elaoud, Jacques Teghem, Taïcir Loukil   +2 more
openaire   +1 more source

Sparse experimental design : an effective an efficient way discovering better genetic algorithm structures [PDF]

, 2001
The focus of this paper is the demonstration that sparse experimental design is a useful strategy for developing Genetic Algorithms. It is increasingly apparent from a number of reports and papers within a variety of different problem domains that the ...
Braiden, P. M., Hicks, C., Pongcharoen, P., Stewardson, D.J., Whitfield, R.I.   +4 more
core  

Dataset for the electric capacitated traveling salesman problem. [PDF]

Data Brief, 2023
Gialos A, Zeimpekis V.
europepmc   +1 more source

K-DSA for the Multiple Traveling Salesman Problem

Journal of Systems Engineering and Electronics, 2023
Sheng Tong, Hong Qu, Junjie Xue
openaire   +1 more source

A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem

Computers & Operations Research
This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a dynamic programming algorithm is employed to evaluate the individual and find the optimal mTSP solution for ...
Sasan Mahmoudinazlou, Changhyun Kwon
openaire   +3 more sources

Hierarchical Crossover and Probability Landscapes of Genetic Operators

, 1995
The time evolution of a simple model for crossover is discussed. A variant of this model with an improved exploration behavior in phase space is derived as a subset of standard one- and multi-point crossover operations.
Bornholdt, Stefan, Schuster, Heinz Georg
core   +1 more source

QUANTUM INSPIRED EVOLUTIONARY ALGORITHM FOR SOLVING MULTIPLE TRAVELLING SALESMAN PROBLEM

International Journal of Research in Engineering and Technology, 2013
Quantum computing is a relatively new but very promising field of computer science. It provides an alternative way of building computers which are significantly better than current day’s classical computers. Here in this paper, we attempt to develop an algorithm which makes use of the concepts of quantum computers but are actually run on classical ...
openaire   +1 more source

The 2-period balanced traveling salesman problem [PDF]

In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every ...
Francesco Mason, Tatiana Bassetto
core  

Operations Research Games: A Survey [PDF]

This paper surveys the research area of cooperative games associated with several types of operations research problems in which various decision makers (players) are involved.Cooperating players not only face a joint optimisation problem in trying, e.g.,
Borm, P.E.M., Hamers, H.J.M., Hendrickx, R.L.P.   +2 more
core   +1 more source

GIS and Network Analysis [PDF]

Both geographic information systems (GIS) and network analysis are burgeoning fields, characterised by rapid methodological and scientific advances in recent years.
Manfred M. Fischer
core