메뉴 건너뛰기




Volumn 39, Issue 11, 2012, Pages 2594-2602

An integer programming-based local search for the covering salesman problem

Author keywords

Covering salesman problem; Heuristics; Integer linear programming

Indexed keywords

COMPUTATIONAL TESTS; DATA SETS; HAMILTONIAN CYCLE; HEURISTIC SEARCH; HEURISTICS; INTEGER LINEAR PROGRAMMING; LOCAL SEARCH; SALESMAN PROBLEM;

EID: 84859724409     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.01.004     Document Type: Article
Times cited : (51)

References (28)
  • 1
    • 0042634954 scopus 로고
    • Approximation algorithms for the geometric covering salesman problem
    • E.M. Arkin, and R. Hassin Approximation algorithms for the geometric covering salesman problem Discrete Applied Mathematics 55 3 1994 197 218
    • (1994) Discrete Applied Mathematics , vol.55 , Issue.3 , pp. 197-218
    • Arkin, E.M.1    Hassin, R.2
  • 2
    • 38549153862 scopus 로고    scopus 로고
    • The capacitated m-ring-star problem
    • DOI 10.1287/opre.1070.0432
    • R. Baldacci, M. DellAmico, and J.J. Salazar González The capacitated m-ring-star problem Operations Research 55 6 2007 1147 1162 (Pubitemid 351159523)
    • (2007) Operations Research , vol.55 , Issue.6 , pp. 1147-1162
    • Baldacci, R.1    Dell'Amico, M.2    Gonzalez, J.S.3
  • 3
    • 0002590071 scopus 로고
    • Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
    • E. Balas, and A. Ho Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study Mathematical Programming 12 1980 37 60
    • (1980) Mathematical Programming , vol.12 , pp. 37-60
    • Balas, E.1    Ho, A.2
  • 4
    • 0001201888 scopus 로고
    • The clustered traveling salesman problem
    • J.A. Chisman The clustered traveling salesman problem Computers & Operations Research 2 2 1975 115 119
    • (1975) Computers & Operations Research , vol.2 , Issue.2 , pp. 115-119
    • Chisman, J.A.1
  • 6
    • 0028377571 scopus 로고
    • The median tour and maximal covering tour problems: Formulations and heuristics
    • J.R. Current, and D.A. Schilling The median tour and maximal covering tour problems: formulations and heuristics European Journal of Operational Research 73 1994 114 126
    • (1994) European Journal of Operational Research , vol.73 , pp. 114-126
    • Current, J.R.1    Schilling, D.A.2
  • 7
    • 29044449517 scopus 로고    scopus 로고
    • A new ILP-based refinement heuristic for vehicle routing problems
    • DOI 10.1007/s10107-005-0662-8
    • R. De Franceschi, M. Fischetti, and P. Toth A new ILP-based refinement heuristic for vehicle routing problems Mathematical Programming 105 2006 471 499 (Pubitemid 41788330)
    • (2006) Mathematical Programming , vol.105 , Issue.2-3 , pp. 471-499
    • De Franceschi, R.1    Fischetti, M.2    Toth, P.3
  • 8
    • 0031144089 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the symmetric generalized traveling salesman problem
    • M. Fischetti, J.J. Salazar Gonzalez, and P. Toth A branch and cut algorithm for the symmetric generalized traveling salesman problem Operations Research 45 3 1997 378 394 (Pubitemid 127684716)
    • (1997) Operations Research , vol.45 , Issue.3 , pp. 378-394
    • Fischetti, M.1    Gonzalez, J.J.S.2    Toth, P.3
  • 9
    • 0002995588 scopus 로고    scopus 로고
    • An additive approach for the optimal solution of the prize-collecting traveling salesman problem
    • B.L. Golden, A.A. Assad, North-Holland Amsterdam
    • M. Fischetti, and P. Toth An additive approach for the optimal solution of the prize-collecting traveling salesman problem B.L. Golden, A.A. Assad, Vehicle routing: methods and studies 1998 North-Holland Amsterdam 319 343
    • (1998) Vehicle Routing: Methods and Studies , pp. 319-343
    • Fischetti, M.1    Toth, P.2
  • 10
    • 0000866856 scopus 로고
    • New insertion and postoptimization procedures for the traveling salesman problem
    • M. Gendreau, A. Hertz, and G. Laporte New insertion and postoptimization procedures for the traveling salesman problem Operations Research 40 6 1992 1086 1094
    • (1992) Operations Research , vol.40 , Issue.6 , pp. 1086-1094
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 15
    • 84859716992 scopus 로고    scopus 로고
    • IBM ILOG Cplex, 〈 http://www.ilog.com 〉.
  • 16
    • 2542601639 scopus 로고    scopus 로고
    • The ring star problem: Polyhedral analysis and exact algorithm
    • DOI 10.1002/net.10114
    • M. Labbé, G. Laporte, I.R. Martín, and J.J. Salazar González The ring star problem: polyhedral analysis and exact algorithm Networks 43 3 2004 177 189 (Pubitemid 38700755)
    • (2004) Networks , vol.43 , Issue.3 , pp. 177-189
    • Labbe, M.1    Laporte, G.2    Martin, I.R.3    Gonzalez, J.J.S.4
  • 19
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling salesman problem
    • S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Operations Research 21 1973 498 516
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 22
    • 80054895520 scopus 로고    scopus 로고
    • An ILP-Based heuristic approach for the capacitated m-ring star problem
    • Z. Naji-Azimi, M. Salari, and P. Toth An ILP-Based heuristic approach for the capacitated m-ring star problem European Journal of Operational Research 217 1 2012 17 25
    • (2012) European Journal of Operational Research , vol.217 , Issue.1 , pp. 17-25
    • Naji-Azimi, Z.1    Salari, M.2    Toth, P.3
  • 23
    • 0026225350 scopus 로고
    • A traveling salesman problem library
    • G. Reinelt A traveling salesman problem library ORSA Journal on Computing 3 4 1991 376 384
    • (1991) ORSA Journal on Computing , vol.3 , Issue.4 , pp. 376-384
    • Reinelt, G.1
  • 25
    • 77955267030 scopus 로고    scopus 로고
    • An ILP improvement procedure for the open vehicle routing problem
    • M. Salari, P. Toth, and A. Tramontani An ILP improvement procedure for the open vehicle routing problem Computers & Operations Research 37 2010 2106 2120
    • (2010) Computers & Operations Research , vol.37 , pp. 2106-2120
    • Salari, M.1    Toth, P.2    Tramontani, A.3
  • 26
    • 84888631239 scopus 로고    scopus 로고
    • An integer linear programming local search for capacitated vehicle routing problems
    • B. Golden, S. Raghavan, E. Wasil, Springer New York
    • P. Toth, and A. Tramontani An integer linear programming local search for capacitated vehicle routing problems B. Golden, S. Raghavan, E. Wasil, The vehicle routing problem: latest advances and new challenges 2008 Springer New York 275 295
    • (2008) The Vehicle Routing Problem: Latest Advances and New Challenges , pp. 275-295
    • Toth, P.1    Tramontani, A.2
  • 28
    • 0001884644 scopus 로고
    • Individual comparisons by ranking methods
    • F. Wilcoxon Individual comparisons by ranking methods Biometrics 1 6 1945 80 83
    • (1945) Biometrics , vol.1 , Issue.6 , pp. 80-83
    • Wilcoxon, F.1


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