The Attractive Traveling Salesman Problem

In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed through an attraction function: every visited facility vertex attracts a portion of the profit from the customer vertices based on the distance between the facility and customer vertices, and the attractiveness of the facility vertex. A gravity model is used for computing the profit attraction. The problem is formulated as an integer non-linear program. A linearization is proposed and strengthened through the introduction of valid inequalities, and a branch-and-cut algorithm is developed. A tabu search algorithm is also implemented. Computational results are reported.

[1]  Zvi Drezner,et al.  Validating the Gravity-Based Competitive Location Model Using Inferred Attractiveness , 2002, Ann. Oper. Res..

[2]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[3]  Jean-Michel Gauthier,et al.  Experiments in mixed-integer linear programming using pseudo-costs , 1977, Math. Program..

[4]  Siegfried Schaible,et al.  Fractional Programming , 2009, Encyclopedia of Optimization.

[5]  Inmaculada Rodríguez Martín,et al.  Locating median cycles in networks , 2005, Eur. J. Oper. Res..

[6]  Giovanni Rinaldi,et al.  Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

[7]  H. P. Benson,et al.  On the Global Optimization of Sums of Linear Fractional Functions over a Convex Set , 2004 .

[8]  S. Morito,et al.  AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM , 1988 .

[9]  W. Reilly.  The law of retail gravitation , 1931 .

[10]  Zvi Drezner,et al.  A Note on Applying the Gravity Rule to the Airline Hub Problem , 2001 .

[11]  Tammy Drezner,et al.  Competitive Facility Location in the Plane , 1995 .

[12]  Roland W. Freund,et al.  Solving the Sum-of-Ratios Problem by an Interior-Point Method , 2001, J. Glob. Optim..

[13]  D. Huff.  A Programmed Solution for Approximating an Optimum Retail Location , 1966 .

[14]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[15]  H. Hotelling.  Stability in Competition , 1929 .

[16]  Alain Billionnet,et al.  Solution of a fractional combinatorial optimization problem by mixed integer programming , 2006, RAIRO Oper. Res..

[17]  Michel Gendreau,et al.  The Covering Tour Problem , 1997, Oper. Res..

[18]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[19]  M. J. Hodgson.  A location—allocation model maximizing consumers' welfare , 1981 .

[20]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[21]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[22]  Gilbert Laporte,et al.  A Covering Tour Model for Planning Mobile Health Care Facilities in SuhumDistrict, Ghama , 1998 .

[23]  David L. Huff,et al.  Defining and Estimating a Trading Area , 1964 .

[24]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[25]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[26]  Zvi Drezner,et al.  Finding the optimal solution to the Huff based competitive location model , 2004, Comput. Manag. Sci..

[27]  Michel Gendreau,et al.  A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..

[28]  M. J. Hodgson,et al.  Spatial Accessibility to Health Care Facilities in Suhum District, Ghana , 1994 .

[29]  Christopher S. Tang,et al.  Determining Where to Shop: Fixed and Variable Costs of Shopping , 1998 .

[30]  Gilbert Laporte,et al.  Demand allocation functions , 1998 .

[31]  이용호,et al.  A Branch and Cut Algorithm for the Steiner Ring Star Problem , 1998 .

[32]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[33]  Inmaculada Rodríguez Martín,et al.  The Ring Star Problem: Polyhedral analysis and exact algorithm , 2004, Networks.

[34]  Zvi Drezner,et al.  Multiple Facilities Location in the Plane Using the Gravity Model , 2006 .

[35]  Tai-Hsi Wu.  A note on a global approach for general 0-1 fractional programming , 1997 .

[36]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[37]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..