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...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings - International Conference on Tools with Artificial Intelligence, TAI pp. 109 - 116
Main Authors:	Menezes Sampaio, Savio, Dantas, Altino, Camilo-Junior, Celso G.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2019
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!