Selective generalized travelling salesman problem

DOI10.1080/13873954.2019.1705496MaRDI QIDQ5069320zbMATH OpenOpenAlexWikidataFDO

Authors Tusan Derya, Esra Dinler, Bariş Keçeci

Publication date 8 April 2022

Published in Mathematical and Computer Modelling of Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/13873954.2019.1705496

zbMATH Keywords

mathematical formulationrouting problems with profitstravelling salesman

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The selective travelling salesman problem
• A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
• scientific article; zbMATH DE number 1769325
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
• Some Applications of the Generalized Travelling Salesman Problem

Cites work

• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• Generalized orienteering problem with resource dependent rewards
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• scientific article; zbMATH DE number 5621997 (Why is no real title available?)
• Integer Programming Formulation of Traveling Salesman Problems
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• New mathematical models of the generalized vehicle routing problem and extensions
• New models of the generalized minimum spanning tree problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Solving the stochastic time-dependent orienteering problem with time windows
• Some Applications of the Generalized Travelling Salesman Problem
• The effective application of a new approach to the generalized orienteering problem
• The orienteering problem: a survey
• The set orienteering problem
• Using a genetic algorithm to solve the generalized orienteering problem
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants

Cited in

(4)

• A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
• Modeling and solving the two-level generalized median tour problem
• A comprehensive survey on the generalized traveling salesman problem
• On solving close enough orienteering problems with overlapped neighborhoods

Describes a project that uses

Uses Software

• GTSP-LIB

This page was built for publication: Selective generalized travelling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069320)