Routing Sales Territory by Solving a Multi-objective TSP Variant with Evolutionary Algorithms

The Traveling Salesman Problem is a classic NP-hard combinatorial problem. However, many real-world scenarios do not match the classic TSP modeling. Thus, this paper proposes generating vendors' routes in a sales territory by extending and combining different TSP variants. The proposal deals wi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings - International Conference on Tools with Artificial Intelligence, TAI s. 109 - 116
Hlavní autori:	Menezes Sampaio, Savio, Dantas, Altino, Camilo-Junior, Celso G.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2019
Predmet:	AI Applications Artificial intelligence Combinatorial Optimization Customer Importance Economics Evolutionary computation Frequency Genetic Algorithms IVF/NSGA-II Multi Objective Memetic Algorithm Multi-Objective Problem Planning and scheduling Proposals Routing Sales Territory Schedules Scheduling Scheduling and Allocation Time-frequency analysis Traveling Salesman Problem Traveling salesman problems Urban areas
ISSN:	2375-0197
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!