Abstract: We investigated a multi-day distribution problem while supplies are limited. This scenario can be found in post-natural disasters or economic crisis such as floods, earthquakes, palm oil shortage crisis, etc. The objective function of this problem is to minimize total traveling distance, unsatisfied cost, and variance of supply delivery proportion. In order to solve this multi-day problem optimally, it requires large computing memory and takes a long computational time. Therefore, we divided these large problems into multiple daily sub-problems and solved the sub-problems with the exact method. The sub-problems were solved sequentially for which the prior daily sub-problem is to be tackle first and the following daily sub-problems are defined based on the prior daily sub-problem solution. Changes were applied to update demands and to adjust delivery priority. There are three delivery priority setups proposing in this paper. Also, we present an experiment using the three proposed methods to solve modified Solomon’s vehicle routing problem datasets which extended a single period vehicle routing problem with time windows to be seven-day routing problems.(More)

We investigated a multi-day distribution problem while supplies are limited. This scenario can be found in post-natural disasters or economic crisis such as floods, earthquakes, palm oil shortage crisis, etc. The objective function of this problem is to minimize total traveling distance, unsatisfied cost, and variance of supply delivery proportion. In order to solve this multi-day problem optimally, it requires large computing memory and takes a long computational time. Therefore, we divided these large problems into multiple daily sub-problems and solved the sub-problems with the exact method. The sub-problems were solved sequentially for which the prior daily sub-problem is to be tackle first and the following daily sub-problems are defined based on the prior daily sub-problem solution. Changes were applied to update demands and to adjust delivery priority. There are three delivery priority setups proposing in this paper. Also, we present an experiment using the three proposed methods to solve modified Solomon’s vehicle routing problem datasets which extended a single period vehicle routing problem with time windows to be seven-day routing problems.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Amphaiphan, N. and Laesanklang, W. (2020). An Optimization Method for a Multi-day Distribution Problem with Shortage Supplies. In Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-396-4; ISSN 2184-4372, SciTePress, pages 356-363. DOI: 10.5220/0009154703560363

@conference{icores20, author={Netiphan Amphaiphan. and Wasakorn Laesanklang.}, title={An Optimization Method for a Multi-day Distribution Problem with Shortage Supplies}, booktitle={Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - ICORES}, year={2020}, pages={356-363}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0009154703560363}, isbn={978-989-758-396-4}, issn={2184-4372}, }

TY - CONF

JO - Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - ICORES TI - An Optimization Method for a Multi-day Distribution Problem with Shortage Supplies SN - 978-989-758-396-4 IS - 2184-4372 AU - Amphaiphan, N. AU - Laesanklang, W. PY - 2020 SP - 356 EP - 363 DO - 10.5220/0009154703560363 PB - SciTePress

- Science and Technology Publications, Lda.RESOURCES