Özpeynirci, ÖzgürKoksalan, Murat2023-06-162023-06-1620100925-50011573-2916https://doi.org/10.1007/s10898-009-9505-0https://hdl.handle.net/20.500.14365/924In this study, we work on the traveling salesperson problems and bottleneck traveling salesperson problems that have special matrix structures and lead to polynomially solvable cases. We extend the problems to multiple objectives and investigate the properties of the nondominated points. We develop a pseudo-polynomial time algorithm to find a nondominated point for any number of objectives. Finally, we propose an approach to generate all nondominated points for the biobjective case.eninfo:eu-repo/semantics/closedAccessKeywords Pyramidal tourPolynomially solvableMultiple objectivesTSPBTSPTraveling Salesman ProblemTspVanArticle10.1007/s10898-009-9505-0