查詢結果分析
來源資料
相關文獻
- 具工作負荷平衡之配送車輛途程問題研究
- Vehicle Routing Problem with Simultaneously Deliveries and Pickups
- 以禁忌搜尋演算法求解確定型及隨機型多車種車輛途程問題
- 多目標車輛途程整數規劃模式之研究
- 應用螞蟻演算法於時窗限制車輛途程問題之研究
- 貨櫃碼頭岸肩拖車派遺規劃之研究
- 整合多層級配銷管理系統成本改善模式建構
- Ant Colony Optimization for Railway Driver Crew Scheduling: from Modeling to Implementation
- 圖書館書籍通閱移送之車輛途程問題--巨集啟發式演算法之應用
- 同時考慮以自有車輛收送貨或委託貨運公司服務之啟發式演算法
頁籤選單縮合
題 名 | Vehicle Routing Problem with Simultaneously Deliveries and Pickups=同時考量配送及收貨之車輛途程問題 |
---|---|
作 者 | 賴春美; 陳正哲; 馬銪男; | 書刊名 | 遠東學報 |
卷 期 | 25:3 2008.09[民97.09] |
頁 次 | 頁475-484 |
分類號 | 563.82 |
關鍵詞 | 車輛途程問題; 整數規劃模式; 演算法; Vehicle routing problem; Integer programming; Algorithm; |
語 文 | 英文(English) |
中文摘要 | 同時考量配送及收貨之車輛途程問題(Vehicle Routing Problem with Simultaneously Deliveries and Pickups; VRPSDP)是探討實務因素之車輛排程 問題,其在實務上有許多應用,尤其在是物流業配送服務上的應用。在競 爭市場中,物流業者在車輛的調派上如能同時考量收貨及配送,將使車隊 產能有效率的被利用而提升競爭力及增加利潤。VRPSDP已被證明為 NP-hard。本文探討以總距離最小化為衡量績效的VRPSDP問題,提出整數 規劃模式以求解各車輛途程以滿足顧客之需求。並提出演算法以應用在實 務問題之求解。 |
英文摘要 | The vehicle routing problem with simultaneously deliveries and pickups (VRPSDP) is a practical generalization of the vehicle routing problem, which has many real-world applications. In many real-world cases, the customer may require both a delivery of goods from the depot and a pickup of other items back to depot simultaneously. The VRPSDP is to find a set of routes with minimizing the total distance to service all customers, each with a single stop, without violating the vehicle capacity. The VRPSDP has been shown to be NP-hard. In this paper, the VRPSDP is considered and an integer programming formulation is presented to resolve the VRPSDP. An efficient heuristic algorithm is also proposed to obtain the near-optimal solution for large scale problems. |
本系統中英文摘要資訊取自各篇刊載內容。