The capacitated family traveling salesperson problem

The capacitated family traveling salesperson problem (CFTSP) is about a graph in which nodes are partitioned into disjoint and differently weighted families. The objective is to find the shortest route that visits a given number of nodes in each family with a set of capacitated agents. The CFTSP is...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International transactions in operational research 2024-07, Vol.31 (4), p.2123-2153
Hauptverfasser:	Domínguez‐Casasola, Saúl, González‐Velarde, José Luis, Ríos‐Solís, Yasmín Á., Reyes‐Vega, Kevin Alain
Format:	Artikel
Sprache:	eng
Schlagworte:	biased random‐key genetic algorithm capacitated family traveling salesperson problem Feasibility Genetic algorithms Heuristic methods Integer programming Linear programming metaheuristics Nodes Shortest path algorithms Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!