The Optimization Model and Empirical Analysis for Vehicle Routing Problems with Time Windows Based on C-W Algorithm

Lijuan Fan () and Qiuli Qin ()
Additional contact information
Lijuan Fan: Beijing Jiaotong University
Qiuli Qin: Beijing Jiaotong University

A chapter in LISS 2012, 2013, pp 253-258 from Springer

Abstract: Abstract Vehicle routing problem is a kind of optimization scheduling problems which researches how to realize transportation cost optimization though programming driving route reasonably. Considering the vehicle routing problems with time window restriction, we establish the proper model related to the typical practical situation based on c-w saving algorithm. The case study indicates that saving algorithm is reasonable, and it also shows that this calculation might be simple and convenient and this method could be easy to realize by computer. However, the precision of the solution will be reduced if the number of customers increases with growing solution space.

Keywords: Vehicle routing problem; Time windows restriction; C-W saving algorithm; Logistics distribution (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-32054-5_38

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

DOI: 10.1007/978-3-642-32054-5_38

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 ().