Transshipment Vehicle Routing with Drop/Pickup and Volume Feasibility for Cross Filling
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Suk-Chul Rim | - |
dc.contributor.author | VU THI THANH HANG | - |
dc.date.accessioned | 2022-11-29T02:32:32Z | - |
dc.date.available | 2022-11-29T02:32:32Z | - |
dc.date.issued | 2021-02 | - |
dc.identifier.other | 30619 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/20073 | - |
dc.description | 학위논문(석사)--아주대학교 일반대학원 :산업공학과,2021. 2 | - |
dc.description.tableofcontents | 1 Introduction 1 1.1 Background and motivation 1 1.2 Problem definition 2 1.3 Contribution 3 1.4 Overview 5 2 Background and Related Works 6 3 Solution procedure 11 3.1 Framework of genetic algorithm 11 3.2 Generating a chromosome 13 3.3 Crossover 18 3.4 Mutation 21 3.5 Optimal pickup/delivery amount of a route 22 3.6 Fitness function 28 4 Performance evaluation 30 4.1 Parameters 30 4.2 Average performance 30 4.3 Computation time 34 5 Conclusion 36 References 38 Appendices 44 A Selecting Starting DCs 45 B Generating Initial Population 47 C Fitness Function 49 D Feasibility Checking 55 E Genetic Operator 56 | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | Transshipment Vehicle Routing with Drop/Pickup and Volume Feasibility for Cross Filling | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 일반대학원 | - |
dc.contributor.department | 일반대학원 산업공학과 | - |
dc.date.awarded | 2021. 2 | - |
dc.description.degree | Master | - |
dc.identifier.localId | 1203456 | - |
dc.identifier.uci | I804:41038-000000030619 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/common/orgView/000000030619 | - |
dc.subject.keyword | cross-filling | - |
dc.subject.keyword | order fulfillment | - |
dc.subject.keyword | pickup and delivery | - |
dc.subject.keyword | transshipment | - |
dc.subject.keyword | vehicle routing | - |
dc.description.alternativeAbstract | Distribution centers (DCs) typically receive orders from the customers (mostly retail stores) located in its vicinity; and deliver the ordered goods in the next day morning. To maintain high item fill rate, DCs have to hold a high level of inventory, which will increase inventory cost. As an alternative, cross-filling is that, after closing the daily order receipt, DCs exchange surplus items during the night to reduce the shortage. The economic justification of such cross-filling will depend on the trade-o_x001B_ between extra transshipment and handling cost versus saved shortage cost. In this paper, as an extension of Rim and Jiang [1], vehicles are allowed to drop and pickup items at the intermediate DCs in the route. We present a genetic algorithm to determine the routes and amount to pickup/drop at each DC to minimize the total cost. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.