A taxonomy to the class of Minimum Latency Problems

IIE Annual Conference and Expo 2013

Volumn , Issue , 2013, Pages 3896-3905

  Moshref Javadi, Mohammad ^a   Lee, Seokcheon ^a  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

Classification; Deliveryman problem; Minimum Latency Problem; Taxonomy; Traveling repairman problem

Indexed keywords

CLASSIFICATION (OF INFORMATION); EXHIBITIONS; RESEARCH;

DELIVERYMAN PROBLEM; KEEP TRACK OF; MINIMUM LATENCY PROBLEMS; RESEARCH EFFORTS; TRAVELING REPAIRMAN PROBLEM; VEHICLE ROUTING PROBLEMS;

TAXONOMIES;

EID: 84900345212     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (58)

1. Afrati, F., Cosmadakis, S., Papadimitriou, C.H., Papageorgiou, G., and Papakostantinou, N., 1986, "The complexity of the travelling repairman problem," Informatique Théorique et Applications, 20, 79-87.
2. Minieka, E., 1986, "The delivery man problem on a tree network," Ann. Oper. Res., 18, 261-266.
3. Lucena, A., 1990, "Time-dependent traveling salesman problem The deliveryman case," Networks, 20, 753-763.
4. Bertsimas, D.J., and Van Ryzin, G., 1991, "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Operations Research, 39(4), 601-615.
5. Tsitsiklis, J., 1992, "Special cases of the traveling salesman and repairman problems with time windows," Networks, 22, 263-282.
6. Bianco, L., Mingozzi, A., and Rlcciardelii, S., 1992, "The Traveling Salesman Problem with Cumulative Costs" Networks, 23, 81-91.
7. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., and Sudan, M., 1994, "The minimum latency problem," Proc. of the twenty-sixth annual ACM symposium on the theory of computing, May 23-25, Montréal, Québec, Canada, 163-171.
8. Averbakh, I., and Berman, O., 1995, "Sales-Delivery Man Problems on Treelike Networks," Networks, 25, 45-58.
9. Goemans, M., and Kleinberg, J., 1998, "An improved approximation ratio for the minimum latency problem," Mathematical Programming, 82, 111-124.
10. Feuerstein, E., and Stougie, L., 2001, "On-line single-server dial-a-ride problems" Theoretical Computer Science, 268(1), 91-105.
11. Wu, B.Y., 2000, "Polynomial time algorithms for some minimum latency problems," Inform. Process. Lett., 75(5), 225-229.
12. Sitters, R., 2002, "The minimum latency problem is NP-hard for weighted trees," Proc. of the 9th Conference on Integer Programming and Combinatorial Optimization, May 27-29, Cambridge, MA, USA, 230-239.
13. Larsen, A., Madsen, O., and Solomon, M., 2002, "Partially dynamic vehicle routing - models and algorithms," Journal of Operational Research Society, 53,637-646.
14. Chaudhuri, K., Godfrey, B., Rao, S., and Talwar, K., 2003, "Paths, trees, and minimum latency tours," Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, October 11-14, Cambridge, MA, USA, 36-45.
15. Fakcharoenphol, J., Harrelson, C., and Rao, S., 2003, "The k-traveling repairman problem," Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms.
16. Jothi, R., and Raghavachari, B., 2004, "Minimum Latency Tours and the k-Traveling Repairmen Problem," Lecture Notes in Computer Science, 2976, 423-433.
17. Mendez-Diaz, I., Zabala, P., and Lucena, A., 2008 "A new formulation for the traveling deliveryman problem," Discrete Applied Mathematics, 156(17), 3223-3237.
18. Bigras, L.P., Gamache, M., and Savard, G., 2008, "The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times," Discrete Optimization, 5, 685-699.
19. Ezzine, I.O., Semet, F., and Chabchoub, H., 2010, "New Formulations for The Traveling Repairman Problem," Proc. of the 8th International Conference of Modeling and Simulation - MOSIM'10, May 10-12, Hammamet, Tunisia.
20. Angel-Bello, F., Alvarez, A., and García, I., 2013, "Two improved formulations for the minimum latency problem," 37(4), 2257-2266.
21. Nagarajan, V., and Ravi, R., 2008, "The Directed Minimum Latency Problem," LNCS, 5171, 193-206.
22. Heilporn, G., Cordeau, J.F., and Laporte, G., 2010, "The Delivery Man Problem with time windows," Discrete Optimization, 7, 269-282.
23. Salehipour, A., Sörensen, K., Goos, P., and Bräysy, O., 2008, "An efficient GRASP+VND metaheuristic for the traveling repairman problem," Research paper.
24. Ngueveu, S.U., Prins, C., and Calvo, R.W., 2010, "An effective memetic algorithm for the cumulative capacitated vehicle routing problem," Computers & Operations Research, 37, 1877-1885.
25. Silva, M.M., Subramanian, A., Vidal, T., and Ochi, L.S., 2012, "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, 221, 513-520.
26. Ribeiro, G.M., and Laporte, G., 2012, "An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem," Computers & Operations Research, 39, 728-735.
27. Mladenovic, N., Uroševic, D., and Hanafi, S., 2012, "Variable neighborhood search for the travelling deliveryman problem," 4OR-Q J Oper Res, DOI 10.1007/s10288-012-0212-1.
28. Ke, L., and Feng, Z., 2013, "A two-phase metaheuristic for the cumulative capacitated vehicle routing problem," Computers & Operations Research, 40, 633-638.
29. Chakrabarty, D., and Swamy, C., 2011, "Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems," IPCO 2011, LNCS 6655, 92-103.
30. Tulabandhula, T., Rudin, C., and Jaillet, P., 2011, "The Machine Learning and Traveling Repairman Problem," ADT 2011, LNAI 6992, 262-276.
31. Ribeiro, G.M., Laporte, G., and Mauri, G.R., 2012, "A comparison of three metaheuristics for the workover rig routing problem," European Journal of Operational Research, 220, 28-36.
32. Simchi-Levi, D., and Berman, O., 1991, "Minimizing the total flow time of n jobs on a network," IIE Transactions, 23, 236-244.
33. Garcia, A., Jodra, P., and Tejel, J., 2002, "A Note on the Traveling Repairman Problem," Networks, 40(1), 27-31.
34. Fischetti, M., Laporte, G., and Martello, S., 1993, "The Delivery Man Problem And Cumulative Matroids," Operations Research, 41(6), 1055-1064.
35. Gouveia, L., and Voss, S., 1995, "A Classification of Formulations for the (Time-Dependent) Travelling Salesman Problem," European Journal of Operations Research, 83, 69-82.
36. Godinho, M.T., Gouveia, L., and Pesneau, P., "Natural and extended formulations for the Time-Dependent Traveling Salesman Problem," http://dx.doi.org/10.1016/j.dam.2011.11.019.
37. De Paepe, W.E., Lenstra, J.K., Sgall, J., Sitters, R.A., and Stougie, L., 2004, "Computer-Aided Complexity Classification of Dial-a-Ride Problems," INFORMS Journal on Computing, 16(2), 120-132.
38. Cordeau, J.F., and Laporte, G., 2007, "The dial-a-ride problem: models and algorithms," Annals of Operations Research, 153(1), 29-46.
39. Sahni, S., and Gonzalez, T., 1976, "P-complete approximation problems," Journal of the Association for Computing Machinery, 23, 555-565.
40. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco.
41. Savelsbergh, M.W.P., 1985, "Local search in routing problems with time windows," Ann. Operations Res., 4(1), 285-305.
42. Van Eijl, C.A., 1995, "A polyhedral approach to the delivery man problem," Memorandum COSOR 95-19, Eindhoven University of Technology.
43. Koutsoupias, E., Papadimitriou, C., and Yannakakis, M., 1996, "Searching a fixed graph," Lecture Notes in Computer Science, 1099, 280-289.
44. Webb, I.R., 1996, "Depth-First Solutions for the Deliveryman Problem on Tree-Like Networks: An Evaluation Using a Permutation Model," Transportation Science, 30(2), 134-147.
45. Hall, L.A., Schulz, A.S., Shmoys, D.B., and Wein, J., 1997, "Scheduling To Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms," Mathematics of Operations Research, 22(1), 513-544.
46. Wu, B.Y., Huang, Z.N., and Zhan, F.J., 2004, Exact algorithms for the minimum latency problem," Information Processing Letters, 92, 303-309.
47. Sarubbi, J.F.M., and Luna, H.P.L., 2007, "A New Flow Formulation for the Minimum Latency Problem," International Network Optimization Conference, April, Spa, Belgium.
48. Sarubbi, J.F.M., Luna, H.P.L., De Miranda Jr., G., and De Camargo, R.S., 2007, "Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem," Seventh International Conference on Hybrid Intelligent Systems, DOI 10.1109/HIS.2007.39.
49. Arora, S. and Karakostas, G., 2003, "Approximation schemes for minimum latency problems," SIAM Journal on Computing, 32(5), 1317-1337.
50. Krumke, S.O., De Paepe, W.E., Poensgen, D., and Stougie, L., 2001, "News from the Online Traveling Repairman," Theoretical Computer Science, 295, 279-294.
51. Archer, A., and Blasiak, A., 2010, "Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls," Symposium on Discrete Algorithms (SODA), January 17-19, Hyatt Regency Austin, Austin, Texas, USA.
52. Papastavrou, J.D., 1996, "A stochastic and dynamic routing policy using branching processes with state dependent immigration," European Journal of Operational Research, 95, 167-177.
53. Chen, P., Dong, X., and Niu, Y., 2012, "An Iterated Local Search Algorithm for the Cumulative Capacitated Vehicle Routing Problem," Advances in Intelligent Systems and Computing, 136, 575-581.
54. Chekuri, C., Motwani, R., Natarajan, B., and Stien, C., "Approximation techniques for average completion time scheduling," Proc. of the eighth annual ACM-SIAM symposium on Discrete algorithms, January 05-07, New Orleans, Louisiana, USA, 609-618.
55. Campbell, A.M., Vandenbussche, D., and Hermann, W., 2008, "Routing for Relief Efforts," Transportation Science, 42(2), 127-145.
56. Salehipour, A., Sörensen, K., Goos, P., and Bräysy, O., 2011, "Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem," 4OR-Q J. Oper. Res., 9, 189-209.
57. Bang, B.H., and Nghia, N.D., 2010, "Improved Genetic Algorithm for Minimum Latency Problem," SoICT'10, August 27-28, Hanoi, Vietnam.
58. Santosa, B., and Aminuddin, M., 2012, "A Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling Repairman Problem," Proc. of the 2012 International Conference on Industrial Engineering and Operations Management, July 3-6, Istanbul, Turkey, 1444-1450.