메뉴 건너뛰기




Volumn 161, Issue 4-5, 2013, Pages 547-557

Optimal solutions for routing problems with profits

Author keywords

Branch and price; Capacitated Profitable Tour Problem; Capacitated Team Orienteering Problem; Heuristic; Profits; Routing

Indexed keywords

BENCHMARKING; BRANCH AND BOUND METHOD; INTEGER PROGRAMMING; OPTIMIZATION; VEHICLE ROUTING;

EID: 84873411143     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.12.021     Document Type: Article
Times cited : (58)

References (16)
  • 1
    • 84986942507 scopus 로고
    • A set-partitioning-based exact algorithm for the vehicle routing problem
    • Y. Agarwal, K. Mathur, and H.M. Salkin A set-partitioning-based exact algorithm for the vehicle routing problem Networks 19 1989 731 749
    • (1989) Networks , vol.19 , pp. 731-749
    • Agarwal, Y.1    Mathur, K.2    Salkin, H.M.3
  • 4
    • 80755188983 scopus 로고    scopus 로고
    • A column generation approach for the split delivery vehicle routing problem
    • C. Archetti, N. Bianchessi, and M.G. Speranza A column generation approach for the split delivery vehicle routing problem Networks 58 4 2011 241 254
    • (2011) Networks , vol.58 , Issue.4 , pp. 241-254
    • Archetti, C.1    Bianchessi, N.2    Speranza, M.G.3
  • 6
    • 84986992097 scopus 로고
    • An algorithm for the resource constrained shortest path problem
    • J. Beasley, and N. Christofides An algorithm for the resource constrained shortest path problem Networks 19 1989 379 394
    • (1989) Networks , vol.19 , pp. 379-394
    • Beasley, J.1    Christofides, N.2
  • 8
    • 84872987383 scopus 로고    scopus 로고
    • Heuristic branch-and-price-and-cut to solve a network design problem
    • Montréal Canada
    • A. Chabrier Heuristic branch-and-price-and-cut to solve a network design problem Proceedings CPAIOR 2003 Montréal Canada
    • (2003) Proceedings CPAIOR
    • Chabrier, A.1
  • 9
    • 0001208905 scopus 로고
    • The vehicle routing problem
    • N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Wiley Chichester
    • N. Christofides, A. Mingozzi, and P. Toth The vehicle routing problem N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Combinatorial Optimization 1979 Wiley Chichester 315 338
    • (1979) Combinatorial Optimization , pp. 315-338
    • Christofides, N.1    Mingozzi, A.2    Toth, P.3
  • 10
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • M. Desrochers, J. Desrosiers, and M. Solomon A new optimization algorithm for the vehicle routing problem with time windows Operations Research 40 1992 342 354
    • (1992) Operations Research , vol.40 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 13
    • 33746329306 scopus 로고    scopus 로고
    • Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
    • G. Righini, and M. Salani Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints Discrete Optimization 3 2006 255 273
    • (2006) Discrete Optimization , vol.3 , pp. 255-273
    • Righini, G.1    Salani, M.2
  • 14
    • 51349129806 scopus 로고    scopus 로고
    • New dynamic programming algorithms for the resource constrained shortest path problem
    • G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained shortest path problem Networks 51 2008 155 170
    • (2008) Networks , vol.51 , pp. 155-170
    • Righini, G.1    Salani, M.2
  • 16
    • 0033725783 scopus 로고    scopus 로고
    • On dantzig-wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
    • F. Vanderbeck On dantzig-wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm Operations Research 40 2000 111 128
    • (2000) Operations Research , vol.40 , pp. 111-128
    • Vanderbeck, F.1


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