Multiple agents maximum collection problem with time dependent rewards

Computers and Industrial Engineering

Volumn 64, Issue 4, 2013, Pages 1009-1018

  Ekici, Ali ^a   Retharekar, Anand ^a  

^a UNIVERSITY OF HOUSTON   (United States)

Author keywords

Clustering; Decreasing rewards; Flow type formulation; maximum collection problem; Routing

Indexed keywords

CLUSTERING; DECREASING REWARDS; FLOW-TYPE FORMULATION; MAXIMUM COLLECTION PROBLEM; ROUTING;

HEURISTIC ALGORITHMS;

ROUTING ALGORITHMS;

EID: 84876130466     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2013.01.010     Document Type: Article

References (24)

1. E. Balas The prize collecting traveling salesman problem Networks 19 6 1989 621 636
2. B. Balcik, B. Beamon, and K. Smilowitz Last mile distribution in humanitarian relief Journal of Intelligent Transportation Systems 12 2 2008 51 63 (Pubitemid 352006490)
3. P. Berkhin A survey of clustering data mining techniques Grouping Multidimensional Data 2006 25 71
4. A. Blum, S. Chawla, D.R. Karger, T. Lane, A. Meyerson, and M. Minkoff Approximation algorithms for orienteering and discounted-reward TSP SIAM Journal on Computing 37 2 2007 653 670 (Pubitemid 351584861)
5. S.E. Butt, and T.M. Cavalier A heuristic for the multiple tour maximum collection problem Computers and Operations Research 21 1 1994 101 111
6. S.E. Butt, and D.M. Ryan An optimal solution procedure for the multiple tour maximum collection problem using column generation Computers and Operations Research 26 4 1999 427 441 (Pubitemid 29346470)
7. I. Chao, B.L. Golden, and E.A. Wasil The team orienteering problem European Journal of Operational Research 88 3 1996 464 474 (Pubitemid 126368048)
8. W.H.E. Day, and H. Edelsbrunner Efficient algorithms for agglomerative hierarchical clustering methods Journal of Classification 1 1 1984 7 24
9. Ekici, A., Keskinocak, P., & Koenig, S. (2009). Multi-robot routing with linear decreasing rewards over time. In Proceedings of the 2009 IEEE international conference on robotics and automation (pp. 958-963).
10. E. Erkut, and J. Zhang The maximum collection problem with time-dependent rewards Naval Research Logistics 43 5 1996 749 763 (Pubitemid 126568768)
11. D. Feillet, P. Dejax, and M. Gendreau Traveling salesman problems with profits Transportation Science 39 2 2005 188 205 (Pubitemid 40748589)
12. M. Fischetti, G. Laporte, and S. Martello The delivery man problem and cumulative matroids Operation Research 41 6 1993 1055 1064
13. K. Ganesh, and T.T. Narendran CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up European Journal of Operational Research 178 3 2007 699 717 (Pubitemid 44765140)
14. J.A. Hartigan, and M.A. Wong Algorithm AS 136: A k-means clustering algorithm Applied Statistics 28 1 1979 100 108
15. A.K. Jain, M.N. Murty, and P.J. Flynn Data clustering: A review ACM Computing Surveys 31 3 1999 264 323
16. B.I. Kim, S. Kim, and S. Sahoo Waste collection vehicle routing problem with time windows Computers and Operations Research 33 12 2006 3624 3642
17. A. Likas, N. Vlassis, and J.J. Verbeek The global k-means clustering algorithm Pattern Recognition 36 2 2003 451 461 (Pubitemid 35212840)
18. R. Mansini, and B. Tocchella The traveling purchaser problem with budget constraint Computers and Operations Research 36 7 2009 2263 2274
19. P. Nakari, O. Braysy, and W. Dullaert Communal transportation: Challenges for large-scale routing heuristics Reports of the Department of Mathematical Information Technology, Series B 6 2007 951 978
20. M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 2 1987 254 265
21. H. Tang, E. Miller-Hooks, and R. Tomastik Scheduling technicians for planned maintenance of geographically distributed equipment Transportation Research Part E: Logistics and Transportation Review 43 5 2007 591 609 (Pubitemid 46979984)
22. P. Toth, & D. Vigo (Eds.), (2002). The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics.
23. T. Tsiligirides Heuristic methods applied to orienteering Journal of the Operational Research Society 35 9 1984 797 809
24. B.Y. Wu Polynomial time algorithms for some minimum latency problems Information Processing Letters 75 5 2000 225 229