Universität zu Köln

Derigs, Ulrich and Pullmann, Markus (2016). A computational study comparing different multiple neighbourhood strategies for solving rich vehicle routing problems. IMA J. Manag. Math., 27 (1). S. 3 - 24. OXFORD: OXFORD UNIV PRESS. ISSN 1471-6798

Full text not available from this repository.

Abstract

In this paper we report the results of an extensive computational study on a variety of rich vehicle routing problems in which two fundamentally different paradigms or strategies of applying (the same set of) different neighbourhoods are assessed with respect to effectivity (solution quality) and efficiency (speed). We especially compare the structured approach known from variable neighbourhood search where neighbourhoods are applied in some fixed sequential order with an approach where neighbourhoods are applied concurrently. Since all approaches are implemented using the same basic modules, differences can be attributed to this strategic difference. We can show that, first, the application of large neighbourhoods is essential for quality, and, second, that the concurrent strategy outperforms the sequential strategy.

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-291664
DOI:	10.1093/imaman/dpt022
Journal or Publication Title:	IMA J. Manag. Math.
Volume:	27
Number:	1
Page Range:	S. 3 - 24
Date:	2016
Publisher:	OXFORD UNIV PRESS
Place of Publication:	OXFORD
ISSN:	1471-6798
Language:	English
Faculty:	Unspecified
Divisions:	Unspecified
Subjects:	no entry
Uncontrolled Keywords:	Keywords Language TIME WINDOWS; DISPATCHING PROBLEM; SEARCH; ALGORITHM; HEURISTICS; TRUCK; DEPOT Multiple languages Management; Operations Research & Management Science; Mathematics, Interdisciplinary Applications; Social Sciences, Mathematical Methods Multiple languages
Refereed:	Yes
URI:	http://kups.ub.uni-koeln.de/id/eprint/29166