1. RSUIR at Rangsit University
  2. RSU Digital Collection
  3. วิทยาลัยนานาชาติจีน International Chinese College
  4. InCC-BA-M-Thesis
Please use this identifier to cite or link to this item: https://rsuir-library.rsu.ac.th/handle/123456789/469
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorZheng Jiang Bo-
dc.contributor.authorBo Wang-
dc.date.accessioned2022-01-25T07:34:14Z-
dc.date.available2022-01-25T07:34:14Z-
dc.date.issued2019-
dc.identifier.urihttps://rsuir-library.rsu.ac.th/handle/123456789/469-
dc.descriptionThesis (MBA (Business Administration)) -- Rangsit University, 2019en_US
dc.description.abstract随着现在社会经济的飞速发展，对物流的要求也愈加严格。在物流活动中 最常见的就是车辆路径规划问题，车辆路径规划问题又称为VRP问题，如何在 有限的资源下，对车辆进行合理的出行计划，以最小的运输成本完成运输计划 是 VRP 问题的目标之一。目前制造业对供应商的物流服务要求愈加严格，比如 时间窗等方面的要求。本文是在了解A公司的运营模式后，发现其车辆路径规划 既有时间窗要求，又有在供应商处同时进行送取货的要求，因此本文将以A公 司带有时间窗和送取货的车辆路径规划（VRPSPDTW）模式为例建立数学模型 利用遗传算法对A公司的车辆运输方案进行运算。通过将算法运行得出的方案 与A公司原有方案进行对比，可以发现车辆装载率提高，发车次数减少，证明了 数学模型与算法的可行性与有效性。为运营模式相似的企业提供实际工作中的 优化方案,即采用遗传算法优化带有时间窗与送取货的车辆路径问题，同时为 VRPSPDTW 问题的解决提供了实际可操作的方法en_US
dc.language.isozhen_US
dc.publisherRangsit Universityen_US
dc.subjectTransportation -- Planningen_US
dc.subjectVehicle routing problemen_US
dc.title考虑带时间窗和送取货的 车辆路径规划研究en_US
dc.title.alternativeResearch on the vehicle routing problem with simultaneous pick-up and delivery with time windowsen_US
dc.typeThesisen_US
dc.description.other-abstractWith a rapid development of the current social economy, the requirements for logistics have become more stringent. The most common problem in logistics activities is vehicle route planning, also known as VRP. How to make a reasonable tip plan for a vehicle with limited resources and complete the transportation plan with minimal costs is one of the resolutions to VRP problems. At present, manufacturers strictly require suppliers' logistics services, such as the time window and other requirements. After studying the operation mode of Company A, it was found that the vehicle route planning requires suppliers’ time windows and simultaneous delivery. Therefore, this article will use the Company A’s vehicle routing planning (VRPSPDTW) model with time windows and simultaneous delivery as an example to establish a mathematical model. The genetic algorithm was used to calculate the vehicle transportation plan of Company A. By comparing the scheme obtained by the algorithm operation with the original scheme of Company A, an increase in vehicle loading rate increase and a decrease in the number of departures were found, which proved the feasibility and the availability of the mathematical model and algorithm. This research proposed companies to apply similar operating models for practical solutions, and adopts genetic algorithm to optimize the vehicle routing problem with simultaneous pick-up and delivery with time windows.en_US
dc.description.degree-nameMaster of Business Administrationen_US
dc.description.degree-levelMaster's Degreeen_US
dc.contributor.degree-disciplineBusiness Administrationen_US
Appears in Collections:InCC-BA-M-Thesis

Files in This Item:
File Description SizeFormat 
Bo Wang.pdf562.77 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.