A New Method for Vehicle Routing Problems with Time Window in the Distribution Center

Lvelve Zhou () and Yuguang Wei ()
Additional contact information
Lvelve Zhou: Beijing Jiaotong University
Yuguang Wei: Beijing Jiaotong University

A chapter in LISS 2013, 2015, pp 341-345 from Springer

Abstract: Abstract Focused on the single distribution, vehicle routing problem with time windows (VRPTW) considered here is to achieve the minimization of total cost, which includes the travel costs and the penalty coefficient of time, under the constraints of time limits, volume, carrying capacity and variable cost. In order to solve this model, we choose an algorithm called Genetic Simulated Annealing algorithm (GSAA) with memory, and simulate this algorithm. The results showed that the approach to solve the VRPTW is very competitive.

Keywords: Vehicle routing problem; Time-window; Mathematical mode; Genetic simulated annealing algorithm (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-642-40660-7_50

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

DOI: 10.1007/978-3-642-40660-7_50

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