메뉴 건너뛰기
4OR
Volumn 8, Issue 1, 2010, Pages 49-70
A memetic algorithm for the team orienteering problem
Author keywords

Destruction construction; Memetic algorithm; Metaheuristic; Optimal split; Selective vehicle routing problem
Indexed keywords

EID: 77952882395     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-008-0094-4     Document Type: Article
Times cited : (91)
References (18)
  • 1
    • 33846106058 scopus 로고    scopus 로고
    • Metaheuristics for the team orienteering problem
    • Archetti C, Hertz A, Speranza M (2006) Metaheuristics for the team orienteering problem. J Heuristics 13(1): 49-76.
    • (2006) J Heuristics , vol.13 , Issue.1 , pp. 49-76
    • Archetti, C.1    Hertz, A.2    Speranza, M.3
  • 2
    • 0021034477 scopus 로고
    • Route-first cluster-second methods for vehicle routing
    • Beasley JE (1983) Route-first cluster-second methods for vehicle routing. Omega 11: 403-408.
    • (1983) Omega , vol.11 , pp. 403-408
    • Beasley, J.E.1
  • 3
    • 33645149426 scopus 로고    scopus 로고
    • Lower and upper bounds for the mixed capacitated arc routing problem
    • Belenguer J-M, Benavent E, Lacomme P, Prins C (2006) Lower and upper bounds for the mixed capacitated arc routing problem. Comput Oper Res 33(12): 3363-3383.
    • (2006) Comput Oper Res , vol.33 , Issue.12 , pp. 3363-3383
    • Belenguer, J.-M.1    Benavent, E.2    Lacomme, P.3    Prins, C.4
  • 4
    • 85012688561 scopus 로고
    • Princeton: Princeton University Press
    • Bellman R (1957) Dynamic Programming. Princeton University Press, Princeton.
    • (1957) Dynamic Programming
    • Bellman, R.1
  • 5
    • 77952875679 scopus 로고    scopus 로고
    • A memetic algorithm for the team orienteering problem
    • Bouly H, Dang D-C, Moukrim A (2008) A memetic algorithm for the team orienteering problem. In EvoWorkshops.
    • (2008) EvoWorkshops
    • Bouly, H.1    Dang, D.-C.2    Moukrim, A.3
  • 6
    • 34848923791 scopus 로고    scopus 로고
    • An exact algorithm for team orienteering problems
    • Boussier S, Feillet D, Gendreau M (2007) An exact algorithm for team orienteering problems. 4OR 5(3): 211-230.
    • (2007) 4or , vol.5 , Issue.3 , pp. 211-230
    • Boussier, S.1    Feillet, D.2    Gendreau, M.3
  • 7
    • 0028317478 scopus 로고
    • A heuristic for the multiple tour maximum collection problem
    • Butt S, Cavalier T (1994) A heuristic for the multiple tour maximum collection problem. Comput Oper Res 21: 101-111.
    • (1994) Comput Oper Res , vol.21 , pp. 101-111
    • Butt, S.1    Cavalier, T.2
  • 9
    • 19944424824 scopus 로고    scopus 로고
    • Traveling salesman problems with profits
    • Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transp Sci 39(2): 188-205.
    • (2005) Transp Sci , vol.39 , Issue.2 , pp. 188-205
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3
  • 10
    • 38849090016 scopus 로고    scopus 로고
    • Ants can solve the team orienteering problem
    • ISSN 0360-8352
    • Ke L, Archetti C, Feng Z (2008) Ants can solve the team orienteering problem. Comput Ind Eng 54(3): 648-665 ISSN 0360-8352.
    • (2008) Comput Ind Eng , vol.54 , Issue.3 , pp. 648-665
    • Ke, L.1    Archetti, C.2    Feng, Z.3
  • 11
    • 47249118435 scopus 로고    scopus 로고
    • Heuristique basée sur la mémoire adaptative pour le problème de tournées de véhicules sélectives
    • Sousse, Tunisie
    • Khemakhem M, Chabchoub H, Semet F (2007) Heuristique basée sur la mémoire adaptative pour le problème de tournées de véhicules sélectives. In Logistique & Transport, pp 31-37, Sousse, Tunisie.
    • (2007) Logistique & Transport , pp. 31-37
    • Khemakhem, M.1    Chabchoub, H.2    Semet, F.3
  • 12
    • 4444280768 scopus 로고    scopus 로고
    • Competitive memetic algorithms for arc routing problems
    • Lacomme P, Prins C, Ramdane-Cherif W (2004) Competitive memetic algorithms for arc routing problems. Ann Oper Res 131(1-4): 159-185.
    • (2004) Ann Oper Res , vol.131 , Issue.1-4 , pp. 159-185
    • Lacomme, P.1    Prins, C.2    Ramdane-Cherif, W.3
  • 14
    • 2642522782 scopus 로고    scopus 로고
    • A simple and effective evolutionary algorithm for the vehicle routing problem
    • Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12): 1985-2002.
    • (2004) Comput Oper Res , vol.31 , Issue.12 , pp. 1985-2002
    • Prins, C.1
  • 15
    • 33750841084 scopus 로고    scopus 로고
    • A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
    • Ruiz R Stützle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. EJOR 177: 2033-2049.
    • (2007) Ejor , vol.177 , pp. 2033-2049
    • Ruiz, R.S.T.1
  • 16
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35: 254-265.
    • (1987) Oper Res , vol.35 , pp. 254-265
    • Solomon, M.1
  • 17
    • 9544227386 scopus 로고    scopus 로고
    • A tabu search heuristic for the team orienteering problem
    • Tang H, Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Comput Oper Res 32: 1379-1407.
    • (2005) Comput Oper Res , vol.32 , pp. 1379-1407
    • Tang, H.1    Miller-Hooks, E.2
  • 18
    • 0022404041 scopus 로고
    • The fleet size and mixed problem for capacitated arc routing
    • Ulusoy G (1985) The fleet size and mixed problem for capacitated arc routing. Eur J Oper Res 22: 329-337.
    • (1985) Eur J Oper Res , vol.22 , pp. 329-337
    • Ulusoy, G.1

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