Next Article in Journal
Analyzing the Impact of Spanish University Funding Policies on the Evolution of Their Performance: A Multi-Criteria Approach
Previous Article in Journal
Inverse Problem for Ising Connection Matrix with Long-Range Interaction
Article

Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows

1
Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 10607, Taiwan
2
Center for Cyber-Physical System Innovation, National Taiwan University of Science and Technology, Taipei 10607, Taiwan
3
Department of Industrial Engineering, University Singaperbangsa Karawang, Karawang 41361, Indonesia
4
Industrial Engineering Department, BINUS Graduate Program—Master of Industrial Engineering, Bina Nusantara University, Jakarta 11480, Indonesia
5
Department of Information Management, Chang Gung University, Taoyuan 33302, Taiwan
6
Department of Industrial and Management, Ming Chi University of Technology, New Taipei 24301, Taiwan
7
Department of Neurology, Linkou Chang Gung Memorial Hospital, Taoyuan 33305, Taiwan
*
Author to whom correspondence should be addressed.
Academic Editor: Armin Fügenschuh
Mathematics 2021, 9(14), 1625; https://doi.org/10.3390/math9141625
Received: 5 June 2021 / Revised: 25 June 2021 / Accepted: 4 July 2021 / Published: 9 July 2021
(This article belongs to the Section Computational and Applied Mathematics)
This research presents a variant of the vehicle routing problem known as the path cover problem with time windows (PCPTW), in which each vehicle starts with a particular customer and finishes its route at another customer. The vehicles serve each customer within the customer’s time windows. PCPTW is motivated by a practical strategy for companies to reduce operational cost by hiring freelance workers, thus allowing workers to directly service customers without reporting to the office. A mathematical programming model is formulated for the problem. This research also proposes a simulated annealing heuristic with restart strategy (SARS) to solve PCPTW and test it on several benchmark datasets. Computational results indicate that the proposed SARS effectively solves PCPTW. View Full-Text
Keywords: simulated annealing with restart strategy; vehicle routing problem; path cover problem; time windows simulated annealing with restart strategy; vehicle routing problem; path cover problem; time windows
Show Figures

Figure 1

MDPI and ACS Style

Yu, V.F.; Winarno; Maulidin, A.; Redi, A.A.N.P.; Lin, S.-W.; Yang, C.-L. Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows. Mathematics 2021, 9, 1625. https://doi.org/10.3390/math9141625

AMA Style

Yu VF, Winarno, Maulidin A, Redi AANP, Lin S-W, Yang C-L. Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows. Mathematics. 2021; 9(14):1625. https://doi.org/10.3390/math9141625

Chicago/Turabian Style

Yu, Vincent F., Winarno, Achmad Maulidin, A. A.N.P. Redi, Shih-Wei Lin, and Chao-Lung Yang. 2021. "Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows" Mathematics 9, no. 14: 1625. https://doi.org/10.3390/math9141625

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop