The Attractive Traveling Salesman Problem

European Journal of Operational Research

Volumn 203, Issue 1, 2010, Pages 59-69

  Erdoǧan, Güneş ^a   Cordeau, Jean François ^b   Laporte, Gilbert ^b  

^a OZYEGIN UNIVERSITY   (Turkey)

^b HEC MONTRÉAL   (Canada)

Author keywords

Branch and cut; Demand allocation; Demand attraction; Linearization; Tabu search; Traveling Salesman Problem

Indexed keywords

BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; DEMAND ALLOCATION; DEMAND ATTRACTION; GRAVITY MODEL; NON-LINEAR; TABU SEARCH ALGORITHMS; VALID INEQUALITY; VERTEX SET;

CUSTOMER SATISFACTION; INTEGER PROGRAMMING; LEARNING ALGORITHMS; LINEARIZATION; PLATES (STRUCTURAL COMPONENTS); PROBLEM SOLVING; PROFITABILITY; SALES; TABU SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 70350567675     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.06.029     Document Type: Article

References (37)

1. Bell D.R., Ho T.-H., and Tang C.S. Determining where to shop: Fixed and variable costs of shopping. Journal of Marketing Research 35 (1998) 352-370
2. Benson H.P. On the global optimization of sums of linear fractional functions over a convex set. Journal of Optimization Theory and Applications 121 (2004) 19-39
3. Billionnet A., and Djebali K. Résolution d'un problème combinatoire fractionnaire par la programation linéaire mixte. RAIRO - Operations Research 40 (2006) 97-111
4. Drezner T. In: Drezner Z. (Ed). Competitive Facility Location in the Plane Facility Location: A Survey of Applications and Methods (1995), Springer, Berlin 285-300
5. Drezner T., and Drezner Z. A note on applying the gravity rule to the airline hub problem. Journal of Regional Science 41 (2001) 67-73
6. Drezner T., and Drezner Z. Validating the gravity-based competitive location model using inferred attractiveness. Annals of Operations Research 111 (2002) 227-237
7. Drezner T., and Drezner Z. Finding the optimal solution to the Huff based competitive location model. Computational Management Science 1 (2004) 193-208
8. Drezner T., and Drezner Z. Multiple facilities location in the plane using the gravity model. Geographical Analysis 38 (2006) 391-406
9. Drezner T., and Drezner Z. The gravity p-median model. European Journal of Operational Research 179 (2007) 1239-1251
10. Edmonds J., and Karp R.M. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the Association for Computing Machinery 19 (1972) 248-264
11. Eiselt H.A., and Laporte G. Demand allocation functions. Location Science 6 (1998) 175-187
12. Feillet D., Dejax P., and Gendreau M. Traveling salesman problems with profits. Transportation Science 39 (2005) 188-205
13. Fischetti M., Salazar González J.J., and Toth P. Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 10 (1998) 133-148
14. Freund R.W., and Jarre F. Solving the sum-of-ratios problem by an interior-point method. Journal of Global Optimization 19 (2001) 83-102
15. Gauthier J.M., and Ribière G. Experiments in mixed-integer linear programming using pseudo-costs. Mathematical Programming 12 (1977) 26-47
16. Gendreau M., Laporte G., and Semet F. The covering tour problem. Operations Research 45 (1997) 568-576
17. Gendreau M., Laporte G., and Semet F. A tabu search heuristic for the undirected selective traveling salesman problem. European Journal of Operational Research 106 (1998) 539-545
18. Gendreau M., Hertz A., and Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40 (1992) 1086-1094
19. Golden B.L., Levy L., and Vohra R. The orienteering problem. Naval Research Logistics 34 (1987) 307-318
20. Hodgson M.J. A location-allocation model maximizing consumer welfare. Regional Studies 15 (1981) 493-506
21. Hodgson M.J., Laporte G., and Semet F. A covering tour model for planning mobile health care facilities in Suhum District, Ghana. Journal of Regional Science 38 (1998) 621-638
22. Hotelling H. Stability in competition. Economic Journal 39 (1929) 41-57
23. Huff D.L. Defining and estimating a trade area. Journal of Marketing 28 (1964) 34-38
24. Huff D.L. A programmed solution for approximating an optimum retail location. Land Economics 42 (1966) 293-303
25. Jain A.K., and Mahajan V. Evaluating the competitive environment in retailing using multiplicative competitive interactive models. In: Sheth J. (Ed). Research in Marketing, vol. 2 (1979), JAI Press, Greenwich 217-235
26. Kataoka S., and Morito S. An algorithm for the single constraint maximum collection problem. Journal of Operations Research Society of Japan 31 (1988) 515-530
27. Labbé M., Laporte G., Rodriguez-Martín I., and Salazar González J.J. The ring star problem: Polyhedral analysis and exact algorithm. Networks 43 (2004) 177-189
28. Labbé M., Laporte G., Rodriguez-Martín I., and Salazar González J.J. Locating median cycles in networks. European Journal of Operational Research 160 (2005) 457-470
29. Laporte G., and Martello S. The selective traveling salesman problem. Discrete Applied Mathematics 26 (1990) 193-207
30. Lee Y., Chiu S.Y., and Sanchez J. A branch and cut algorithm for the Steiner ring star problem. International Journal of Management Science 4 (1998) 21-34
31. Oppong J.R., and Hodgson M.J. Spatial accessibility to health care facilities in Suhum District, Ghana. The Professional Geographer 46 (1994) 199-209
32. Padberg M.W., and Rinaldi G. Facet identification for the symmetric traveling salesman polytope. Mathematical Programming 47 (1990) 219-257
33. Reilly W.J. The Law of Retail Gravitation (1931), Knickerbocker Press, New York
34. Reinelt G. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3 (1991) 376-384
35. Schaible S. Fractional programming. In: Horst R., and Pardalos P.M. (Eds). Handbook of Global Optimization (1995), Kluwer, Dordrecht 495-608
36. Schaible S. Fractional programming with sums of ratios. In: Castagnoli E., and Giorgi G. (Eds). Scalar and Vector Optimization in Economic and Financial Problems (1996), Elioprint, Milano 163-175
37. Wu T.-H. A note on a global approach for general 0-1 fractional programming. European Journal of Operational Research 101 (1997) 220-223