Title
An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem.
Abstract
•We consider a Selective Periodic Inventory Routing problem (SPIRP).•It is about the logistics of waste vegetable oil collection for biodiesel production.•Partial collection of waste oil accumulating at the source nodes is not permitted.•A periodic weekly routing schedule is generated to satisfy production requirements.•We propose an Adaptive Large Neighborhood Search algorithm (ALNS) for SPIRP.
Year
DOI
Venue
2014
10.1016/j.ejor.2014.05.043
European Journal of Operational Research
Keywords
Field
DocType
Routing,Periodic inventory routing,Adaptive large neighborhood search,Waste vegetable oil collection
Waste oil,Mathematical optimization,Raw material,Time horizon,Inventory routing problem,Algorithm,Integer programming,Purchasing,Periodic graph (geometry),Mathematics,Operations management,Large neighborhood search
Journal
Volume
Issue
ISSN
239
2
0377-2217
Citations 
PageRank 
References 
19
0.68
29
Authors
4
Name
Order
Citations
PageRank
Deniz Aksen118911.38
Onur Kaya210613.85
F. Sibel Salman326925.92
Özge Tüncel4190.68