| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Estadual Campinas, Fac Elect & Comp Engn, BR-13083852 Campinas, SP - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | COMPUTERS & INDUSTRIAL ENGINEERING; v. 148, OCT 2020. |
| Web of Science Citations: | 0 |
| Abstract | |
This paper presents exact algorithms based on logic-based Benders decomposition and a variant, called branch- and-check, for the heterogeneous fixed fleet vehicle routing problem with time windows. The objective is to service, at the minimal cost, a set of geographically dispersed customers within their time windows by a limited and capacitated fleet of heterogeneous vehicles. The proposed algorithms decompose the problem into a generalized assignment master problem and independent traveling salesman subproblems with time windows. Valid optimality and feasibility cuts are devised to guarantee the convergence of the algorithms, which include enhancements to solve the master problem and the subproblems. Extensive computational experiments on 216 benchmark instances illustrate the effectiveness of the suggested approaches. Instances with up to 100 customers are solved to proven optimality and the results indicate that the best proposed algorithm is competitive with state-of-the-art methods. (AU) | |
| FAPESP's process: | 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 16/06566-4 - Optimal Algorithms for the Vehicle Routing Problem with Heterogeneous Fleet, Flexible Time Windows and Stochastic Travel Times |
| Grantee: | Vinicius Amaral Armentano |
| Support Opportunities: | Scholarships abroad - Research |