메뉴 건너뛰기




Volumn 183, Issue 3, 2007, Pages 1028-1041

Column generation based heuristic for tactical planning in multi-period vehicle routing

Author keywords

Branch and bound; Combinatorial optimization; Heuristics; Integer programming; OR in strategic planning; Routing

Indexed keywords

BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; OPERATIONS RESEARCH; STRATEGIC PLANNING; VEHICLE ROUTING;

EID: 34447258364     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.02.030     Document Type: Article
Times cited : (96)

References (24)
  • 2
    • 0008638142 scopus 로고
    • Allocation/routing: Models and algorithms
    • Golden B.L., and Assad A.A. (Eds), North-Holland, Amsterdam
    • Ball M.O. Allocation/routing: Models and algorithms. In: Golden B.L., and Assad A.A. (Eds). Vehicle Routing: Methods and Studies (1988), North-Holland, Amsterdam 199-221
    • (1988) Vehicle Routing: Methods and Studies , pp. 199-221
    • Ball, M.O.1
  • 3
    • 0033351565 scopus 로고    scopus 로고
    • A heuristic method for the set covering problem
    • Caprara A., Fischetti M., and Toth P. A heuristic method for the set covering problem. Operations Research 47 5 (1999) 730-743
    • (1999) Operations Research , vol.47 , Issue.5 , pp. 730-743
    • Caprara, A.1    Fischetti, M.2    Toth, P.3
  • 4
    • 34447251707 scopus 로고    scopus 로고
    • Chabrier, A., Danna, E., Le Pape, C. 2002. Coopération entre génération de colonnes avec tournées sans cycle et recherche locale appliquée au toutage de véhicules. Actes JNPC 2002.
  • 5
    • 84957670158 scopus 로고
    • An improved heuristic for the period vehicle routing problem
    • Chao M., Golden B.L., and Wasil E. An improved heuristic for the period vehicle routing problem. Networks 26 (1995) 25-44
    • (1995) Networks , vol.26 , pp. 25-44
    • Chao, M.1    Golden, B.L.2    Wasil, E.3
  • 6
    • 0021439402 scopus 로고
    • The period routing problem
    • Christofides N., and Beasley J.E. The period routing problem. Networks 14 (1984) 237-256
    • (1984) Networks , vol.14 , pp. 237-256
    • Christofides, N.1    Beasley, J.E.2
  • 7
    • 0041194626 scopus 로고    scopus 로고
    • A tabu search Heuristic for periodic and multi depot vehicle routing problems
    • Cordeau J.F., Gendreau M., and Laporte G. A tabu search Heuristic for periodic and multi depot vehicle routing problems. Networks 30 (1997) 105-119
    • (1997) Networks , vol.30 , pp. 105-119
    • Cordeau, J.F.1    Gendreau, M.2    Laporte, G.3
  • 8
    • 84889962650 scopus 로고    scopus 로고
    • Desaulniers G., Desrosiers J., and Solomon M.M. (Eds), Kluwer
    • In: Desaulniers G., Desrosiers J., and Solomon M.M. (Eds). Column Generation (2005), Kluwer
    • (2005) Column Generation
  • 9
    • 25144453382 scopus 로고    scopus 로고
    • Efficient production-distribution system design
    • Elhedhli S., and Goffin J.-L. Efficient production-distribution system design. Management Science 51 7 (2005) 1151-1164
    • (2005) Management Science , vol.51 , Issue.7 , pp. 1151-1164
    • Elhedhli, S.1    Goffin, J.-L.2
  • 10
    • 4644250559 scopus 로고    scopus 로고
    • An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
    • Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44 3 (2004) 216-229
    • (2004) Networks , vol.44 , Issue.3 , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4
  • 11
    • 35048870538 scopus 로고    scopus 로고
    • Robust branch-and-cut-and-price for the capacitated vehicle routing problem
    • Integer Programming and Combinatorial Optimization. Nemhauser G., and Bienstock D. (Eds)
    • Fukasawa J., Lysgaard J., Poggi de Aragão M., Reis M., Uchoa E., and Werneck R.F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In: Nemhauser G., and Bienstock D. (Eds). Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science vol. 3064 (2004)
    • (2004) Lecture Notes in Computer Science , vol.3064
    • Fukasawa, J.1    Lysgaard, J.2    Poggi de Aragão, M.3    Reis, M.4    Uchoa, E.5    Werneck, R.F.6
  • 12
    • 0026861720 scopus 로고
    • A heuristic for the periodic vehicle routing problem
    • Gaudioso M., and Paletta G. A heuristic for the periodic vehicle routing problem. Transportation Science 26 2 (1992) 86-92
    • (1992) Transportation Science , vol.26 , Issue.2 , pp. 86-92
    • Gaudioso, M.1    Paletta, G.2
  • 13
    • 34447254361 scopus 로고    scopus 로고
    • Irnich, S., Villeneuve, D., 2003. The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3. Technical Report G-2003-55, GERAD, 2003.
  • 15
    • 34447275305 scopus 로고    scopus 로고
    • Michel, S., in preparation. PhD thesis, Université Bordeaux 1.
  • 16
    • 34447264839 scopus 로고    scopus 로고
    • Mourgaya, M., 2004. The periodic vehicle routing problem: Planning before routing. PhD thesis, Université Bordeaux 1.
  • 17
    • 34447249894 scopus 로고    scopus 로고
    • Mourgaya, M., Vanderbeck, F., in press. Periodic vehicle routing problem: Classification and heuristic. RAIRO Operations Research.
  • 18
    • 0001295454 scopus 로고
    • A multiphase approach to the period routing problem
    • Russel R., and Gribbin D. A multiphase approach to the period routing problem. Networks 21 (1991) 747-765
    • (1991) Networks , vol.21 , pp. 747-765
    • Russel, R.1    Gribbin, D.2
  • 21
    • 0000906834 scopus 로고    scopus 로고
    • Computational study of a column generation algorithm for bin packing and cutting stock problems
    • Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming A 86 (1999) 565-594
    • (1999) Mathematical Programming A , vol.86 , pp. 565-594
    • Vanderbeck, F.1
  • 22
    • 0033725783 scopus 로고    scopus 로고
    • On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
    • Vanderbeck F. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research 48 1 (2000) 111-128
    • (2000) Operations Research , vol.48 , Issue.1 , pp. 111-128
    • Vanderbeck, F.1
  • 23
    • 33748491159 scopus 로고    scopus 로고
    • A parallel hybrid evolutionary metaheuristic for the period vehicle routing problem
    • Vianna D.S., Ochi L.S., and Drummond L.M.A. A parallel hybrid evolutionary metaheuristic for the period vehicle routing problem. Lecture Notes in Computer Science 1586 (1998) 183-191
    • (1998) Lecture Notes in Computer Science , vol.1586 , pp. 183-191
    • Vianna, D.S.1    Ochi, L.S.2    Drummond, L.M.A.3
  • 24
    • 34447286953 scopus 로고    scopus 로고
    • Xpress-MP, 2001. User Guide and Reference Manual. Release 12, Dash Optimization.


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