A comparison between metaheuristic-based and solver-based methods to solve routing problem based on sectorization
This study involves the division of a region into smaller units, based on sectorization, and a route determination for each of them. The routing problem of each unit is defined as a basic traveling salesman problem (TSP). Different implementations of a widely used method to solve TSP are compared. T...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2022
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.14/38857 |
| País: | Portugal |
| Oai: | oai:repositorio.ucp.pt:10400.14/38857 |