The Quickest Delivery on the Super Pipeline Based Logistic System
Zhongyuan Lai, Hao Li, Tonghui Qian, Bo Wang
Available Online August 2015.
- https://doi.org/10.2991/msam-15.2015.39How to use a DOI?
- logistic system; quickest delivery; delivery line; time-position segment
- In this paper, we consider the problem of delivering replenishments from source to sink nodes on a delivery line in minimum time interval, where the halfway stopping and intercrossing are forbidden. We call this problem the quickest delivery problem, and define it in a mathematical way. We point out that this problem is equivalent to the problem of moving time-position segments along the time axis such that any two segments are not intersected with each other and the total time is minimized. Based on this point, we formulate the quickest delivery problem as a minimization problem, with the non-intercrossing constraints as non-intersection constraints among time-position segments in four cases. We can solve this minimization problem by using optimization toolboxes. Experiments confirm the effectiveness of our model.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Zhongyuan Lai AU - Hao Li AU - Tonghui Qian AU - Bo Wang PY - 2015/08 DA - 2015/08 TI - The Quickest Delivery on the Super Pipeline Based Logistic System BT - 2015 International Conference on Modeling, Simulation and Applied Mathematics PB - Atlantis Press SP - 174 EP - 177 SN - 1951-6851 UR - https://doi.org/10.2991/msam-15.2015.39 DO - https://doi.org/10.2991/msam-15.2015.39 ID - Lai2015/08 ER -