Abstract
Distribution of goods in urban areas are complex logistics problems. To avoid the negative impacts of trucks within cities, Urban Distribution Centers (UDC) located at the periphery allows goods delivery by smaller vehicles. The problem can be modeled as a two-echelon vehicle routing problem. Since the problem is known to be NP-hard, metaheuristics have mainly been proposed in the literature. In this paper instead a solution approach based on mathematical programming is proposed. Experiments are carried out using real data from the distribution network of a convenience store company in Bogota, Colombia. Results show the impact of analyzing different network structures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
