Iterated variable neighborhood search for integrated scheduling of additive manufacturing and multi-trip vehicle routing problem

Abstract

This study addresses a novel problem structure for integrated scheduling of additive manufacturing and delivery processes. In the manufacturing process, we consider batch production of parts, simulating Selective Laser Melting technology in parallel additive manufacturing machines with heterogeneous specifications. A batch production, referred to as a build, must consist of parts with homogenous material. During the production run, sequence-dependent material setup times occur in between builds. In the delivery process, parts are delivered in batches using a limited number of homogenous capacitated vehicles. Each vehicle might perform multi-trips. Thus, the route for each trip and departure schedule among trips must be decided. In this regard, batch delivery is independent to batch production. The problem objective function is to minimize the total completion time of all parts. For optimally solving the problem, a mixed-integer linear programming model is devised. To solve larger problems sizes under a lower computation time, an iterated variable neighborhood search algorithm with embedded rule-based heuristics is proposed. The computational experiment denotes that the proposed algorithm with route minimization rule effectively solves small-scale problems, while capacity usage maximization rule performs the best in large-scale problems and outperforms other existing metaheuristics. Further result analysis is also performed to provide managerial insights.