scholarly journals Corrigendum to “Combining Facility Location and Routing Decisions in Sustainable Urban Freight Distribution under Horizontal Collaboration: How Can Shippers Be Benefited?”

2021 ◽  
Vol 2021 ◽  
pp. 1-2
Author(s):  
Hanan Ouhader ◽  
Malika El Kyal
Keyword(s):  
Facility Location ◽  
Urban Freight ◽  
Horizontal Collaboration

scholarly journals Combining Facility Location and Routing Decisions in Sustainable Urban Freight Distribution under Horizontal Collaboration: How Can Shippers Be Benefited?

2017 ◽  
Vol 2017 ◽  
pp. 1-18 ◽  
Author(s):  
Hanan Ouhader ◽  
Malika El Kyal
Keyword(s):  
Co2 Emissions ◽  
Social Impact ◽  
Transportation Cost ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Urban Freight ◽  
Location Routing ◽  
Load Rate ◽  
Operational Decision Making ◽  
Horizontal Collaboration

This article investigates the potential economic, environmental, and social effects of combining depot location and vehicle routing decisions in urban road freight transportation under horizontal collaboration. We consider a city in which several suppliers decide to joint deliveries to their customers and goods are delivered via intermediate depots. We study a transportation optimization problem from the perspective of sustainability development. This quantitative approach is based on three-objective mathematical model for strategic, tactical, and operational decision-making as a two-echelon location routing problem (2E-LRP). The objectives are to minimize cost and CO2 emissions of the transportation and maximize the created job opportunities. The model was solved with the ε-constraint method using extended known instances reflecting the real distribution in urban area to evaluate several goods’ delivery strategies. The obtained results by comparing collaborative and noncollaborative scenarios show that collaboration leads to a reduction in CO2 emissions, transportation cost, used vehicles, and travelled distances in addition to the improvement of the vehicles load rate but collaboration affects negatively social impact. To evaluate the effect of the method used to allocate the total gains to the different partners, we suggest to decision makers a comparison between well-known allocation methods.

NUMERICAL STUDY OF PRODUCTION, LOGISTICS AND FACILITY LOCATION PLANNING FOR OIL PALM IN BIO-DIESEL PRODUCTION FOR THAILAND

2013 ◽  
Author(s):  
Artchapong Hassametto ◽  
Preerawadee Chaiboontun ◽  
Chattraporn Prajuabwan ◽  
Laphatrada Khammuang ◽  
Aussadavut Dumrongsiri
Keyword(s):  
Facility Location ◽  
Oil Palm ◽  
Numerical Study ◽  
Location Planning ◽  
Production Logistics ◽  
Diesel Production

Facility Location A Theoretical Approach for Flood Relief

2017 ◽  
Vol 5 (11) ◽  
pp. 83-89
Author(s):  
Vairaprakash Gurusamy ◽  
◽  
◽  
K. Nandhini
Keyword(s):  
Facility Location ◽  
Theoretical Approach

Facility Location with Joint Disruptions

2020 ◽  
Author(s):  
Vishwakant Malladi ◽  
Kumar Muthuraman
Keyword(s):  
Facility Location

Bounds on the partition dimension of convex polytopes

2020 ◽  
Vol 23 ◽  
Author(s):  
Jia-Bao Liu ◽  
Muhammad Faisal Nadeem ◽  
Mohammad Azeem
Keyword(s):  
Combinatorial Optimization ◽  
Computer Science ◽  
Facility Location ◽  
Robot Navigation ◽  
Convex Polytopes ◽  
Pharmaceutical Chemistry ◽  
Resolving Set ◽  
Minimum Number ◽  
Partition Dimension ◽  
Np Problem

Aims and Objective: The idea of partition and resolving sets plays an important role in various areas of engineering, chemistry and computer science such as robot navigation, facility location, pharmaceutical chemistry, combinatorial optimization, networking, and mastermind game. Method: In a graph to obtain the exact location of a required vertex which is unique from all the vertices, several vertices are selected this is called resolving set and its generalization is called resolving partition, where selected vertices are in the form of subsets. Minimum number of partitions of the vertices into sets is called partition dimension. Results: It was proved that determining the partition dimension a graph is nondeterministic polynomial time (NP) problem. In this article, we find the partition dimension of convex polytopes and provide their bounds. Conclusion: The major contribution of this article is that, due to the complexity of computing the exact partition dimension we provides the bounds and show that all the graphs discussed in results have partition dimension either less or equals to 4, but it cannot been be greater than 4.

Sign in / Sign up

Export Citation Format

Share Document