GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
| Autor: | Anis Mjirda, Bassem Jarboui, Said Toumi, Samia Hasni |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Inventory routing problem
050210 logistics & transportation Mathematical optimization 021103 operations research Heuristic (computer science) Applied Mathematics media_common.quotation_subject 05 social sciences 0211 other engineering and technologies 02 engineering and technology Multi product Set (abstract data type) Inventory management 0502 economics and business Discrete Mathematics and Combinatorics Quality (business) Routing (electronic design automation) Variable neighborhood search media_common Mathematics |
| Zdroj: | Electronic Notes in Discrete Mathematics. 58:71-78 |
| ISSN: | 1571-0653 |
| DOI: | 10.1016/j.endm.2017.03.010 |
| Popis: | We address a multi-product version of the IRP, in which a supplier is responsible for the distribution of several products to a set of geographically dispersed customers using a feet of heterogeneous vehicles. We deal with a deterministic version of demand rates in which the supplier has full knowledge of future demands. To generate good solutions, we have developed an algorithm based on the Variable Neighborhood Search capable of solving this variant. Our comparative tests on a large set of artificial instances have shown that our heuristic can produce high quality solutions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect