Hybrid genetic algorithm for vehicle routing problem with manual unloading consideration
รหัสดีโอไอ
Creator 1. Suebsak Nanthavanij
2. Prachya Boonprasurt
Title Hybrid genetic algorithm for vehicle routing problem with manual unloading consideration
Publisher Maejo University
Publication Year 2560
Journal Title Maejo International Journal of Science and Technology
Journal Vol. 11
Journal No. 1
Page no. 68
Keyword vehicle routing,genetic algorithm,manual unloading,physical workload
ISSN 1905-7873
Abstract Often, delivery workers are required to manually unload goods at customer locations. These manual tasks induce physiological fatigue in the workers and increase delivery time. This paper discusses a genetic algorithm (GA) approach to the vehicle routing problem with manual materials handling (VRPMMH) that considers physical workload and working time. The nearest neighborhood search technique is employed to help generate an initial population. Heuristic crossover and mutation are developed to generate a set of utilised vehicles and their delivery routes so as to minimise the total operation cost. In addition, each worker must not expend his/her energy beyond the recommended level and all delivery tasks must be completed within one workday. From the computation experiment, the GA-based approach is found to be efficient and can obtain near-optimal VRPMMH solutions.
MaejoInternational Journal of ScienceandTechnology

บรรณานุกรม

EndNote

APA

Chicago

MLA

ดิจิตอลไฟล์

Digital File
DOI Smart-Search
สวัสดีค่ะ ยินดีให้บริการสอบถาม และสืบค้นข้อมูลตัวระบุวัตถุดิจิทัล (ดีโอไอ) สำนักการวิจัยแห่งชาติ (วช.) ค่ะ