The selective travelling salesman problem

DOI10.1016/0166-218X(90)90100-QzbMATH Open0695.90098MaRDI QIDQ910347FDOQ910347

G. Laporte, Silvano Martello

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1769325
• A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
• Algorithms for a stochastic selective travelling salesperson problem
• scientific article; zbMATH DE number 795217
• An improved branching rule for the symmetric travelling salesman problem

zbMATH Keywords

upper bound calculationbranch-and boundnode partitioning rulesSelective Traveling Salesman Problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• The orienteering problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Title not available (Why is that?)
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Subtour Elimination Constraints and Connectivity Constraints

Cited In (only showing first 100 items - show all)

• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
• The orienteering problem: a survey
• Orienteering problem with time-windows and updating delay
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• The generalized covering salesman problem
• Genetic algorithm for combinatorial path planning: the subtour problem
• A matheuristic approach to the orienteering problem with service time dependent profits
• Shared capacity routing problem -- an omni-channel retail study
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• Title not available (Why is that?)
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
• The clustered orienteering problem
• A two-stage approach to the orienteering problem with stochastic weights
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
• The orienteering problem with variable profits
• Minimum directed 1-subtree relaxation for score orienteering problem
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• Local search for the undirected capacitated arc routing problem with profits
• Iterated local search for the team orienteering problem with time windows
• Models for a Steiner ring network design problem with revenues
• A branch-and-cut algorithm for the capacitated profitable tour problem
• The balanced traveling salesman problem
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
• Trip planning for visitors in a service system with capacity constraints
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• The multi-district team orienteering problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• A fast and effective heuristic for the orienteering problem
• A stabilized column generation scheme for the traveling salesman subtour problem
• Single string planning problem arising in liner shipping industries: a heuristic approach
• Multiobjective routing problems
• A tabu search heuristic for the undirected selective travelling salesman problem
• A path relinking approach for the team orienteering problem
• Robust UAV mission planning
• Evolution-inspired local improvement algorithm solving orienteering problem
• Solving the team orienteering problem with cutting planes
• Time constrained maximal covering salesman problem with weighted demands and partial coverage
• Selected combinatorial problems of computational biology
• Routing problems: A bibliography
• Using artificial neural networks to solve the orienteering problem
• The attractive traveling salesman problem
• Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A TSSP+1 decomposition strategy for the vehicle routing problem
• Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests
• Managing platelet supply through improved routing of blood collection vehicles
• Strong linear programming relaxations for the orienteering problem
• Solving the team orienteering arc routing problem with a column generation approach
• A TABU search heuristic for the team orienteering problem
• On the nucleolus of the basic vehicle routing game
• Multi-objective vehicle routing problems
• Tabu search for DNA sequencing with false negatives and false positives
• On symmetric subtour problems
• Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
• The vehicle routing-allocation problem: A unifying framework
• An exact algorithm for team orienteering problems
• Shuffling heuristics for the storage location assignment in an AS/RS
• An integer programming-based local search for the covering salesman problem
• A fast solution method for the time-dependent orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
• A comprehensive survey on the generalized traveling salesman problem
• Finding the nucleolus of the vehicle routing game with time windows
• Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
• The hazardous orienteering problem
• Online covering salesman problem
• An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
• PathWyse: a flexible, open-source library for the resource constrained shortest path problem
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• Attractive orienteering problem with proximity and timing interactions
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• Density peak clustering using grey wolf optimization approach
• Multi-start heuristics for unit-capacity orienteering problems
• A Tabu search algorithm for the probabilistic orienteering problem
• A multi-period analysis of the integrated item-sharing and crowdshipping problem
• A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem
• The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
• Exact algorithms for budgeted prize-collecting covering subgraph problems
• UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• Pre-selection Strategies for Dynamic Collaborative Transportation Planning Problems
• A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• The multi-vehicle profitable pickup and delivery problem
• Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints
• Formulations for the orienteering problem with additional constraints
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• Analysis of the selective traveling salesman problem with time-dependent profits
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits

This page was built for publication: The selective travelling salesman problem

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