中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/100226
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81643441      Online Users : 6599
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/100226


    Title: The paired many-to-many pickup and delivery problem: an application
    Authors: 陳惠國;Chen, Huey-Kuo;Chou, Huey-Wen;Hsueh, Che-Fu;Yu, Yen-Ju
    Contributors: 工學院土木工程學系
    Keywords: Business and Management;Economic Theory/Quantitative Economics/Mathematical Methods;Economics;Finance;Industrial and Production Engineering;Insurance;Management;Operations Research/Decision Theory;Optimization;Original Paper;Statistics for Business
    Date: 2015-01-01
    Issue Date: 2026-04-21 13:54:12 (UTC+8)
    Publisher: Springer Verlag;Berlin/Heidelberg: Springer Berlin Heidelberg
    Abstract: 摘要: This paper addresses a variation of pickup and delivery problems, named the paired many-to-many pickup and delivery problem (PMPDP), which has never been formally classified in the literature. Given “paired” demands between customer nodes, the PMPDP is to find a set of feasible vehicle routes starting from and ending at the depot such that the constructed objective function can be optimized subject to a set of desired constraints. When the PMPDP is applied to public library delivery operations, interchangeably used with the library vehicle routing problem (LVRP) hereafter, the customer nodes are replaced by library branches and the items to be delivered and picked up become books, videos and materials. To explore the LVRP, a mathematical model is rigorously formulated and a two-stage solution algorithm involving a modified bee colony optimization method is elaborately developed. Using real data from the San Francisco library system, the computational results show that our approach performs fairly well as compared with those approaches that have appeared in the literature. Provided each customer node is visited once, the sensitivity analysis indicates that when the number of dispatched library vehicles is more than what are needed, then the obtained result may get worse.
    其他題名: TOP
    出版者: Berlin/Heidelberg: Springer Berlin Heidelberg
    出版日期: 2015-04-01
    出處: TOP, 2015-04, Vol.23 (1), p.220-243
    資源來源: SpringerLink Journals - AutoHoldings
    版權: Sociedad de Estadística e Investigación Operativa 2014
    識別號: ISSN: 1134-5764
    識別號: EISSN: 1863-8279
    識別號: DOI: 10.1007/s11750-014-0335-y
    Appears in Collections:[Department of Civil Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML8View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明