The capacitated vehicle routing problem (CVRP) is an NP-hard problem. Therefore, metaheuristics are often more suitable for practical applications. In this paper, a genetic algorithm (GA) is proposed to solve the problem. The performance of the proposed algorithm is tested on different sets of benchmark instances. The computational results indicate that the algorithm has a satisfactory performance in solving the problem.
Published in: 8th Annual International Conference on Industrial Engineering and Operations Management, Bandung, Indonesia
Publisher: IEOM Society International
Date of Conference: March 6-8, 2018
ISBN: 978-1-5323-5944-6
ISSN/E-ISSN: 2169-8767
Hospital logistics activities
8th Annual International Conference on Industrial Engineering and Operations Management
Published: 2018
Logistics Outsourcing: From the Contracts Complexity to the Performance of the Logistic Services
8th Annual International Conference on Industrial Engineering and Operations Management
Published: 2018
Risk Assessment in the Logistics Outsourcing process: Decision-Making Tool
8th Annual International Conference on Industrial Engineering and Operations Management
Published: 2018