A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem
S Mahmoudinazlou, C Kwon - Computers & Operations Research, 2024 - Elsevier
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 …
Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a …
A comparative study of improved GA and PSO in solving multiple traveling salesmen problem
Multiple traveling salesman problem (MTSP) is a generalization of the classic traveling
salesman problem (TSP). Compared to TSP, MTSP is more common in real-life applications …
salesman problem (TSP). Compared to TSP, MTSP is more common in real-life applications …
An immune genetic algorithm for solving NPV-based resource constrained project scheduling problem
The net present value (NPV)-based resource constrained project scheduling problem
(RCPSP) is a well-known scheduling problem in many industries, such as construction …
(RCPSP) is a well-known scheduling problem in many industries, such as construction …
Compact integer programs for depot-free multiple traveling salesperson problems
JA Cornejo-Acosta, J García-Díaz… - Mathematics, 2023 - mdpi.com
Multiple traveling salesperson problems (m TSP) are a collection of problems that
generalize the classical traveling salesperson problem (TSP). In a nutshell, an m TSP …
generalize the classical traveling salesperson problem (TSP). In a nutshell, an m TSP …
Comparative study on different encoding strategies for multiple traveling salesmen problem
Multiple traveling salesmen problem (MTSP) is an extension of traditional traveling
salesman problem (TSP). It involves both the city assignment optimization and the route …
salesman problem (TSP). It involves both the city assignment optimization and the route …
Comparative analysis of five local search operators on visiting constrained multiple traveling salesmen problem
Visiting constrained multiple traveling salesmen problem (VCMTSP) is an extension of the
multiple traveling salesmen problem (MTSP). In this problem, each city is restricted to be …
multiple traveling salesmen problem (MTSP). In this problem, each city is restricted to be …
[HTML][HTML] Genetic algorithm to the bi-objective multiple travelling salesman problem
S Linganathan, P Singamsetty - Alexandria Engineering Journal, 2024 - Elsevier
The travelling salesman problem (TSP) and its variants have been studied extensively due
to its wide range of real-world applications, yet there are challenges in providing efficient …
to its wide range of real-world applications, yet there are challenges in providing efficient …
Reinforcement Learning for Two-Stage Permutation Flow Shop Scheduling—A Real-World Application in Household Appliance Production
Solving production scheduling problems is a difficult and indispensable task for
manufacturers with a push-oriented planning approach. In this study, we tackle a novel …
manufacturers with a push-oriented planning approach. In this study, we tackle a novel …
Proximity-based maens for capacitated multiple traveling salesmen problem
Abstract Capacitated Multiple Traveling Salesmen Problem (CMTSP) is an extension of the
traditional Multiple Traveling Salesmen Problem (MTSP). In this problem, each city has a …
traditional Multiple Traveling Salesmen Problem (MTSP). In this problem, each city has a …
A population-based algorithm for the multi travelling salesman problem
R Bolanos - International Journal of Industrial Engineering …, 2016 - growingscience.com
This paper presents the implementation of an efficient modified genetic algorithm for solving
the multi-traveling salesman problem (mTSP). The main characteristics of the method are …
the multi-traveling salesman problem (mTSP). The main characteristics of the method are …