食品配送中动态车辆路径规划问题研究

论文摘要

车辆路径问题是优化问题。它们是一个应用于交付业务的运营研究领域。这些问题的目的是在优化物流资源(差旅成本、人力和物力资源等)的同时完成交付。本文研究的问题是一个具有多容量和时间窗的异构车辆路径问题。该公司在上海提供两种类型的食品,并希望包括特殊的客户到其日常路线。为了优化业务的计算时间,我们在这里开发了一个过程,允许对初始问题进行一些修改,而不需要过多的计算时间。为此,我们考虑了物流成本和计算时间之间的关系。在这项研究中,我们使用了一个延迟接受算法。我们将多个数据集与动态或静态情况进行比较,以找出计算时间最短的最佳结果。这项研究的结果使我们能够在财务上证明动态解决交付活动中特定业务策略的利益。

论文目录

Abstract

摘要

Chapter 1 : Introduction

1.1 Generalities on Transportation

1.1.1 Transportation in the logistic chain

1.1.2 Transportation of Perishable Food

1.2 Research approach

1.3 Context of this study

1.4 Aims and objectives

1.5 Content and structure

Chapter 2 : Literature review

2.1 The Travelling Salesman Problem （TSP）

2.1.1 Exact algorithms:

2.1.2 Heuristic algorithms:

2.2 The Vehicle Routing Problem （VRP）

2.2.1 Exact algorithms:

2.2.2 Heuristic algorithms:

2.2.3 Metaheuristic algorithms:

2.3 Choice of algorithms

Chapter 3 : Problem Statement

3.1 Problem Definition

3.2 Modeling

3.2.1 Business Input data

3.2.2 Operating hypothesis

Chapter 4 : Solving technique

4.1 Solver adaptation

4.1.1 Optaplanner general presentation

4.1.2 VRP Solver

4.2 Methodology

4.2.1 Can dynamic solving be financially attractive?

4.2.2 Are the algorithms that are good for static resolution also good for dynamic resolution?

Chapter 5 : Experimental analysis

5.1 Dynamic experiments using Late Acceptance

init without addition'> 5.1.1 Initialization: Computation of 159c_init without addition

5.1.2 Addition of customers: +1customer

5.1.3 Addition of customers: +5customers

5.1.4 Addition of customers: +10customers

5.1.5 Addition of customers: +15customers

5.1.6 Summary and Analysis

5.2 Comparison of Late Acceptance and Tabu Search

5.2.1 Results

5.2.2 Analysis

Chapter 6 : Conclusion

6.1 Summary

6.2 Limitations

References

Tables and Figures

Appendix 1 - Problem Dataset

Appendix 2 - Initial result

Appendix 3 - Addition of 1 customer – Using Algorithm1 Late Acceptance

Appendix 4 - Addition of 5 customers – Using Algorithm1 Late Acceptance

Appendix 5 - Addition of 10 customers – Using Algorithm1 Late Acceptance

Appendix 6 - Addition of 15 customers – Using Algorithm1 Late Acceptance

Appendix 7 - Addition of 1 customer – Using Algorithm2 Tabu Search

Appendix 8 - Addition of 5 customers – Using Algorithm2 Tabu Search

Appendix 9 - Addition of 10 customers – Using Algorithm2 Tabu Search

Appendix 10 - Addition of 15 customers – Using Algorithm2 Tabu Search

Acknowledgement

文章来源

类型: 硕士论文

作者: Vial Marie-Louise

导师: Chen Lu

关键词: 车辆路径规划问题,动态需求,启发式,异构车队,多种容量

来源: 上海交通大学

年度: 2019

分类: 基础科学,经济与管理科学

专业: 数学,宏观经济管理与可持续发展,工业经济

单位: 上海交通大学

分类号: F426.82;F252;O221

DOI: 10.27307/d.cnki.gsjtu.2019.002371

总页数: 82

文件大小: 3427K

下载量: 32

食品配送中动态车辆路径规划问题研究

论文摘要

论文目录

文章来源

相关论文文献

猜你喜欢