Universität zu Köln

Derigs, Ulrich and Pullmann, Markus (2014). Solving Multitrip Vehicle Routing Under Order Incompatibilities: A VRP Arising in Supply Chain Management. Networks, 64 (1). S. 29 - 40. HOBOKEN: WILEY. ISSN 1097-0037

Full text not available from this repository.

Abstract

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. (C) 2014 Wiley Periodicals, Inc.

Item Type:	Journal Article
Creators:	Creators Email ORCID ORCID Put Code Derigs, Ulrich UNSPECIFIED UNSPECIFIED UNSPECIFIED Pullmann, Markus UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-432962
DOI:	10.1002/net.21554
Journal or Publication Title:	Networks
Volume:	64
Number:	1
Page Range:	S. 29 - 40
Date:	2014
Publisher:	WILEY
Place of Publication:	HOBOKEN
ISSN:	1097-0037
Language:	English
Faculty:	Unspecified
Divisions:	Unspecified
Subjects:	no entry
Uncontrolled Keywords:	Keywords Language TABU SEARCH; HEURISTICS; ALGORITHM Multiple languages Computer Science, Hardware & Architecture; Operations Research & Management Science Multiple languages
URI:	http://kups.ub.uni-koeln.de/id/eprint/43296