메뉴 건너뛰기




Volumn 4788 LNAI, Issue , 2007, Pages 220-228

A solution to the rural postman problem based on artificial ant colonies

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; TRAVELING SALESMAN PROBLEM;

EID: 38349030676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75271-4_23     Document Type: Conference Paper
Times cited : (9)

References (24)
  • 1
    • 38349050329 scopus 로고    scopus 로고
    • Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: an Autocatalytic Optimizing Process. Tech. Rep. 91-016, Dipartamento di Electtronica e Informazione - Politecnico di Milano, Italia, pp. 1-26 (1991)
    • Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: an Autocatalytic Optimizing Process. Tech. Rep. 91-016, Dipartamento di Electtronica e Informazione - Politecnico di Milano, Italia, pp. 1-26 (1991)
  • 2
    • 0003401932 scopus 로고
    • Optimization, Learning and Natural Algorithms. PhD
    • Thesis, Dip. Elettronica, Politecnico di Milano
    • Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD Thesis, Dip. Elettronica, Politecnico di Milano (1992)
    • (1992)
    • Dorigo, M.1
  • 3
    • 0004180566 scopus 로고
    • The Ant System Applied to the Quadratic Assignment Problem
    • Technical Report IRIDIA/94-28, Université Libre de Bruxelles, Belgium
    • Maniezzo, V., Colorni, A., Dorigo, M.: The Ant System Applied to the Quadratic Assignment Problem. Technical Report IRIDIA/94-28, Université Libre de Bruxelles, Belgium (1994)
    • (1994)
    • Maniezzo, V.1    Colorni, A.2    Dorigo, M.3
  • 4
    • 38349075957 scopus 로고    scopus 로고
    • Maniezzo, V.: Exact and Approximate Nondeterministic Tree-search Procedures for the Quadratic Assignment Problem. Technical Report CSR 98-1, C.L. In: Scienze dell'Informazione, Universita di Bologna, Italy (1998)
    • Maniezzo, V.: Exact and Approximate Nondeterministic Tree-search Procedures for the Quadratic Assignment Problem. Technical Report CSR 98-1, C.L. In: Scienze dell'Informazione, Universita di Bologna, Italy (1998)
  • 6
    • 17044391695 scopus 로고    scopus 로고
    • Ant Colonies for Vehicle Routing Problems
    • Come, E.D, Dorigo, M, Glover, F, eds, McGraw-Hill, New York
    • Gambardella, L.M., Taillard, E., Agazzi, G.: Ant Colonies for Vehicle Routing Problems. In: Come, E.D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, McGraw-Hill, New York (1999)
    • (1999) New Ideas in Optimization
    • Gambardella, L.M.1    Taillard, E.2    Agazzi, G.3
  • 10
    • 21844527073 scopus 로고
    • The Traveling Salesman
    • Springer, Heidelberg
    • Reinelt, G.: The Traveling Salesman. LNCS, vol. 840. Springer, Heidelberg (1994)
    • (1994) LNCS , vol.840
    • Reinelt, G.1
  • 11
    • 0015958417 scopus 로고
    • A Fundamental Problem in Vehicle Routing
    • Orloff, CS.: A Fundamental Problem in Vehicle Routing. Networks 4, 35-64 (1974)
    • (1974) Networks , vol.4 , pp. 35-64
    • Orloff, C.S.1
  • 15
    • 0001280938 scopus 로고    scopus 로고
    • A Branch and Cut Algorithm for the Undirected Rural Postman Problem
    • Ghiani, G., Laporte, G.: A Branch and Cut Algorithm for the Undirected Rural Postman Problem. Mathematical Programming 87, 467-481 (2000)
    • (2000) Mathematical Programming , vol.87 , pp. 467-481
    • Ghiani, G.1    Laporte, G.2
  • 17
    • 0346367551 scopus 로고    scopus 로고
    • A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem
    • Fernández de Córdoba, P., García Raffi, L.M., Sanchis, J.M.: A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem. Computers Ops. Res. 25(12), 1097-1106 (1998)
    • (1998) Computers Ops. Res , vol.25 , Issue.12 , pp. 1097-1106
    • Fernández de Córdoba, P.1    García Raffi, L.M.2    Sanchis, J.M.3
  • 18
    • 0003112831 scopus 로고    scopus 로고
    • Improvement Procedures for the Undirected Rural Postman Problem
    • Hertz, A., Laporte, G., Nanchen, P.: Improvement Procedures for the Undirected Rural Postman Problem. INFORMS J. Comput. 1, 53-62 (1999)
    • (1999) INFORMS J. Comput , vol.1 , pp. 53-62
    • Hertz, A.1    Laporte, G.2    Nanchen, P.3
  • 19
    • 24744452014 scopus 로고    scopus 로고
    • Efficient Heuristics for the Rural Postman Problem
    • Groves, G.W., van Vuuren, J.H.: Efficient Heuristics for the Rural Postman Problem. Orion 21(1), 33-51 (2005)
    • (2005) Orion , vol.21 , Issue.1 , pp. 33-51
    • Groves, G.W.1    van Vuuren, J.H.2
  • 20
    • 38349075958 scopus 로고    scopus 로고
    • Kang, M.-J., Han, C.-G.: Solving the Rural Postman Problem Using a Genetic Algorithm with a Graph Transformation. RR: Dept. of Computer Engineering, Kyung Hee University (1998)
    • Kang, M.-J., Han, C.-G.: Solving the Rural Postman Problem Using a Genetic Algorithm with a Graph Transformation. RR: Dept. of Computer Engineering, Kyung Hee University (1998)
  • 23
    • 0031122887 scopus 로고    scopus 로고
    • Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem
    • Dorigo, M., Gambardella, L.: Ant Colony System: a Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transaction on Evolutionary Computation 1(1), 53-66 (1997)
    • (1997) IEEE Transaction on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.2
  • 24
    • 0030759617 scopus 로고    scopus 로고
    • Ant Colonies for the Traveling Salesman Problem
    • Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. Biosystems 43, 73-81 (1997)
    • (1997) Biosystems , vol.43 , pp. 73-81
    • Dorigo, M.1    Gambardella, L.M.2


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