Research on End Distribution Path Problem of Dairy Cold Chain

Zhen-ping Li () and Shan Wang ()
Additional contact information
Zhen-ping Li: Beijing Wuzi University
Shan Wang: Beijing Wuzi University

Chapter Chapter 104 in The 19th International Conference on Industrial Engineering and Engineering Management, 2013, pp 983-992 from Springer

Abstract: Abstract The vehicle routing problem of dairy cold chain end distribution with random demand and time window is investigated in this paper. Considering the characteristics of dairy cold chain end distribution, the chance constrained theory and the penalty function is introduced to establish a mathematical model of this problem. A scanning-insert algorithm to solve the model is proposed. The algorithm can be described as: firstly, according to the capacity of the vehicle and time window restrictions, the customers are divide into several groups by scan algorithm; then find a feasible routing line for each group of customers; finally, using the idea of recent insertion method to adjust the vehicle route and find the final optimal distribution vehicle route.

Keywords: Dairy cold chain; Random demand; Mathematical model; Scanning-insert algorithm (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-38391-5_104

Ordering information: This item can be ordered from
http://www.springer.com/9783642383915

DOI: 10.1007/978-3-642-38391-5_104

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().