Premium
Solving multitrip vehicle routing under order incompatibilities: A VRP arising in supply chain management
Author(s) -
Derigs Ulrich,
Pullmann Markus
Publication year - 2014
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21554
Subject(s) - vehicle routing problem , computer science , mathematical optimization , set (abstract data type) , class (philosophy) , heuristic , supply chain , routing (electronic design automation) , order (exchange) , supply chain management , operations research , mathematics , artificial intelligence , economics , computer network , finance , political science , law , programming language
In this study, we introduce a new class of vehicle routing problems (VRP): the multidepot multitrip VRP with order incompatibilities. The problem is motivated by a specific two‐echelon distribution system arising in supply chain management, where products come to the depots from different factories by semitrailers and these semitrailers are also used for short‐haul distribution, that is, the load from different factories is not consolidated at the depots. This VRP is rather challenging as it combines several synchronisation constraints occurring in other well‐known standard VRP. In this article, we describe several problem variants, we model the problem as a set partitioning problem, and we show how the heuristic concept of concurrent (LS/LNS) neighborhood search which has shown to be rather effective for other complex VRP‐classes can be customized. Our computational study shows that this approach is effective and efficient for this VRP‐class, too. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 64(1), 29–39 2014