This research presents an extension of Path Cover Problem with Time Windows (PCPTW) by considering various vehicle types to construct the distribution route, referred to as a Heterogeneous Fixed Fleet Path Cover Problem with Time Windows (HFFPCPTW). In HFFPCPTW, each vehicle starts with a particular customer and finishes its route at another customer. The vehicles serve each customer within the customer’s time. Each type of vehicle is limited in number. A mathematical programming model is formulated for the problem. This research also proposes a Simulated Annealing with Greedy Operator Selection (SAGOS) to solve HFFPCPTW and tests it on several benchmark datasets. The proposed SAGOS generates new best-known solution on 30 PCPTW instances and five HFFVRPTW instances. Moreover, it is also compared with GUROBI. Computational results indicate that the proposed SAGOS effectively solves HFFPCPTW.

Alssager, M., Othman, Z. A., Ayob, M., Mohemad, R., & Yuliansyah, H. (2020). Hybrid cuckoo search for the capacitated vehicle routing problem. Symmetry, 12(12), 2088.
Alvarez, A., Munari, P., & Morabito, R. (2018). Iterated local search and simulated annealing algorithms for the inventory routing problem. International Transactions in Operational Research, 25(6), 1785-1809.
Aydemir, E., & Karagul, K. (2020). Solving a periodic capacitated vehicle routing problem using simulated annealing algorithm for a manufacturing company. Brazilian Journal of Operations & Production Management, 17(1), 1-13.
Belfiore, P. P., & Fávero, L. P. L. (2007). Scatter search for the fleet size and mix vehicle routing problem with time windows. Central European Journal of Operations Research, 15(4), 351-368.
Bernal, J., Escobar, J. W., & Linfati, R. (2021). A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows. International Journal of Shipping and Transport Logistics, 13(1-2), 185-204.
Bodin, L. (1983). Routing and scheduling of vehicles and crews, the state of the art. Comput. Oper. Res., 10(2), 63-211.
Bräysy, O., Dullaert, W., Hasle, G., Mester, D., & Gendreau, M. (2008). An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows. Transportation Science, 42(3), 371-386.
Candido, L. C. X., & de Souza, L. V. (2022). Mathematical Model and Simulated Annealing Algorithm for the Two-Dimensional Loading Heterogeneous Fixed Fleet Vehicle Routing Problem. Mathematical Problems in Engineering, 2022.
Dell'Amico, M., Monaci, M., Pagani, C., & Vigo, D. (2007). Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transportation Science, 41(4), 516-526.
Dullaert, W., Janssens, G. K., Sörensen, K., & Vernimmen, B. (2002). New heuristics for the fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research society, 53(11), 1232-1238.
Dutta, J., Barma, P. S., Mukherjee, A., Kar, S., & De, T. (2022). A hybrid multi-objective evolutionary algorithm for open vehicle routing problem through cluster primary-route secondary approach. International Journal of Management Science and Engineering Management, 17(2), 132-146.
Ferdi, I., & Layeb, A. (2018). A GRASP algorithm based new heuristic for the capacitated location routing problem. Journal of Experimental & Theoretical Artificial Intelligence, 30(3), 369-387.
Ferreira, K. M., & de Queiroz, T. A. (2022). A simulated annealing based heuristic for a location-routing problem with two-dimensional loading constraints. Applied Soft Computing, 118, 108443.
Graf, B. (2020). Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem. Networks, 76(2), 256-272.
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.
Hintsch, T. (2021). Large multiple neighborhood search for the soft-clustered vehicle-routing problem. Computers & Operations Research, 129, 105132.
Ilhan, İ. (2020). A population based simulated annealing algorithm for capacitated vehiclerouting problem. Turkish Journal of Electrical Engineering and Computer Sciences, 28(3), 1217-1235.
İlhan, İ. (2021). An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem. Swarm and Evolutionary Computation, 64, 100911.
Jiang, J., Ng, K. M., Poh, K. L., & Teo, K. M. (2014). Vehicle routing problem with a heterogeneous fleet and time windows. Expert Systems with Applications, 41(8), 3748-3760.
Kancharla, S. R., & Ramadurai, G. (2019). Simulated annealing algorithm for multi depot two-echelon capacitated vehicle routing problem. Paper presented at the Transportation Research Board 98th Annual Meeting.
Kirkpatrick, S., Gelatt, J. C., & Vecchi, M. P. (1983). Optimization by simmulated annealing. science, 220(4598), 671-680.
Koç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2015). A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Computers & Operations Research, 64, 11-27.
Lahyani, R., Gouguenheim, A.-L., & Coelho, L. C. (2019). A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems. International Journal of Production Research, 57(22), 6963-6976.
Li, F., Golden, B., & Wasil, E. (2007). The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & Operations Research, 34(10), 2918-2930.
Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research society, 50(7), 721-732.
Manguino, J. L., & Ronconi, D. P. (2021). Step cost functions in a fleet size and mix vehicle routing problem with time windows. Annals of Operations Research, 1-26.
Molina, J. C., Salmeron, J. L., Eguia, I., & Racero, J. (2020). The heterogeneous vehicle routing problem with time windows and a limited number of resources. Engineering Applications of Artificial Intelligence, 94, 103745.
Normasari, N. M. E., Yu, V. F., & Bachtiyar, C. (2019). A simulated annealing heuristic for the capacitated green vehicle routing problem. Mathematical Problems in Engineering, 2019.
Rabbouch, B., Saâdaoui, F., & Mraihi, R. (2020). Empirical-type simulated annealing for solving the capacitated vehicle routing problem. Journal of Experimental & Theoretical Artificial Intelligence, 32(3), 437-452.
Redi, A. A. N. P., Jewpanya, P., Kurniawan, A. C., Persada, S. F., Nadlifatin, R., & Dewi, O. A. C. (2020). A simulated annealing algorithm for solving two-echelon vehicle routing problem with locker facilities. Algorithms, 13(9), 218.
Roohnavazfar, M., Pasandideh, S. H. R., & Tadei, R. (2022). A hybrid algorithm for the Vehicle Routing Problem with AND/OR Precedence Constraints and time windows. Computers & Operations Research, 143, 105766.
Ruiz, E. R. y., García-Calvillo, I., & Nucamendi-Guillén, S. (2022). Open vehicle routing problem with split deliveries: mathematical formulations and a cutting-plane method. Operational Research, 1017-1037.
Schaap, H., Schiffer, M., Schneider, M., & Walther, G. (2022). A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time Windows. Transportation Science.
Schrage, L. (1981). Formulation and structure of more complex/realistic routing and scheduling problems. Networks, 11(2), 229-232.
Soto-Mendoza, V., García-Calvillo, I., Ruiz-y-Ruiz, E., & Pérez-Terrazas, J. (2020). A hybrid grasshopper optimization algorithm applied to the open vehicle routing problem. Algorithms, 13(4), 96.
Sun, L., Pan, Q.-k., Jing, X.-L., & Huang, J.-P. (2021). A light-robust-optimization model and an effective memetic algorithm for an open vehicle routing problem under uncertain travel times. Memetic Computing, 13(2), 149-167.
Wu, X., Hu, D., Ma, B., & Jiang, R. (2022). The Two Echelon Open Vehicle Routing Problem: Optimization of Crowdshipping Based Parcel Delivery. KSCE Journal of Civil Engineering, 26(9), 4073-4085.
Yu, V. F., Jewpanya, P., Redi, A. A. N. P., & Tsao, Y.-C. (2021). Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks. Computers & Operations Research, 129, 105205.
Yu, V. F., Lin, S.-W., Lee, W., & Ting, C.-J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering, 58(2), 288-299.
Yu, V. F., Purwanti, S. S., Redi, A. P., Lu, C.-C., Suprayogi, S., & Jewpanya, P. (2018). Simulated annealing heuristic for the general share-a-ride problem. Engineering Optimization, 50(7), 1178-1197.
Yu, V. F., Redi, A. A. N. P., Halim, C., & Jewpanya, P. (2020). The path cover problem: Formulation and a hybrid metaheuristic. Expert Systems with Applications, 146, 113107.
Yu, V. F., Susanto, H., Jodiawan, P., Ho, T.-W., Lin, S.-W., & Huang, Y.-T. (2022). A simulated annealing algorithm for the vehicle routing problem with parcel lockers. IEEE Access, 10, 20764-20782.
Yu, V. F., Winarno, Maulidin, A., Redi, A. A. N. P., Lin, S.-W., & Yang, C.-L. (2021). Simulated annealing with restart strategy for the path cover problem with time Windows. Mathematics, 9(14), 1625.