Please use this identifier to cite or link to this item:
|Title:||Developing a Software Prototype of Vehicle Routing Problem with Loading Constraints Using Genetic Algorithms||Authors:||Rusdiansyah, Ahmad
|Issue Date:||2007||Publisher:||University of the Thai Chamber of Commerce||Source:||Ahmad Rusdiansyah, Ira Prasetyaningrum, Budi Santosa, De-bi Cao (2007) Developing a Software Prototype of Vehicle Routing Problem with Loading Constraints Using Genetic Algorithms.||Conference:||Proceedings of the 2nd International Conference on Operations and Supply Chain Management||Abstract:||In this research we consider the Vehicle Routing Problemwith Loading Constraints (VRPLC). We attempt tointegrate the classical Vehicle Routing Problem (VRP)and Container Loading Problem (CLP), which are NPhardproblem respectively, into a single model. Theobjectives are to minimize the traveling costs and tomaximize the utilization of the container space. In thiscase, all cargos of a customer in the container should belocated next to each other and all cargos can be unloadedwithout moving cargos for other customers. Thus, thecargos of last visited customers should be packed first andthose for earlier visited customers should be loaded last.Accordingly, the VRPLC contains complex vehiclerouting and packing constraints. To solve the problem, wedevelop a Genetic Algorithms Heuristic methodconsidering cross-over and mutation operations. Based onthe GA algorithms, we finally develop a softwareprototype that helps users to manage packing process in3D visualization. Finally, we provide a numericalexample to show how the software works.||URI:||https://scholar.utcc.ac.th/handle/6626976254/895||Rights:||This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.|
|Appears in Collections:||conference_item|
Show full item record Recommend this item
Page view(s) 206
checked on Jul 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.