Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/99649
Title: Consolidation centers in city logistics: A cooperative approach based on the location routing problem
Author: Tumkur Nataraj, Sachin
Ferone, Daniele
Quintero Araújo, Carlos Leonardo
Juan Pérez, Ángel Alejandro
Festa, Paola
Keywords: Location Routing Problem
Vehicle Routing Problem
Metaheuristics
Urban Consolidation Center
Biased Randomization
Horizontal Cooperation
Issue Date: 9-Jan-2019
Publisher: International Journal of Industrial Engineering Computations
Citation: Tumkur Nataraj, Sachin, Ferone, D., Quintero Araujo, C.L., Juan, A.A. & Festa, Paola (2019). Consolidation centers in city logistics: A cooperative approach based on the location routing problem. International Journal of Industrial Engineering Computations, 10(3), 393-404. doi: 10.5267/j.ijiec.2019.1.001
Also see: https://doi.org/10.5267/j.ijiec.2019.1.001
Abstract: In the context of city logistics, freight transportation is one of the prominent causes of traffic congestion, high levels of pollution, and safety concerns. To decrease the negative impact of these issues, different methods have been traditionally implemented. On the one hand, the location of urban consolidation Centers (UCCs) near a city can be used to consolidate freight delivery services. Therefore, the number of trucks moving in urban areas can be reduced. On the other hand, Horizontal Cooperation can also help to reduce environmental impact while increasing service level. This paper combines both strategies, that is, we deal with the location of UCCs and, simultaneously, we analyze different scenarios where the players of different supply chain processes exhibit various levels of cooperation.
Language: English
URI: http://hdl.handle.net/10609/99649
ISSN: 1923-2926MIAR

1923-2934MIAR
Appears in Collections:Articles
Articles

Share:
Export:
Files in This Item:
File SizeFormat 
consolidation_centers_logistics.pdf490.24 kBAdobe PDFView/Open

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