메뉴 건너뛰기




Volumn 144, Issue 1, 2006, Pages 99-110

The vehicle routing problem with demand range

Author keywords

Delivery volume; Flexibility; Vehicle routing problem

Indexed keywords


EID: 33747824375     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0057-0     Document Type: Conference Paper
Times cited : (4)

References (19)
  • 1
    • 0034262328 scopus 로고    scopus 로고
    • A lower bound for the split delivery vehicle routing problem
    • Belenguer, J.M., M.C. Martinez, and E. Mota. (2000). "A Lower Bound for the Split Delivery Vehicle Routing Problem." Operations Research, 48(5), 801-810.
    • (2000) Operations Research , vol.48 , Issue.5 , pp. 801-810
    • Belenguer, J.M.1    Martinez, M.C.2    Mota, E.3
  • 2
    • 10644271210 scopus 로고
    • Rubbermaid's new system scores
    • Brumback, N. (1995). "Rubbermaid's New System Scores." Home Furnishing Network, 69, 11.
    • (1995) Home Furnishing Network , vol.69 , pp. 11
    • Brumback, N.1
  • 4
    • 10644237167 scopus 로고    scopus 로고
    • A decomposition approach for the inventory routing problem
    • Campbell, A. and M. Savelsbergh. (2004). "A Decomposition Approach for the Inventory Routing Problem." Transportation Science, 38, 488-502.
    • (2004) Transportation Science , vol.38 , pp. 488-502
    • Campbell, A.1    Savelsbergh, M.2
  • 5
    • 4544373808 scopus 로고    scopus 로고
    • Efficient insertion heuristics for vehicle routing and scheduling problems
    • Campbell, A. and M. Savelsbergh. (2004). "Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems." Transportation Science, 38, 369-378.
    • (2004) Transportation Science , vol.38 , pp. 369-378
    • Campbell, A.1    Savelsbergh, M.2
  • 6
    • 12344327675 scopus 로고    scopus 로고
    • Inventory routing in practice
    • P. Toth and D. Vigo (Eds.), SIAM Monographs on Discrete Mathematics and Applications
    • Campbell, A. and M. Savelsbergh. (2002). "Inventory Routing in Practice." In: P. Toth and D. Vigo (Eds.), The Vehicle Routing Problem, pp. 309-329. SIAM Monographs on Discrete Mathematics and Applications.
    • (2002) The Vehicle Routing Problem , pp. 309-329
    • Campbell, A.1    Savelsbergh, M.2
  • 7
    • 0032397383 scopus 로고    scopus 로고
    • A method for solving ship routing problems with inventory constraints
    • Christiansen, M. and B. Nygreen. (1998a). "A Method for Solving Ship Routing Problems with Inventory Constraints." Annals of Operations Research, 81, 357-378.
    • (1998) Annals of Operations Research , vol.81 , pp. 357-378
    • Christiansen, M.1    Nygreen, B.2
  • 8
    • 0032337356 scopus 로고    scopus 로고
    • Modeling path flows for a combined ship routing and inventory management problem
    • Christiansen, M. and B. Nygreen. (1998b). "Modeling Path Flows for a Combined Ship Routing and Inventory Management Problem." Annals of Operations Research, 82, 391-412.
    • (1998) Annals of Operations Research , vol.82 , pp. 391-412
    • Christiansen, M.1    Nygreen, B.2
  • 9
    • 0001237146 scopus 로고
    • A method for solving traveling salesman problems
    • Croes, G.A. (1958). "A Method for Solving Traveling Salesman Problems." Operations Research, 6, 791-812.
    • (1958) Operations Research , vol.6 , pp. 791-812
    • Croes, G.A.1
  • 11
    • 0043059830 scopus 로고
    • Savings by split delivery routing
    • Dror, M. and P. Trudeau. (1989). "Savings by Split Delivery Routing." Transportation Science, 23, 141-145.
    • (1989) Transportation Science , vol.23 , pp. 141-145
    • Dror, M.1    Trudeau, P.2
  • 13
    • 0029342706 scopus 로고
    • The split delivery vehicle scheduling problem with time windows and grid network distance
    • Frizzell, P.W. and J.W. Giffin. (1995). "The Split Delivery Vehicle Scheduling Problem with Time Windows and Grid Network Distance." Computers and Operations Research, 22, 655-667.
    • (1995) Computers and Operations Research , vol.22 , pp. 655-667
    • Frizzell, P.W.1    Giffin, J.W.2
  • 14
    • 0342880915 scopus 로고
    • A branch and bound algorithm for the capacitated vehicle routing problem
    • Laporte, G. and Y. Nobert. (1985). "A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem." OR Spektrum, 5, 77-85.
    • (1985) OR Spektrum , vol.5 , pp. 77-85
    • Laporte, G.1    Nobert, Y.2
  • 15
    • 33747815574 scopus 로고
    • Giant smoothing out supply flow
    • Millstein, M. (1993). "Giant Smoothing out Supply Flow." Supermarket News, 43, 15.
    • (1993) Supermarket News , vol.43 , pp. 15
    • Millstein, M.1
  • 16
    • 10644290459 scopus 로고    scopus 로고
    • Shippers let vendors manage the stock: wal-mart's suppliers share in databases
    • Mongelluzzo, B. (1998). "Shippers let Vendors Manage the Stock: Wal-Mart's Suppliers Share in Databases." Journal of Commerce and Commercial, 417, 12A.
    • (1998) Journal of Commerce and Commercial , vol.417
    • Mongelluzzo, B.1
  • 17
    • 10644279247 scopus 로고    scopus 로고
    • Vendor-run inventory: Are its benefits exaggerated?
    • Purpura, L. (1997). "Vendor-Run Inventory: Are its Benefits Exaggerated?." Supermarket News, 47, 59-60.
    • (1997) Supermarket News , vol.47 , pp. 59-60
    • Purpura, L.1
  • 18
    • 10644248098 scopus 로고    scopus 로고
    • HEB project leads expansion of vendor managed inventory programs
    • Ross, J. (1998). "HEB Project Leads Expansion of Vendor Managed Inventory Programs." Stores, 80, 46-47.
    • (1998) Stores , vol.80 , pp. 46-47
    • Ross, J.1
  • 19
    • 0032364079 scopus 로고    scopus 로고
    • Routing helicopters for crew exchanges on off-shore locations
    • Sierksma, G. and G.A. Tijssen. (1998). "Routing Helicopters for Crew Exchanges on Off-Shore Locations." Annals of Operations Research, 76, 261-286.
    • (1998) Annals of Operations Research , vol.76 , pp. 261-286
    • Sierksma, G.1    Tijssen, G.A.2


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