A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
| Autor: | Gilbert Laporte, Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Reduction (complexity)
Inventory control Information Systems and Management General Computer Science Operations research Computer science Modeling and Simulation Vehicle routing problem Decomposition (computer science) Management Science and Operations Research Routing (electronic design automation) Industrial and Manufacturing Engineering Tabu search |
| Zdroj: | European Journal of Operational Research. 202:122-130 |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/j.ejor.2009.05.008 |
| Popis: | The purpose of this article is to propose a tabu search heuristic for the split delivery Vehicle Routing Problem with Production and Demand Calendars (VRPPDC). This new problem consists of determining which customers will be served by a common carrier, as well as the delivery routes for those served by the private fleet, in order to minimize the overall transportation and inventory costs. We first model this problem and then propose a simple decomposition procedure that can be used to provide a starting solution. Next, we introduce a new tabu search heuristic and we describe two new neighbor reduction strategies. Finally, we present the results of our extensive computational tests. According to these tests, our reduction strategies are efficient not only at reducing computing time but also at improving the overall solution quality. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect