메뉴 건너뛰기




Volumn , Issue , 2011, Pages 569-575

Multi-robot persistent surveillance planning as a vehicle routing problem

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME; EXACT METHODS; HARDWARE TESTBEDS; LOGISTICS PROBLEMS; LONG TERM SIMULATION; MULTIPLE UAVS; MULTIROBOTS; PERSISTENT SURVEILLANCE; ROBOTICS APPLICATIONS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

EID: 82455168206     PISSN: 21618070     EISSN: 21618089     Source Type: Conference Proceeding    
DOI: 10.1109/CASE.2011.6042503     Document Type: Conference Paper
Times cited : (85)

References (15)
  • 3
    • 0242406105 scopus 로고    scopus 로고
    • A distributed ant algorithm for efficiently patrolling a network
    • V. Yanovski, I. A. Wagner, and A. M. Bruckstein, "A distributed ant algorithm for efficiently patrolling a network," Algorithmica, vol. 37, pp. 165-186, 2003.
    • (2003) Algorithmica, Vol. , vol.37 , pp. 165-186
    • Yanovski, V.1    Wagner, I.A.2    Bruckstein, A.M.3
  • 4
    • 0003040355 scopus 로고
    • A stochastic and dynamic vehicle routing problem in the euclidean plane
    • D. J. Bertsimas and G. J. van Ryzin, "A stochastic and dynamic vehicle routing problem in the euclidean plane," Operations Research, vol. 39, pp. 601-615, 1991.
    • (1991) Operations Research , vol.39 , pp. 601-615
    • Bertsimas, D.J.1    Van Ryzin, G.J.2
  • 6
    • 0041791136 scopus 로고    scopus 로고
    • Philadelphia, PA, USA: Society for Industrial and Applied Mathematics
    • P. Toth and D. Vigo, Eds., The Vehicle Routing Problem. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2001.
    • (2001) The Vehicle Routing Problem
    • Toth, P.1    Vigo, D.2
  • 9
    • 26444602999 scopus 로고    scopus 로고
    • Lagrangian duality applied to the vehicle routing problem with time windows
    • DOI 10.1016/j.cor.2004.11.002, PII S0305054804003028
    • B. Kallehauge, J. Larsen, and O. B. Madsen, "Lagrangian duality applied to the vehicle routing problem with time windows," Computers & Operations Research, vol. 33, no. 5, pp. 1464-1487, 2006. (Pubitemid 41428302)
    • (2006) Computers and Operations Research , vol.33 , Issue.5 , pp. 1464-1487
    • Kallehauge, B.1    Larsen, J.2    Madsen, O.B.G.3
  • 11
    • 0001661962 scopus 로고
    • Note on the complexity of the shortest path models for column generation in vrptw
    • M. Dror, "Note on the complexity of the shortest path models for column generation in vrptw," Operations Research, vol. 42, pp. 977-978, 1994.
    • (1994) Operations Research, Vol. , vol.42 , pp. 977-978
    • Dror, M.1
  • 14
    • 4644250559 scopus 로고    scopus 로고
    • An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
    • DOI 10.1002/net.20033
    • D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, "An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems," Networks, vol. 44, no. 3, pp. 216-229, 2004. (Pubitemid 39301560)
    • (2004) Networks , vol.44 , Issue.3 , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.