OpenstarTs >
EUT-Periodici >
European Transport / Trasporti Europei >
European Transport / Trasporti Europei (2010) 46/XVI >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10077/6162

Title: Demand and routing models for urban goods movement simulation
Authors: Polimeni, Antonio
Russo, Francesco
Vitetta, Antonino
Keywords: City Logistics
Goods movement
Vehicle routing problem
Issue Date: 2010
Publisher: EUT Edizioni Universit√† di Trieste
Citation: Polimeni, A., Russo, F., Vitetta, A. (2010) Demand and routing models for urban goods movement simulation, European Transport \ Trasporti Europei, 46, pp. 3-23
Series/Report no.: European Transport / Trasporti Europei
46
Abstract: This paper presents a macro-architecture for simulating goods movements in an urban area. Urban goods supply is analysed when the retailer is the decision-maker and chooses to supply his/her shop. Two components are considered: demand in terms of goods supply and vehicle routing with constraints to simulate goods movements. To analyse demand we consider a multi-step model, while to analyse goods movements a Vehicle Routing Problem with Time Windows (VRPTW) is formalized. We examine the distribution process for a VRPTW in which the optimum paths between all the customers are combined to determine the best vehicle trip chain. As regard optimum path search, a multipath approach is proposed that entails the generation of more than one path between two delivery points. Some procedures (traffic assignment, real time system measurement, reverse assignment) to estimate system performance are also proposed. Finally, heuristics to solve the proposed problem are reported and their results are compared with those exact.
URI: http://hdl.handle.net/10077/6162
ISSN: 1825-3997
Appears in Collections:European Transport / Trasporti Europei (2010) 46/XVI

Files in This Item:

File Description SizeFormat
46D_PolimeniRusoVitetta.pdf268.2 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.