Generalized profitable tour problems for online activity routing system

Transportation Research Record

Volumn , Issue 2284, 2012, Pages 1-9

  Chow, Joseph ^a   Liu, Hang ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION SUPPORT SYSTEMS; PROFITABILITY;

INSERTION HEURISTICS; MULTI-SOLUTIONS; NEXT GENERATION SYSTEMS; ONLINE ACTIVITIES; PRIZE-COLLECTING; ROUTE GUIDANCE; ROUTING SYSTEM; ROUTINGS; SPATIAL PROXIMITY; TRAVELLING SALESMAN;

GENETIC ALGORITHMS;

EID: 84867818485     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2284-01     Document Type: Article

References (19)

1. Ypartnership/Harrison Group. 2010 Portrait of American Travelers. 〈http://www.ypartnership.com'>http://www.ypartnership.com</ a>
2. Orange Soda. The Power of Local Mobile Search. July 6, 2010. 〈http://www.orangesoda.com/blog/the-power-of-local-mobile-search- infographic'>http://www.orangesoda.com/blog/the-power-of-local-mobile- search-infographic</a>
3. Feillet, D., P. Dejax, and M. Gendreau. Traveling Salesman Problems with Profits. Transportation Science, Vol. 39, No. 2, 2005, pp. 188-205.
4. Srivastava, S. S., S. Kumar, R. C. Garg, and P. Sen. Generalized Travelling Salesman Problem Through n Sets of Nodes. CORS Journal, Vol. 7, 1969, pp. 97-101.
5. Laporte, G., H. Mercure, and Y. Nobert. Generalized Travelling Salesman Problem Through n Sets: The Asymmetrical Case. Discrete Applied Mathematics, Vol. 18, No. 2, 1987, pp. 185-197.
6. Balas, E. The Prize Collecting Traveling Salesman Problem. Networks, Vol. 19, No. 6, 1989, pp. 621-636.
7. Recker, W. W. The Household Activity Pattern Problem: General Formulation and Solution. Transportation Research Part B, Vol. 29, No. 1, 1995, pp. 61-77.
8. Recker W. W. A. Bridge between travel demand modeling and activity-based travel analysis. Transportation Research Part B, 35, 5, 2001, 481-506
9. Dell'Amico, M., F. Maffioli, and P. Värbrand. On Prize-Collecting Tours and the Asymmetric Travelling Salesman Problem. International Transactions in Operational Research, Vol. 2, No. 3, 1995, pp. 297-308.
10. Laporte, G., and S. Martello. The Selective Travelling Salesman Problem. Discrete Applied Mathematics, Vol. 26, No. 2-3, 1990, pp. 193-207.
11. Balas, E. New Classes of Efficiently Solvable Generalized Traveling Salesman Problems. Annals of Operations Research, Vol. 86, 1999, pp. 529-558.
12. Bar-Yehuda, R., G. Even, and S. Shahar. On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows. Journal of Algorithms, Vol. 55, No. 1, 2005, pp. 76-92.
13. Bienstock, D., M. X. Goemans, D. Simchi-Levi, and D. Williamson. A Note on the Prize Collecting Traveling Salesman Problem. Mathematical Programming, Vol. 59, No. 1-3, 1993, pp. 413-420.
14. PhoCusWright. Consumer Response to Travel Site Performance. 2010. 〈http://www.phocuswright.com'>http://www.phocuswright.com</ a>
15. Ausiello, G., V. Bonifaci, and L. Laura. The Online Prize-Collecting Traveling Salesman Problem. Information Processing Letters, Vol. 107, No. 6, 2008, pp. 199-204.
16. Cordeau, J. F., M. Gendreau, G. Laporte, J. Y. Potvin, and F. Semet. A Guide to Vehicle Routing Heuristics. Journal of the Operational Research Society, Vol. 53, No. 5, 2002, pp. 512-522.
17. Tasgetiren, M. F., and A. E. Smith. A Genetic Algorithm for the Orienteering Problem. Proc., Congress on Evolutionary Computation, Vol. 2, IEEE, New York, 2000, pp. 910-915.
18. Lin, S., and B. W. Kernighan. An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research, Vol. 21, No. 2, 1973, pp. 498-516.
19. Gendreau, M., A. Hertz, and G. Laporte. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research, Vol. 40, No. 6, 1992, pp. 1086-1094.