Multi-Strategy <em>MAX-MIN</em> Ant System for Solving Quota Traveling Salesman Problem with Passengers, Incomplete Ride and Collection Time
This study proposes a novel adaptation of MAX-MIN Ant System algorithm for the Quota Traveling Salesman Problem with Passengers, Incomplete Ride, and Collection Time. There are different types of decisions to solve this problem: satisfaction of the minimum quota, acceptance of ride requests, and min...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2020
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/73466 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: Multi-Strategy <em>MAX-MIN</em> Ant System for Solving Quota Traveling Salesman Problem with Passengers, Incomplete Ride and Collection Time
- Particle Swarm Optimization Algorithm for the Traveling Salesman Problem
- A Memetic Algorithm for the Car Renter Salesman Problem
- A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman Problem
- iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning
- DAN: Decentralized Attention-based Neural Network for the MinMax Multiple Traveling Salesman Problem
- Construct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman Problem