Study on City Express Delivery Routing and Scheduling Problem with Time Windows

Li Li () and Qilan Zhao ()
Additional contact information
Li Li: Beijing Jiaotong University
Qilan Zhao: Beijing Jiaotong University

A chapter in LISS 2014, 2015, pp 267-273 from Springer

Abstract: Abstract The vehicle routing problem is usually resolved with ant colony algorithm nowadays. Many researchers have put forward advanced ant colony algorithm to improve the calculating speed. City express delivery routing and scheduling model is constructed based on the actuality of city express. Different with traditional vehicle routing problem, this model includes two objective functions-minimum cost and highest service level. The constraint of time window is also included in the model. SF express delivery routing and scheduling problem in Chaoyang District, Beijing is resolved based on this model. After comparison and analysis we draw a conclusion that the model is feasible and more practical.

Keywords: City express; Vehicle routing problem; Multiple objectives; Time window (search for similar items in EconPapers)
Date: 2015
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-662-43871-8_41

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

DOI: 10.1007/978-3-662-43871-8_41

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