An Improved Genetic Algorithm for Vehicle Routing Problem with Hard Time Windows

Conference proceedings article

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

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

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

รายชื่อผู้แต่ง: May, Aye Thant; Jariyavajee, Chattriya; Polvichai, Jumpol;

ผู้เผยแพร่: Taiwan Association for Aerosol Research

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

ISBN: 9781665442312

นอก: 1680-8584

eISSN: 2071-1409

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127066540&doi=10.1109%2fICECET52533.2021.9698698&partnerID=40&md5=856711f2e23ef5197b501c9c751e6b16

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

ดูในเว็บของวิทยาศาสตร์ | ดูบนเว็บไซต์ของสำนักพิมพ์ | บทความในเว็บของวิทยาศาสตร์

บทคัดย่อ

When the logistic industry plans for delivering the goods to the customers, travel cost reduction is one aspect that is crucial to consider. Among the popular Vehicle Routing Problem (VRP) variants addressing the travel cost minimization, Vehicle Routing Problem with Time Windows (VRPTW) is one of the most fundamental and practical variants. This study proposes a new improved Genetic Algorithm (GA) to solve the hard time windows variant of VRPTW by developing the problem-specific crossover and seven different mutation operators. One of the mutations uses the heuristics information to guide the GA when it explores the new features in the large solution space. This design contributes efficiently to the randomly generated customer coordinates. The performance of the proposed GA is assessed on the well-known Solomon benchmarks which contain 100 customers for each instance. The results from our GA are improved as it is competitive and better than the best-known solutions from the previous studies. © 2021 IEEE.

คำสำคัญ

combinatorial optimization, vehicle routing problem with hard time windows