Multi-Trip Time-Dependent Vehicle Routing Problem with Soft Time Windows and Overtime Constraints
Journal article
Authors/Editors
Strategic Research Themes
Publication Details
Author list: Karoonsoontawong A., Punyim P., Nueangnitnaraporn W., Ratanavaraha V.
Publisher: Springer
Publication year: 2020
Journal: Networks and Spatial Economics (1566-113X)
Volume number: 20
Issue number: 2
Start page: 549
End page: 598
Number of pages: 50
ISSN: 1566-113X
eISSN: 1572-9427
Languages: English-Great Britain (EN-GB)
View in Web of Science | View on publisher site | View citing articles in Web of Science
Abstract
The multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints (MT-TDVRPSTW-OT) is considered in this paper. The modified hierarchical multi-objective formulation and the equivalent single-objective formulation are proposed. The iterative multi-trip tour construction and improvement (IMTTCI) procedure and the single-trip tour counterpart procedure with post-processing greedy heuristic (ISTTCI-GH) are proposed to solve the problem. These procedures are based on the ruin and recreate principle, and consider trade-offs among cost components (vehicle usage, number of early/late soft time window occurrences, transport distance, transport time, overtime and early/late soft time window penalty costs) in the search process. From the computational experiment, the IMTTCI procedure outperforms the existing efficient insertion heuristic with 42.09% improvement in number of vehicles and 24.30% improvement in travel time for the constant-speed multi-trip vehicle routing problem with hard time windows and shift time limits, a special case of MT-TDVRPSTW-OT problem, on all problem instances. For the MT-TDVRPSTW-OT problem, the ISTTCI-GH and the IMTTCI outperform the ISTTCI on all problem groups by 43.21% and 69.44% in the number of vehicles (the primary objective), respectively. The IMTTCI outperforms the ISTTCI-GH in number of vehicles by 51.07%, but takes 42.83% longer CPU time than the ISTTCI-GH. The performance of IMTTCI in terms of the primary objective improves with the increase of mean speed as well as the increase of time window width and planning horizon across all customer configuration types, tighter/looser time windows, shorter/longer planning horizon and various time-dependent travel speed profiles. The sensitivity analysis of different problem parameters is performed. The complexity analysis of the proposed procedures shows that the proposed procedures are solvable in polynomial time, and from the computational results the relationships between the CPU time and problem size confirm this. For the MT-VRPSTW-OT, a mixed integer program and the special case of MT-TDVRPSTW-OT, on 12-customer instances, the proposed IMTTCI algorithm yields the average optimality gap of 1.35% with the average CPU time of 0.66 seconds, whereas the GAMS/CPLEX solver yields the average optimality gap of 0.83% with the average CPU time of 256.39 seconds. The proposed IMTTCI algorithm yields only 0.52% greater optimality gap but 388 times faster CPU time than the commercial solver. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
Multi Trip, Overtime, Shift Time Limit, Soft Time Window, Time Dependent Vehicle Routing Problem
Contact Information