VRPTW Distribution Route Determination with Rigid and Flexible Time Window and Assignment Based on Number of Demand
DOI:
https://doi.org/10.32734/jsti.v27i1.17230Keywords:
Transportation, Route, VRPTW, Rigid and Flexible TW, MILPAbstract
Vehicle routing problems (VRP) are common in many companies and play an important role in distribution and logistics. Effective routing can significantly reduce expenses and increase customer satisfaction. The research entitled "Determining VRPTW Distribution Routes with Rigid and Flexible Time Windows and Assigning Based on the Demand Numbers" will solve the modified vehicle routing problem with time window (VRPTW) problem by considering constraints on vehicle capacity, delay times, penalty fees for delays, rigid and flexible time windows, and demand numbers. There is one origin depot for the company that will serve their 15 customers. The method used to overcome the problem is mixed-integer linear programming (MILP). In general, this research classifies time windows into three groups, namely rigid, flexible, and rigid and flexible. The time window model chosen is a rigid time window with a cost of IDR 561,965 and no customers are served late. The rigid time window model was chosen because no customers are served late and the cost difference is not significant or can be said to be very small compared to other time window models.
Downloads
References
Y. Dumas, J. Desrosiers, and F. Soumis, “The pickup and delivery problem with time windows,†Eur J Oper Res, vol. 54, pp. 7–22, 1991.
M. Mahmoudi and X. Zhou, “Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state-space-time network representations,†Transportation Research Part B: Methodological, vol. 89, pp. 19–42, Jul. 2016, doi: 10.1016/j.trb.2016.03.009.
M. M. Solomon, “ALGORITHMS FOR THE VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS,†Oper Res, vol. 35, no. 2, pp. 254–266, 1987.
O. Bräysy and M. Gendreau, “Vehicle routing problem with time windows, Part I: Route construction and local search algorithms,†Transportation Science, vol. 39, no. 1, pp. 104–118, 2005, doi: 10.1287/trsc.1030.0056.
Y. Molenbruch, K. Braekers, and A. Caris, “Typology and literature review for dial-a-ride problems,†Ann Oper Res, vol. 259, no. 1–2, pp. 295–325, Dec. 2017, doi: 10.1007/s10479-017-2525-0.
X. Yang, N. Bostel, and P. Dejax, “A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours,†Comput Ind Eng, vol. 135, pp. 105–119, Sep. 2019, doi: 10.1016/j.cie.2019.05.038.
P. Toth and D. Vigo, THE VEHICLE ROUTING PROBLEM. Philadelphia: Society for Industrial and Applied Mathematics., 2002.
R. Liu and Z. Jiang, “A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints,†Applied Soft Computing Journal, vol. 80, pp. 18–30, Jul. 2019, doi: 10.1016/j.asoc.2019.03.008.
M. F. Ibrahim, M. M. Putri, D. Farista, and D. M. Utama, “An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up and Delivery with Time Windows,†Jurnal Teknik Industri, vol. 22, no. 1, pp. 1–17, Feb. 2021, doi: 10.22219/jtiumm.vol22.no1.1-17.
R. Dondo and J. Cerda´intec, “A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows,†Intl. Trans in Op. Res., vol. 13, pp. 441–459, 2006.
S. P. Kenaka and S. Suprayogi, “Comparison Study of Neighborhood Structures in Local Search for Vehicle Routing Problem with Multiple Trips and Time Windows,†Jurnal Teknik Industri, vol. 23, no. 2, pp. 161–170, Dec. 2021, doi: 10.9744/jti.23.2.161-170.
K. El Bouyahyiouy and A. Bellabdaoui, “A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows,†Decision Science Letters, vol. 10, no. 4, pp. 471–486, 2021, doi: 10.5267/j.dsl.2021.7.002.
S. E. Cömert, H. R. Yazgan, I. Sertvuran, and H. Şengül, “A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain,†Sadhana - Academy Proceedings in Engineering Sciences, vol. 42, no. 12, pp. 2067–2080, Dec. 2017, doi: 10.1007/s12046-017-0754-1.
A. Rave and P. Fontaine, “The location routing problem with time windows and load-dependent travel times for cargo bikes,†2024. [Online]. Available: https://ssrn.com/abstract=4813769
M. Fernandes, D. Correia, and L. Teixeira, “Lean maintenance practices in the improvement of information management processes: a study in the Facility Management division,” Procedia Comput. Sci., vol. 232, no. 2023, pp. 2269–2278, 2024, doi: 10.1016/j.procs.2024.02.046.
S. Mostafa, J. Dumrak, and H. Soltan, “Lean Maintenance Roadmap,” Procedia Manuf., vol. 2, no. February, pp. 434–444, 2015, doi: 10.1016/j.promfg.2015.07.076.
J. P. Womack and D. T. Jones, “Lean Thinking—Banish Waste and Create Wealth in your Corporation,” J. Oper. Res. Soc., vol. 48, no. 11, pp. 1148–1148, 2010, doi: 10.1038/sj.jors.2600967.
M. Cerqueira, P. Silva, and S. Fernandes, “Systematic Literature Review on the Machine Learning Approach in Software Engineering,” Am. Acad. Sci. Res. J. Eng., vol. 85, pp. 370–396, 2022, [Online]. Available: http://asrjetsjournal.org/
S. Oktarina, F. H. Mustofa, and L. Fitria, “Usulan Rute Distribusi Kopi Arabika Premium Menggunakan Metode Nearest Neighbour dan Tabu Search di PT. X,” J. Online Inst. Teknol. Nas., vol. 4, no. 2, pp. 149–159, 2016.
N. Baluch, C. S. Abdullah, and S. Mohtar, “TPM and Lean Maintenance - A Critical Review,” Interdiscip. J. Contemp. Res. Bus., vol. 4, no. 2, pp. 850–857, 2012, [Online]. Available: http://search.ebscohost.com/login.aspx?direct=true&db=bth&AN=83518185&site=ehost-live
P. D. Karningsih, W. Puspitasari, and M. L. Singgih, “Cost-Integrated Lean Maintenance to Reduce Maintenance Cost,” J. Optimasi Sist. Ind., vol. 22, no. 1, pp. 69–80, 2023, doi: 10.25077/josi.v22.n1.p69-80.2023.
D. A. Kurniawati and M. L. Muzaki, “Analisis Perawatan Mesin dengan Pendekatan RCM dan MVSM,” J. Optimasi Sist. Ind., vol. 16, no. 2, p. 89, 2017, doi: 10.25077/josi.v16.n2.p89-105.2017.
A. Hendrasnoto, A. I. S. M, and Kulsum, “Usulan Perbaikan Maintenance Untuk Menurunkan Downtime Pada Mesin Pay – Off Reel Dengan Pendekatan Lean Maintenance Di Pt Xyz,” Tek. Ind., vol. 5, no. 3, pp. 224–233, 2017.
Nico Pranata Mulya, “Machine Maintenance Scheduling Design Using Reability Centered Maintenance (RCM) method and Maintenance Value Stream Mapping (MVSM) at XYZ,” Int. J. Econ., vol. 2, no. 1, pp. 87–101, 2023, doi: 10.55299/ijec.v2i1.430.
Zenna Rasyid Y., Y. N., and E. P.W, “Analisis Aktivitas Perawatan Mesin Circural Loom Dengan Metode Maintenance Value Stream Mapping,” vol. 12, no. 0, pp. 1–23, 2016.
B. Hafid, T. Siagian, D. Derlini, and R. SIlvany, “Pengukuran Dampak Penerapan Sistem Total Productive Maintenance Terhadap Waktu Henti Mesin,” J. Rev. Pendidik. dan Pengajaran, vol. 7, no. 3, pp. 6798–6805, 2024.
J. Igba, K. Alemzadeh, I. Anyanwu-Ebo, P. Gibbons, and J. Friis, “A systems a Reliability-Centred Maintenance (RCM) of wind turbines,” Procedia Comput. Sci., vol. 16, pp. 814–823, 2013, doi: 10.1016/j.procs.2013.01.085.
G. Clarke, G. Mulryan, and P. Liggan, “Lean Maintenance – A Risk-Based Approach,” vol. 30, no. 5, pp. 1–6, 2010.
L. Yile, X. XueHang, and Z. Lei, “Lean Maintenance framework and its application in clutch maintenance,” Proc. Int. Conf. Inf. Manag. Int. Conf. Inf. Manag. Innov. Manag. Ind. Eng. ICIII 2008, vol. 3, pp. 230–232, 2014, doi: 10.1109/ICIII.2008.84.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 TALENTA Publisher Universitas Sumatera Utara
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
The Authors submitting a manuscript do so on the understanding that if accepted for publication, the copyright of the article shall be assigned to TALENTA Publisher Universitas Sumatera Utara as the publisher of the journal.
Copyright encompasses the rights to reproduce and deliver the article in all forms and media. The reproduction of any part of this journal, its storage in databases, and its transmission by any form or medium will be allowed.
