M. Haikal Syauqi
ABSTRACT
Current technological developments triggered the public to use e-commerce platforms as providers of transactions. This resulted in an increase in the courier service business for shipping goods to customers. The types of goods processed through courier services are very diverse and shipments that are processed by courier services continue to increase. In previous studies only discussed the delivery using homogeneous vehicles, without grouping and the number of shipments is limited. This study aims to minimize the route and the number of heterogeneous vehicles serving more than 1,500 shipments per day by courier service. Therefore, in this study is based on the VRP concept of heterogeneous vehicles to minimize route and courier service vehicles. The use of the K-Means cluster method in this study aims to classify customers, minimize delivery distance and shorten the computation time. Genetic Algorithm (GA) based approach is applied by using the criteria of many generations to be achieved and the difference in efficiency rates between generations to get the results of route optimization and courier service vehicles.
- https://databoks.katadata.co.id/datapublish/2019/04/25/indonesia-jadi-negara-dengan-pertumbuhan-e-commerce-tercepat-di-duniaGoogle Scholar
- Perboli, G., & Mariangela R., 2019. Parcel delivery in urban areas: Opportunities and threats for the mix of traditional and green business models.Google Scholar
- Tseng, Y., Taylor, M., & Yue, W. L., 2005. The Role of Transportation in Logistic Chain. Proceedings of the Eastern Asia Society for Transportation Studies, 5, 1657--1672.Google Scholar
- Goetschalckx, M., 2011. Supply Chain Engineering (Springer Science Business Media LLC).Google Scholar
- Hernandeza, F., Gendreaua M., & Potvina J.Y., 2017. Heuristics for Tactical Time Slot Management a Periodic Vehicle Routing Problem View.Google Scholar
- Coelho, V. N., A. Grasas, H. Ramalhinho, I. M. Coelho, M. J. F. Souza & R. C. Cruz, 2015. An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints.Google Scholar
- Dantzig, G. B., & Ramser, J. H., 1959. The truck dispatching problem. Management Sci-ence, 6(1), 80--91.Google ScholarDigital Library
- Laporte, G., Gendreau, M., Potvin, J.Y., & Semet, F., 2000. Classical And Modern Heuristics for The Vehicle Routing Problem. Intl. Trans. in Op. Res. 7, 285--300.Google ScholarCross Ref
- Pop, P.C., Zelina, I., Lupse, V. Sitar, C.P., & Chira, C. (2011). Heuristic Algorithms for Solving the Generalized Vehicle Routing. Int. J. of Computers, Communications & Control 6, 158--165.Google ScholarCross Ref
- Gocken, T., & M., Yaktubay., 2019. Comparison of different clustering Algorithms Via Genetic Algorithm for VRPTW. Int. j. simul. Model. 4, 574--585.Google Scholar
- MacQueen, J. B., 1967. Some Methods for classification and Analysis of Multivariate Observations, Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, 1: 281--297.Google Scholar
- Laporte, G., 1992. The Vehicle Routing Problem: An overview of exact and approximate algorithms, European Journal of Operational Research, Vol. 59, 345--358.Google ScholarCross Ref
- Purnamasari, C. D., & Amelia, S., 2018. Vehicle Routing Problem (VRP) for Courier Service: A Review, MATEC Web of Conferences 204, 07007.Google ScholarCross Ref
- Baker, B. M., M, A, Ayechew., 2003. A Genetic Algorithm for Vehicle Routing Problem, Computer & Operations Research, 787--800.Google Scholar
Index Terms
- Optimization of Heterogeneous Vehicle Routing Problem Using Genetic Algorithm in Courier Service
Recommendations
The Genetic Algorithm on the Multiple-Depot Vehicle Routing Problem with Vehicle Sharing
ICICTA '09: Proceedings of the 2009 Second International Conference on Intelligent Computation Technology and Automation - Volume 01This paper study on the MDVRP with vehicle sharing, the vehicles can come to any depots. And we present an improved genetic algorithm with chromosome representing the clients. A typical result and the analysis of experiment indicate the validity of the ...
Improved Genetic Algorithm for Vehicle Routing Problem with Time Windows
ICICCI '10: Proceedings of the 2010 International Conference on Intelligent Computing and Cognitive InformaticsVehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. In this paper, we propose an improved genetic algorithm to solve the VRPTW problem. The ...
An Improved Genetic Algorithm for Vehicle Routing Problem
ICCIS '11: Proceedings of the 2011 International Conference on Computational and Information SciencesThe Vehicle Routing Problem (VRP) is a typical combinational optimization problem. Genetic Algorithm (GA) is one of the methods used to solve VRP. By incorporating Simulated Annealing (SA) into GA, an improved genetic algorithm is proposed to solve the ...
Comments