hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1002276

Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm

Yuguang Wei ; School of Traffic and Transportation Beijing Jiaotong University, Beijing, China
Luelue Zhou ; Beijing Jiaotong University

Puni tekst: engleski, PDF (191 KB) str. 31-39 preuzimanja: 529* citiraj
APA 6th Edition
Wei, Y. i Zhou, L. (2014). Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm. Journal of computing and information technology, 22 (LISS 2013), 31-39. https://doi.org/10.2498/cit.1002276
MLA 8th Edition
Wei, Yuguang i Luelue Zhou. "Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm." Journal of computing and information technology, vol. 22, br. LISS 2013, 2014, str. 31-39. https://doi.org/10.2498/cit.1002276. Citirano 17.08.2019.
Chicago 17th Edition
Wei, Yuguang i Luelue Zhou. "Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm." Journal of computing and information technology 22, br. LISS 2013 (2014): 31-39. https://doi.org/10.2498/cit.1002276
Harvard
Wei, Y., i Zhou, L. (2014). 'Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm', Journal of computing and information technology, 22(LISS 2013), str. 31-39. https://doi.org/10.2498/cit.1002276
Vancouver
Wei Y, Zhou L. Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm. Journal of computing and information technology [Internet]. 2014 [pristupljeno 17.08.2019.];22(LISS 2013):31-39. https://doi.org/10.2498/cit.1002276
IEEE
Y. Wei i L. Zhou, "Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm", Journal of computing and information technology, vol.22, br. LISS 2013, str. 31-39, 2014. [Online]. https://doi.org/10.2498/cit.1002276

Sažetak
The objective function of the vehicle routing problem with time windows (VRPTW) considered here is to achieve the minimization of total cost in a single distribution, which includes the travel costs and the penalty coefficient of time, under the constraints of time limits, volume and capacity. There are two main lines of development in relation to the exact algorithms for the VRPTW. One is concerned with the general decomposition approach and the solution to certain dual problems associated with the VRPTW. Another, more recent direction is concerned with the analysis of the polyhedral structure of the VRPTW. The algorithm to solve this model is a new stochastic approach called Genetic Simulated Annealing Algorithm (GSAA), which added both memory function and annealing operation to the algorithm. The result was compared to the former which operated by genetic algorithm, and showed that the approach to solve the VRPTW is very competitive.

Ključne riječi
vehicle routing problem; logistics distribution center; time-window; mathematical mode; genetic simulated annealing algorithm

Hrčak ID: 129371

URI
https://hrcak.srce.hr/129371

Posjeta: 681 *