Determining the Shortest Path of Multi-location Path Based on the Maximum Flow

DOI

10.2991/emeit.2012.185How to use a DOI?

Keywords

location path, shortest path, the maximum flow

Abstract

In this paper, multi-location path math model is established at the condition that the number of distribution centers, customers, and the service scope is known. Constraints are including customer demand, network matching, and vehicle loading. To solve the shortest path based on the maximum flow problem, the network model about one distribution center and six distribution customers is proposed and the solution is also given below. When the distribution of prices, vehicle specifications and node path are known, the optimal path is gotten according to check the model instance. So, it’s feasible to solve the optimal path using the maximum flow.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xueying Li
AU  - Qin Zhang
AU  - Qiang Zhang
AU  - Wenxia Yu
AU  - Mengzhu Shi
PY  - 2012/09
DA  - 2012/09
TI  - Determining the Shortest Path of Multi-location Path Based on the Maximum Flow
BT  - Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT 2012)
PB  - Atlantis Press
SP  - 860
EP  - 863
SN  - 1951-6851
UR  - https://doi.org/10.2991/emeit.2012.185
DO  - 10.2991/emeit.2012.185
ID  - Li2012/09
ER  -