How to cite this paper
Chowmali, W & Sukto, S. (2021). A hybrid FJA-ALNS algorithm for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles for the fuel delivery problem.Decision Science Letters , 10(4), 497-510.
Refrences
Azi, N., Gendreau, M., & Potvin, J. Y. (2014). An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Computers & Operations Research, 41, 167-173. doi: https://doi.org/10.1016/j.cor.2013.08.016
Baker, B. M., & Sheasby, J. (1999). Extensions to the generalised assignment heuristic for vehicle routing. European Journal of Operational Research, 119(1), 147-157. doi: https://doi.org/10.1016/S0377-2217(98)00348-8
Benantar, A., Ouafi, R., & Boukachour, J. (2016). A petrol station replenishment problem: new variant and formulation. Logistics Research, 9(1), 6. doi: 10.1007/s12159-016-0133-z
Carotenuto, P., Giordani, S., Massari, S., & Vagaggini, F. (2015). Periodic capacitated vehicle routing for retail distribution of fuel oils. Transportation Research Procedia, 10, 735-744. doi: https://doi.org/10.1016/j.trpro.2015.09.027
Chen, S., Chen, R., Wang, G. G., Gao, J., & Sangaiah, A. K. (2018). An adaptive large neighborhood search heuristic for dynamic vehicle routing problems. Computers & Electrical Engineering, 67, 596-607. doi: https://doi.org/10.1016/j.compeleceng.2018.02.049
Chokanat, P., Pitakaso, R., & Sethanan, K. (2019). Methodology to Solve a Special Case of the Vehicle Routing Problem: A Case Study in the Raw Milk Transportation System. AgriEngineering, 1(1), 75-93.
Chowmali, W, & Sukto, S. (2020). A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery. Decision Science Letters, 9(1), 77-90.
Coelho, L. C., & Laporte, G. (2015). Classification, models and exact algorithms for multi-compartment delivery problems. European Journal of Operational Research, 242(3), 854-864. doi: https://doi.org/10.1016/j.ejor.2014.10.059
Dayarian, I., Crainic, T. G., Gendreau, M., & Rei, W. (2016). An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 95, 95-123. doi: https://doi.org/10.1016/j.tre.2016.09.004
Fisher, M. L, & Jaikumar, R. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11(2), 109-124.
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L.-M. (2016). An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. European Journal of Operational Research, 254(1), 80-91. doi: https://doi.org/10.1016/j.ejor.2016.03.040
Gruler, A., Panadero, J., de Armas, J., Pérez, J. A. Moreno, & J., Angel A. (2020). A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands. International Transactions in Operational Research, 27(1), 314-335. doi: https://doi.org/10.1111/itor.12540
Hanum, F., Hadi, M., Aman, A., & Bakhtiar, T. (2019). Vehicle routing problems in rice-for-the-poor distribution. Decision Science Letters, 8(3), 323-338. doi: 10.5267/j.dsl.2018.11.001
Hemmelmayr, V. C., Cordeau, J. F., & Crainic, T. G. (2012). An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & Operations Research, 39(12), 3215-3228. doi: https://doi.org/10.1016/j.cor.2012.04.007
Islam, M., Ghosh, S., & Rahman, M. (2015). Solving Capacitated Vehicle Routing Problem by Using Heuristic Approaches: A Case Study. Journal of Modern Science and Technology, 3(1), 135-146.
Jia, T., Li, X., Wang, N., & Li, R. (2014). Integrated Inventory Routing Problem with Quality Time Windows and Loading Cost for Deteriorating Items under Discrete Time. Mathematical Problems in Engineering, 2014, 537409. doi: 10.1155/2014/537409
Meindl, P., & Chopra, S. (2001). Supply chain management: Strategy, planning, and operation: Prentice Hall.
Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403-2435. doi: https://doi.org/10.1016/j.cor.2005.09.012
Pisinger, D., & Ropke, S. (2019). Large Neighborhood Search. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (pp. 99-127). Cham: Springer International Publishing.
Pitakaso, R., Sethanan, K., & Jamrus, T. (2020). Hybrid PSO and ALNS algorithm for software and mobile application for transportation in ice manufacturing industry 3.5. Computers & Industrial Engineering, 144, 106461. doi: https://doi.org/10.1016/j.cie.2020.106461
Popović, D., Vidović, M., & Radivojević, G. (2012). Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery. Expert Systems with Applications, 39(18), 13390-13398. doi: https://doi.org/10.1016/j.eswa.2012.05.064
Prescott-Gagnon, E., Desaulniers, G., & Rousseau, L.-M. (2014). Heuristics for an oil delivery vehicle routing problem. Flexible Services and Manufacturing Journal, 26(4), 516-539. doi: 10.1007/s10696-012-9169-9
Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4), 455-472.
Shaw, P. (1998). Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Berlin, Heidelberg.
Vidović, M, Popović, D, & Ratković, B. (2014). Mixed integer and heuristics model for the inventory routing problem in fuel delivery. International Journal of Production Economics, 147, 593-604. doi: https://doi.org/10.1016/j.ijpe.2013.04.034
Wang, B., Liang, Y., Yuan, M., Zhang, H., & Liao, Q. (2019). A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows. Petroleum Science, 16(3), 701-712. doi: 10.1007/s12182-019-0316-8
Wang, L., Kinable, J., & Woensel, T. (2020). The Fuel Replenishment Problem: A Split-Delivery Multi-Compartment Vehicle Routing Problem with Multiple Trips. Computers & Operations Research, 118, 104904. doi: 10.1016/j.cor.2020.104904
Wen, M., Linde, E., Ropke, S., Mirchandani, P., & Larsen, A. (2016). An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem. Computers & Operations Research, 76, 73-83. doi: https://doi.org/10.1016/j.cor.2016.06.013
Wichapa, N., & Khokhajaikiat, P. (2017). Using the hybrid fuzzy goal programming model and hybrid genetic algorithm to solve a multi-objective location routing problem for infectious waste disposal. Journal of Industrial Engineering and Management, 10(5), 853-856.
Wichapa, N., & Khokhajaikiat, P. (2018). Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm. International Journal of Industrial Engineering Computations, 9(1), 75-98.
Wichapa, N., Sudsuansee, T., & Khokhajaikiat, P. (2019). Solving the vehicle routing problems with time windows using hybrid genetic algorithm with push forward insertion heuristic and local search procedure. Journal of King Mongkut’s University of Technology North Bangkok, 29(1), 4-13.
Yu, Z., Zhang, P., Yu, Y., Sun, W., & Huang, M. (2020). An Adaptive Large Neighborhood Search for the Larger-Scale Instances of Green Vehicle Routing Problem with Time Windows. Complexity, 2020, 8210630. doi: 10.1155/2020/8210630
Baker, B. M., & Sheasby, J. (1999). Extensions to the generalised assignment heuristic for vehicle routing. European Journal of Operational Research, 119(1), 147-157. doi: https://doi.org/10.1016/S0377-2217(98)00348-8
Benantar, A., Ouafi, R., & Boukachour, J. (2016). A petrol station replenishment problem: new variant and formulation. Logistics Research, 9(1), 6. doi: 10.1007/s12159-016-0133-z
Carotenuto, P., Giordani, S., Massari, S., & Vagaggini, F. (2015). Periodic capacitated vehicle routing for retail distribution of fuel oils. Transportation Research Procedia, 10, 735-744. doi: https://doi.org/10.1016/j.trpro.2015.09.027
Chen, S., Chen, R., Wang, G. G., Gao, J., & Sangaiah, A. K. (2018). An adaptive large neighborhood search heuristic for dynamic vehicle routing problems. Computers & Electrical Engineering, 67, 596-607. doi: https://doi.org/10.1016/j.compeleceng.2018.02.049
Chokanat, P., Pitakaso, R., & Sethanan, K. (2019). Methodology to Solve a Special Case of the Vehicle Routing Problem: A Case Study in the Raw Milk Transportation System. AgriEngineering, 1(1), 75-93.
Chowmali, W, & Sukto, S. (2020). A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery. Decision Science Letters, 9(1), 77-90.
Coelho, L. C., & Laporte, G. (2015). Classification, models and exact algorithms for multi-compartment delivery problems. European Journal of Operational Research, 242(3), 854-864. doi: https://doi.org/10.1016/j.ejor.2014.10.059
Dayarian, I., Crainic, T. G., Gendreau, M., & Rei, W. (2016). An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 95, 95-123. doi: https://doi.org/10.1016/j.tre.2016.09.004
Fisher, M. L, & Jaikumar, R. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11(2), 109-124.
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L.-M. (2016). An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. European Journal of Operational Research, 254(1), 80-91. doi: https://doi.org/10.1016/j.ejor.2016.03.040
Gruler, A., Panadero, J., de Armas, J., Pérez, J. A. Moreno, & J., Angel A. (2020). A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands. International Transactions in Operational Research, 27(1), 314-335. doi: https://doi.org/10.1111/itor.12540
Hanum, F., Hadi, M., Aman, A., & Bakhtiar, T. (2019). Vehicle routing problems in rice-for-the-poor distribution. Decision Science Letters, 8(3), 323-338. doi: 10.5267/j.dsl.2018.11.001
Hemmelmayr, V. C., Cordeau, J. F., & Crainic, T. G. (2012). An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & Operations Research, 39(12), 3215-3228. doi: https://doi.org/10.1016/j.cor.2012.04.007
Islam, M., Ghosh, S., & Rahman, M. (2015). Solving Capacitated Vehicle Routing Problem by Using Heuristic Approaches: A Case Study. Journal of Modern Science and Technology, 3(1), 135-146.
Jia, T., Li, X., Wang, N., & Li, R. (2014). Integrated Inventory Routing Problem with Quality Time Windows and Loading Cost for Deteriorating Items under Discrete Time. Mathematical Problems in Engineering, 2014, 537409. doi: 10.1155/2014/537409
Meindl, P., & Chopra, S. (2001). Supply chain management: Strategy, planning, and operation: Prentice Hall.
Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403-2435. doi: https://doi.org/10.1016/j.cor.2005.09.012
Pisinger, D., & Ropke, S. (2019). Large Neighborhood Search. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (pp. 99-127). Cham: Springer International Publishing.
Pitakaso, R., Sethanan, K., & Jamrus, T. (2020). Hybrid PSO and ALNS algorithm for software and mobile application for transportation in ice manufacturing industry 3.5. Computers & Industrial Engineering, 144, 106461. doi: https://doi.org/10.1016/j.cie.2020.106461
Popović, D., Vidović, M., & Radivojević, G. (2012). Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery. Expert Systems with Applications, 39(18), 13390-13398. doi: https://doi.org/10.1016/j.eswa.2012.05.064
Prescott-Gagnon, E., Desaulniers, G., & Rousseau, L.-M. (2014). Heuristics for an oil delivery vehicle routing problem. Flexible Services and Manufacturing Journal, 26(4), 516-539. doi: 10.1007/s10696-012-9169-9
Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4), 455-472.
Shaw, P. (1998). Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Berlin, Heidelberg.
Vidović, M, Popović, D, & Ratković, B. (2014). Mixed integer and heuristics model for the inventory routing problem in fuel delivery. International Journal of Production Economics, 147, 593-604. doi: https://doi.org/10.1016/j.ijpe.2013.04.034
Wang, B., Liang, Y., Yuan, M., Zhang, H., & Liao, Q. (2019). A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows. Petroleum Science, 16(3), 701-712. doi: 10.1007/s12182-019-0316-8
Wang, L., Kinable, J., & Woensel, T. (2020). The Fuel Replenishment Problem: A Split-Delivery Multi-Compartment Vehicle Routing Problem with Multiple Trips. Computers & Operations Research, 118, 104904. doi: 10.1016/j.cor.2020.104904
Wen, M., Linde, E., Ropke, S., Mirchandani, P., & Larsen, A. (2016). An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem. Computers & Operations Research, 76, 73-83. doi: https://doi.org/10.1016/j.cor.2016.06.013
Wichapa, N., & Khokhajaikiat, P. (2017). Using the hybrid fuzzy goal programming model and hybrid genetic algorithm to solve a multi-objective location routing problem for infectious waste disposal. Journal of Industrial Engineering and Management, 10(5), 853-856.
Wichapa, N., & Khokhajaikiat, P. (2018). Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm. International Journal of Industrial Engineering Computations, 9(1), 75-98.
Wichapa, N., Sudsuansee, T., & Khokhajaikiat, P. (2019). Solving the vehicle routing problems with time windows using hybrid genetic algorithm with push forward insertion heuristic and local search procedure. Journal of King Mongkut’s University of Technology North Bangkok, 29(1), 4-13.
Yu, Z., Zhang, P., Yu, Y., Sun, W., & Huang, M. (2020). An Adaptive Large Neighborhood Search for the Larger-Scale Instances of Green Vehicle Routing Problem with Time Windows. Complexity, 2020, 8210630. doi: 10.1155/2020/8210630