• Bài trích
  • Nhan đề: Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations /Monirehalsadat Mahmoudi, Xuesong Zhou
Tác giả CN Mahmoudi,Monirehalsadat
Nhan đề Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations /Monirehalsadat Mahmoudi, Xuesong Zhou
Từ khóa tự do Lagrangian relaxation
Từ khóa tự do Time-dependent least-cost path problem
Từ khóa tự do Vehicle routing problem with pickup and delivery with time windows
Nguồn trích Transportation research part B: Methodological2016-7 Số: 1 Tập: 89
00000000nab#a2200000ui#4500
00113566
0026
004E5504C11-698F-40D4-94A9-476DFD96376A
005201706151416
008081223s vm| vie
0091 0
039|y20170615142346|zcuonglv
100 |aMahmoudi,Monirehalsadat
245 |aFinding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations /Monirehalsadat Mahmoudi, Xuesong Zhou
653 |aLagrangian relaxation
653 |aTime-dependent least-cost path problem
653 |aVehicle routing problem with pickup and delivery with time windows
773 |tTransportation research part B: Methodological|v89|i1|d2016-7
890|c1|a0|b0|d2
Không tìm thấy biểu ghi nào
Copyrights © Thư Viện Trường ĐH XÂY DỰNG HÀ NỘI