แบบจำลองคณิตศาสตร์สำหรับจัดเส้นทางเดินรถขนส่งที่ความจุไม่จำกัด กรณีศึกษา ผู้ให้บริการขนส่งอาหารแช่แข็ง

บทความในวารสาร

ผู้เขียน/บรรณาธิการ

กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง

รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่ง: Klinplub, Nammon;Yaovasuwanchai, Sorawit

ปีที่เผยแพร่ (ค.ศ.): 2017

วารสาร: วารสารไทยการวิจัยดำเนินงาน (2287-0210)

Volume number: 5

Issue number: 1

หน้าแรก: 12

หน้าสุดท้าย: 25

นอก: 2287-0210

URL: file:///C:/Users/TCI_User/Downloads/91273-Article%20Text-225555-1-10-20170630.pdf

บทคัดย่อ

The company in this case study is a frozen food transporter who serves the services for the ice-cream manufacturer that wish to deliver their products to 3,953 convenience store branches. With a large number of branches, the works of the company thus are assigned into two shifts (in 1-day period) and two shifts (in 1-week period. In this study, the researchers focused on studying only a night shift and a first shift of 1-week period (Monday, Wednesday, and Friday) because of the highest volume of delivery works in these shifts. This required total of 37 vehicles to perform the delivery works and each vehicle is required to deliver products to at least 40 branches specified by the manufacturer and their work must be no more than 8 hours per day. Since the size of the products delivered is small, the company’s delivering vehicle cannot achieve a full-load capacity. This issue is considered as Multiple Traveling Salesmen Problem(mTSP), which is similar to Vehicle routing problem (VRP). The difference between two problems is the matter of unlimited capacity. Therefore, in this study, researchers examined the mathematical model developed by Bektas [1 ] . Assignment-based and flow-based models were selected to extend the mathematical model by adding two conditions in order to solve the problem facing the company. Two additional conditions are 1). Number of branches required each vehicle delivers the products must be determined, and 2) Each vehicle must work not more than 8 hours. Then, the researchers tested the mathematical model with 27 problems. The problems could be divided into 3 types based on their characteristics. The results showed that flow-based model had higher efficiency than another model and thus would be suitable for the case study company.

คำสำคัญ

Multiple Traveling Salesmen Problem