The attractive traveling salesman problem

DOI10.1016/j.ejor.2009.06.029zbMath1176.90603OpenAlexW2138232928MaRDI QIDQ1043335

Gilbert Laporte, Jean-François Cordeau, Güneş Erdoğan

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.029

zbMATH Keywords

linearizationtabu searchtraveling salesman problembranch-and-cutdemand allocationdemand attraction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Uncertain multiobjective traveling salesman problem, Orienteering problem: a survey of recent variants, solution approaches and applications, Two level general variable neighborhood search for attractive traveling salesman problem, Formulations for the orienteering problem with additional constraints, A data-driven optimization framework for routing mobile medical facilities, Modelling beneficiaries' choice in disaster relief logistics, Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem, Attractive orienteering problem with proximity and timing interactions, Prioritized single nurse routing and scheduling for home healthcare services, The multi-vehicle probabilistic covering tour problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• On the global optimization of sums of linear fractional functions over a convex set
• The gravity \(p\)-median model
• The selective travelling salesman problem
• Facet identification for the symmetric traveling salesman polytope
• A note on a global approach for general 0-1 fractional programming
• Solving the sum-of-ratios problem by an interior-point method
• A tabu search heuristic for the undirected selective travelling salesman problem
• Validating the gravity-based competitive location model using inferred attractiveness
• Locating median cycles in networks
• Finding the optimal solution to the Huff based competitive location model
• Solution of a fractional combinatorial optimization problem by mixed integer programming
• The orienteering problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• TSPLIB—A Traveling Salesman Problem Library
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Experiments in mixed-integer linear programming using pseudo-costs
• The Covering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• The Ring Star Problem: Polyhedral analysis and exact algorithm