메뉴 건너뛰기




Volumn 38, Issue 10, 2011, Pages 12954-12966

The mixed capacitated general routing problem with turn penalties

Author keywords

Capacitated general routing problem; Transformation; Turn penalties; Vehicle routing

Indexed keywords

AVERAGE DEVIATION; CAPACITATED VEHICLE ROUTING PROBLEM; GENERAL ROUTING PROBLEM; MAINTENANCE OPERATIONS; MEMETIC ALGORITHMS; POLYNOMIAL TRANSFORMATIONS; REAL-LIFE APPLICATIONS; ROUTING PROBLEMS; SOLUTION METHODS; TRANSFORMATION; TURN PENALTIES; VEHICLE ROUTING PROBLEMS; WASTE COLLECTION;

EID: 79957980461     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.04.092     Document Type: Article
Times cited : (18)

References (18)
  • 2
    • 41149169888 scopus 로고    scopus 로고
    • Ant algorithms for urban waste collection routing
    • J. Bautista, and J. Pereira Ant algorithms for urban waste collection routing Lecture Notes in Computer Science 3172 2004 3020 3033
    • (2004) Lecture Notes in Computer Science , vol.3172 , pp. 3020-3033
    • Bautista, J.1    Pereira, J.2
  • 4
    • 0033225636 scopus 로고    scopus 로고
    • Directed rural postman problem with turn penalties
    • E. Benavent, and D. Soler The directed rural postman problem with turn penalties Transportation Science 33 1999 408 418 (Pubitemid 30519520)
    • (1999) Transportation Science , vol.33 , Issue.4 , pp. 408-418
    • Benavent, E.1    Soler, D.2
  • 5
    • 0024860346 scopus 로고
    • The design of a computerized sanitation vehicle routing and scheduling for the town of oyster bay, New York
    • L. Bodin, G. Fagin, R. Welebny, and J. Greenberg The design of a computerized sanitation vehicle routing and scheduling for the town of oyster bay, New York Computers and Operations Research 16 1989 45 54
    • (1989) Computers and Operations Research , vol.16 , pp. 45-54
    • Bodin, L.1    Fagin, G.2    Welebny, R.3    Greenberg, J.4
  • 7
    • 0036604749 scopus 로고    scopus 로고
    • The Rural Postman Problem on mixed graphs with turn penalties
    • DOI 10.1016/S0305-0548(00)00091-5, PII S0305054800000915
    • A. Corberán, R. Martí, E. Martínez, and D. Soler The rural postman problem on mixed graphs with turn penalties Computers and Operations Research 29 2002 887 903 (Pubitemid 34135096)
    • (2002) Computers and Operations Research , vol.29 , Issue.7 , pp. 887-903
    • Corberan, A.1    Marti, R.2    Martinez, E.3    Soler, D.4
  • 8
    • 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 Series B 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
  • 9
    • 0028508261 scopus 로고
    • A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
    • M. Fischetti, P. Toth, and D. Vigo A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs Operations Research 42 1994 846 859
    • (1994) Operations Research , vol.42 , pp. 846-859
    • Fischetti, M.1    Toth, P.2    Vigo, D.3
  • 10
    • 0033887939 scopus 로고    scopus 로고
    • Efficient transformation of the generalized vehicle routing problem
    • DOI 10.1016/S0377-2217(99)00073-9
    • G. Ghiani, and G. Improta An efficient transformation of the generalized vehicle routing problem European Journal of Operational Research 122 2000 11 17 (Pubitemid 30541668)
    • (2000) European Journal of Operational Research , vol.122 , Issue.1 , pp. 11-17
    • Ghiani, G.1    Improta, G.2
  • 11
    • 85015479399 scopus 로고
    • Bounds for the general capacitated routing problem
    • K. Jansen Bounds for the general capacitated routing problem Networks 23 1993 165 173
    • (1993) Networks , vol.23 , pp. 165-173
    • Jansen, K.1
  • 12
    • 71949088204 scopus 로고    scopus 로고
    • Edge assembly based memetic algorithm for the capacitated vehicle routing problem
    • Y. Nagata, and O. Bräysy Edge assembly based memetic algorithm for the capacitated vehicle routing problem Networks 54 2009 205 215
    • (2009) Networks , vol.54 , pp. 205-215
    • Nagata, Y.1    Bräysy, O.2
  • 15
    • 0003178056 scopus 로고
    • The capacitated canadian postman problem
    • S. Roy, and J.M. Rousseau The capacitated canadian postman problem INFOR 27 1989 58 73
    • (1989) INFOR , vol.27 , pp. 58-73
    • Roy, S.1    Rousseau, J.M.2
  • 16
    • 58049120113 scopus 로고    scopus 로고
    • A way to optimally solve a time-dependent vehicle routing problem with time windows
    • D. Soler, J. Albiach, and E. Martínez A way to optimally solve a time-dependent vehicle routing problem with time windows Operations Research Letters 37 2009 37 42
    • (2009) Operations Research Letters , vol.37 , pp. 37-42
    • Soler, D.1    Albiach, J.2    Martínez, E.3
  • 17
    • 41149170627 scopus 로고    scopus 로고
    • A transformation for the mixed general routing problem with turn penalties
    • DOI 10.1057/palgrave.jors.2602385, PII 2602385
    • D. Soler, E. Martínez, and J.C. Micó A transformation for the mixed general routing problem with turn penalties Journal of the Operational Research Society 59 2008 540 547 (Pubitemid 351438524)
    • (2008) Journal of the Operational Research Society , vol.59 , Issue.4 , pp. 540-547
    • Soler, D.1    Martinez, E.2    Mico, J.C.3
  • 18
    • 0042128680 scopus 로고    scopus 로고
    • A heuristic algorithm for the asymmetric capacitated vehicle routing problem
    • D. Vigo A heuristic algorithm for the asymmetric capacitated vehicle routing problem European Journal of Operational Research 89 1996 108 126 (Pubitemid 126386766)
    • (1996) European Journal of Operational Research , vol.89 , Issue.1-2 , pp. 108-126
    • Vigo, D.1


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