.png){kind=icon}
.png){kind=icon}
Return
A heuristic algorithm for the free newspaper delivery problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2013.04.039.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the problem of finding an effective distribution plan to deliver free newspapers from a production plant to subway, bus, or tram stations. The overall goal is to combine two factors: first, the free newspaper producing company wants to minimize the number of vehicle trips needed to distribute all newspapers produced at the production plant. Second, the company is interested in minimizing the time needed to consume all newspapers, i.e., the time needed to get all the newspapers taken by the final readers. The resulting routing problem combines aspects of the vehicle routing problem with time windows, the inventory routing problem, and additional constraints related to the production schedule. We propose a formulation and different heuristic approaches, as well as a hybrid method. Computational tests with real world data show that the hybrid method is the best in various problem settings. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Vehicle routing problem with time windows
Inventory routing
Production schedule
Metaheuristics
Hybrid methods
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
View more organizations