Applying Genetic Algorithm for Vehicle Routing Problem of Specimen management Case Study: Nakon Pathom Hospital

Main Article Content

ศิริลักษณ์ อเนกบุญลาภ
ดำรงเกียรติ รัตนอมรพิน
ธีรพล เปียฉ่ำ
ธนกรณ์ แน่นหนา


The research presents The Genetic Algorithm (GA) to solve the vehicle routing problems a sample with traffic time restriction for trucks the hospital that under the car of the Nakon Pathom hospital. As a result, the sample was returned to the hospital to analyze in the laboratory of the hospital within 3 hours since leave from Nakon Pathom hospital. Due to the limitation of the stuffing and the external environment may reduce effective of sample and can’t analysis. The proposed method is composed of 3 steps as follow: grouping the hospital base on area of traffic time restriction, applying Neatest Neighbor algorithm (NN) to construct and initial feasible solution, improving the solution by GA. The computation result show that NN hybridized GA provided the base solution. In this research was conducted and develop a method to solve problem with the goal that provide the route map. Transportation cost of sample and analysis are low. A comparison show that use Genetic Algorithm from Nearest neighbor Algorithm with same quantity and same hospital can reduce distance from old process with expert for driving up to 22.037 average


Download data is not yet available.

Article Details

Research Article


สุดารัตน์ สุ่มมาตย์. “การใช้วิธีเชิงฮิวริสติกส์เพื่อแก้ปัญหาการจัดเส้นทางยานพาหนะและการบรรจุ.” วิทยานิพนธ์ วศ.ม., มหาวิทยาลัยเกษตรศาสตร์, 2547

Tantikorn Pichpibul, Ruengsak Kawtummachai. “A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem.” The Scientific World Journal 2013 : 11.

Dantzig, G. B. and J. H. Ramser. “The Truck Dispatching Problem.” Management Science Science 6, no. 1 (1959) : 80-91.

ณกร อินทร์พยุง. การแก้ปัญหาการตัดสินใจในอุตสาหกรรมการขนส่งและลอจิสติกส์. กรุงเทพมหานคร: ซีเอ็ดยูเคชั่น, 2548.

Jeon, Geonwook, Herman R. Leep and Jae Young Shim. “A Vehicle Routing Problem Solved by Using a Hybrid Genetic Algorithm.” Computers & Industrial Engineering 53, no. 4 (2007) : 680-692.

กวี ศรีเมือง. “การหาจำนวนรถบรรทุกที่เหมาะสมในการขนส่งสินค้าในธุรกิจค้าปลีก : กรณีศึกษาท๊อปส์ซูปเปอร์มาร์เก็ต.” วิทยานิพนธ์ วศ.ม., มหาวิทยาลัยเทคโนโลยีพระจอมเกล้าพระนครเหนือ, 2550.

Clark, G. and J. W. Wright. “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 12, no. 4 (1964) : 568-581.

Zanakis, Stelios H. and James R. Evans. “Heuristic “Operations” : Why, When, and How to Use It.” Interfaces 11, no. 5 (1981) : 84-91.

Liu, ran, Xiaolan Xie, Vincent Augusto and Carlos Rodriguez. “Heuristic Algorithms for a Vehicle Routing Problem with Simultaneous Delivery and Pickup and Time Windows in Home Health Care.” European Journal of Operational Research 230, no.3 (2013) : 475-486.

Baker, Barrie M. and M. A. Ayechew. “A Genetic Algorithm for the Vehicle Routing Problem.” Comput. Oper. Res. 30, no. 5 (2003) : 787-800.