Applications of parallel computing for facility location-transportation problems for disaster response

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


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


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

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


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

รายชื่อผู้แต่งSinghtaun C., Natsupakpong S.

ผู้เผยแพร่Science Publications

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

วารสารJournal of Computer Science (1549-3636)

Volume number11

Issue number4

หน้าแรก612

หน้าสุดท้าย620

จำนวนหน้า9

นอก1549-3636

eISSN1549-3636

URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84946410350&doi=10.3844%2fjcssp.2015.612.620&partnerID=40&md5=ac78844572fa9619fcdc464005c113e7

ภาษาEnglish-Great Britain (EN-GB)


ดูบนเว็บไซต์ของสำนักพิมพ์


บทคัดย่อ

This study extends the capability and increases the performance of a traditional Branch and Bound (BB) algorithm to solve Facility Location-Transportation problems for Disaster Response (FLTDR) using parallel computing. A Two-Stage Branch and Bound (TBB) algorithm was developed to support two parallel computing approaches. This algorithm divides problems into two small sub-problems, which are a facility location sub-problem and a transportation sub-problem. All possible numbers of distribution centers are determined. All possible locations relating to any number of distribution centers are explicitly explored. The transportation sub-problem corresponding to any selected location is then solved. Two parallel approaches for the TBB algorithm (PTBB) differ in partitioning the list of sub-problems. The first approach (PTBB1) solves both sub-problems in parallel. The other (PTBB2) explores the locations in sequence and solves only the transportation sub-problems in parallel. The numerical experiments were conducted on various sizes of generated problems. The quality of the solution and the computing time of both approaches were compared with a BB algorithm with premature termination by time. The experimental experiences showed that both PTBB1 and PTBB2 are more efficient and effective than a BB algorithm. However, the PTBB1 should be suggested for the FLTDR because of the least computational time usage. ฉ 2015 Chansiri Singhtaun and Suriya Natsupakpong.


คำสำคัญ

Branch-and-bound algorithmsDisaster responsefacility location


อัพเดทล่าสุด 2023-24-09 ถึง 07:35