The capacitated family traveling salesperson problem

DOI10.1111/itor.13422OpenAlexW4390345328MaRDI QIDQ6195021

José Luis González-Velarde, Yasmin A. Rios-Solis, Unnamed Author, Unnamed Author

Publication date: 12 March 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13422

zbMATH Keywords

integer programmingmetaheuristicstraveling salesman problembiased random-key genetic algorithmcapacitated family traveling salesperson problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• A biased random key genetic algorithm for the field Technician scheduling problem
• Solving the family traveling salesman problem
• The Steiner traveling salesman problem and its extensions
• A biased random-key genetic algorithm for the set orienteering problem
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
• Formulations and valid inequalities for the heterogeneous vehicle routing problem
• A biased random-key genetic algorithm for the minimization of open stacks problem
• The Generalized Covering Salesman Problem
• Integer Programming Formulation of Traveling Salesman Problems
• TSPLIB—A Traveling Salesman Problem Library
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Randomized heuristics for the family traveling salesperson problem
• A biased‐randomized metaheuristic for the capacitated location routing problem
• An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
• Heuristic approaches for the family traveling salesman problem
• An adaptive memory matheuristic for the set orienteering problem

This page was built for publication: The capacitated family traveling salesperson problem