scholarly journals Solving the location problem of front distribution center for omni-channel retailing

2021 ◽  
Author(s):  
Jikai Huang ◽  
Xianliang Shi
Keyword(s):  
Location Problem ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Service Level ◽  
Distribution Center ◽  
Future Research ◽  
Fixed Cost ◽  
Future Research Directions ◽  
Fierce Competition ◽  
First Time

AbstractConsumer demand and retailing models nowadays are being upgraded more frequently. More and more retailers are switching to the Omni-channel retailing model. Choosing a reasonable location for a front distribution center (FDC) helps control an enterprise's cost and improves its service level. This is especially true in the existence of fierce competition. In this paper, two important and contradictory objectives are proposed for the first time in the FDC location problem: minimizing the distribution costs from the facility and minimizing the fixed cost of the facility's location. For these objectives, a bi-objective programming model is established by considering the factors of a facility's capacity, demand and rent fluctuation. Meanwhile, the FDC location problem has been solved by compromising programming and elite set multi-objective simulated annealing algorithm respectively. Taking the FDC locations set of an e-commerce enterprise in a region of Beijing as an empirical sample, this paper uses the above algorithms to re-plan the FDC locations of the enterprise. This algorithm provides support for retail enterprises by helping find the best FDC location. Based on the empirical results, some comments and future research directions are also proposed.

scholarly journals Research on Location of Terminal Distribution Network Based On Comprehensive Satisfaction

2020 ◽  
Vol 214 ◽  
pp. 01045
Author(s):  
Lei Zhou ◽  
Wenchuan Wang ◽  
Fachao Li
Keyword(s):  
Location Problem ◽  
Distribution Network ◽  
Weighted Average ◽  
Distribution Center ◽  
Fixed Cost ◽  
Resident Satisfaction ◽  
Network Location ◽  
Weighted Average Method ◽  
Urban Distribution ◽  
Operation Cost

The on urban terminal distribution network is the last link of urban distribution under the e-commerce environment. Under the assumption that the location of the distribution center is known, this paper studies the location problem of the terminal distribution network by considering the two goals of maximum resident satisfaction and maximum enterprise satisfaction. Among them, considering population size as the weight, it is the resident satisfaction function that constructs distance satisfaction. The enterprise satisfaction achieves the lowest cost from the perspective of fixed cost and operation cost of the end network, and then the weighted average method is used to construct the end network location model of comprehensive satisfaction. Finally, the improved immune algorithm is used to solve the model.

Fog Computing Qos Review and Open Challenges

2021 ◽  
pp. 1147-1157
Author(s):  
R. Babu ◽  
K. Jayashree ◽  
R. Abirami
Keyword(s):  
Programming Model ◽  
Fog Computing ◽  
Big Data Analytics ◽  
Security And Privacy ◽  
Computation Offloading ◽  
Future Research ◽  
Future Research Directions ◽  
Iot Devices ◽  
Research Challenge

Internet of Things (IoT) enables inters connectivity among devices and platforms. IoT devices such as sensors, or embedded systems offer computational, storage, and networking resources and the existence of these resources permits to move the execution of IoT applications to the edge of the network and it is known as fog computing. It is able to handle billions of Internet-connected devices and is well situated for real-time big data analytics and provides advantages in advertising and personal computing. The main issues in fog computing includes fog networking, QoS, interfacing and programming model, computation offloading, accounting, billing and monitoring, provisioning and resource management, security and privacy. A particular research challenge is the Quality of Service metric for fog services. Thus, this paper gives a survey of cloud computing, discusses the QoS metrics, and the future research directions in fog computing.

Design of Service Network of Huachuan Denso Co.

2011 ◽  
Vol 101-102 ◽  
pp. 352-355
Author(s):  
Qing Song Li ◽  
Li Zhi Qin ◽  
Wei Yang ◽  
Yong Hui Wang
Keyword(s):  
Location Problem ◽  
Programming Model ◽  
Control Strategies ◽  
Service Level ◽  
Spare Parts ◽  
Mixed Integer ◽  
Service Networks ◽  
Service Network ◽  
Class A ◽  
Dynamic Programming Model

Location decision of Service Networks is important for an enterprise to dominate market and to improve service level. Characteristics and the decentralized control strategies of service network were discussed for the enterprise of Denso class. A 0-1 mixed integer programming model was established for location problem of spare parts centers and solved by ILOG along with sensitivity analysis. Furthermore, a dynamic programming model was established for location problem of sales model shop and calculated by a numerical listing method.

Defining and Evaluating A Novel Penalty Model for Managing Violations in the Cloud Computing

2017 ◽  
Vol 9 (2) ◽  
pp. 36-52
Author(s):  
Adil Maarouf ◽  
Bouchra El Qacimy ◽  
Abderrahim Marzouk ◽  
Abdelkrim Haqiq
Keyword(s):  
Cloud Computing ◽  
Critical Issue ◽  
Service Level ◽  
Future Research ◽  
Calculation Methods ◽  
Research Directions ◽  
Penalty Cost ◽  
Proposed Model ◽  
Cloud Providers ◽  
Future Research Directions

Managing and applying penalties has become a critical issue for Cloud Computing. In this paper, the authors investigate this issue and present the most frequently used definitions of service level agreements (SLA) penalty functions. They identify the characteristics of these functions by highlighting their strengths and weaknesses. They survey and analyze various penalty calculation and availability calculation methods of cloud providers. Then, they propose a Novel Penalty Model for computing the penalty cost of the violations and present formalization for the penalty concerned. They also propose a business model for cloud providers to manage their profit. An example application will be presented to demonstrate the effectiveness of the proposed model. Finally, the paper notes some challenges and future research directions.

An Optimal Design for the Capacitated Hub Location Problem with Asymmetric Allocation

2013 ◽  
Vol 284-287 ◽  
pp. 1203-1207
Author(s):  
Ji Ung Sun
Keyword(s):  
Solution Method ◽  
Location Problem ◽  
Programming Model ◽  
Service Level ◽  
Transportation Costs ◽  
Ant Colony Optimization Algorithm ◽  
Hub Location ◽  
Hub Location Problem ◽  
Hub And Spoke ◽  
Pass Through

Hub and Spoke (H&S) network reflecting the scale economies through consolidation and a large amount of freight transportation is widely used to reduce total transportation costs. H&S network has transportation routes that go to the final delivery point pass through hub linking destination from hub linking origin. In this paper we present a 0-1 integer programming model and a solution method for the capacitated asymmetric allocation hub location problem (CAAHLP). We determine the number of hubs, the locations of hubs, and asymmetric allocation of non-hub nodes to hub with the objective of minimum total transportation costs satisfying the required service level. As the CAAHLP has impractically demanding for the large sized problem, we develop a solution method based on ant colony optimization algorithm. We investigate performance of the proposed solution method through the comparative study. The experimental results show that the newly proposed asymmetrically allocated network can provide better solution than the singly allocated network in terms of cost and service level.

Fog Computing Qos Review and Open Challenges

2018 ◽  
Vol 1 (2) ◽  
pp. 109-118 ◽  
Author(s):  
R. Babu ◽  
K. Jayashree ◽  
R. Abirami
Keyword(s):  
Programming Model ◽  
Fog Computing ◽  
Big Data Analytics ◽  
Security And Privacy ◽  
Computation Offloading ◽  
Future Research ◽  
Future Research Directions ◽  
Iot Devices ◽  
Research Challenge

Internet of Things (IoT) enables inters connectivity among devices and platforms. IoT devices such as sensors, or embedded systems offer computational, storage, and networking resources and the existence of these resources permits to move the execution of IoT applications to the edge of the network and it is known as fog computing. It is able to handle billions of Internet-connected devices and is well situated for real-time big data analytics and provides advantages in advertising and personal computing. The main issues in fog computing includes fog networking, QoS, interfacing and programming model, computation offloading, accounting, billing and monitoring, provisioning and resource management, security and privacy. A particular research challenge is the Quality of Service metric for fog services. Thus, this paper gives a survey of cloud computing, discusses the QoS metrics, and the future research directions in fog computing.

A genetic algorithm for supermarket location problem

2015 ◽  
Vol 35 (1) ◽  
pp. 122-127 ◽  
Author(s):  
Mohammed Alnahhal ◽  
Bernd Noche
Keyword(s):  
Genetic Algorithm ◽  
Mixed Model ◽  
Location Problem ◽  
Programming Model ◽  
Fixed Costs ◽  
Assembly Lines ◽  
Content Type ◽  
Mixed Model Assembly Lines ◽  
Mutation Operators ◽  
First Time

Purpose – This purpose of this paper is to investigate the location problem of supermarkets, feeding by material the mixed model assembly lines using tow trains. It determines the number and the locations of these supermarkets to minimize transportation and inventory fixed costs of the system. Design/methodology/approach – This is done using integer programming model and real genetic algorithm (RGA) in which custom chromosomes representation, two custom mating and two custom mutation operators were proposed. Findings – The performance of RGA is very good since it gives results that are very close or identical to the optimal ones in reasonable CPU time. Research limitations/implications – The study is applicable only if a group of supermarkets feed the same assembly line. Originality/value – For the first time in supermarket location problem, limitation on availability of some areas for possible supermarkets ' locations and capacity of the supermarkets were taken into consideration.

scholarly journals Review of the quality of service scheduling mechanisms in cloud

2018 ◽  
Vol 7 (3) ◽  
pp. 1677 ◽  
Author(s):  
K R RemeshBabu ◽  
Philip Samuel
Keyword(s):  
Cloud Computing ◽  
Large Scale ◽  
Service Level Agreement ◽  
Scheduling Algorithms ◽  
Service Level ◽  
Future Research ◽  
Efficient Management ◽  
Future Research Directions ◽  
Scheduling Mechanisms

Cloud computing provides on demand access to a large pool of heterogeneous computational and storage resources to users over the internet. Optimal scheduling mechanisms are needed for the efficient management of these heterogeneous resources. The optimal scheduler can improve the Quality of Services (QoS) as well as maintaining efficiency and fairness among these tasks. In large scale distributed systems, the performance of these scheduling algorithms is crucial for better efficiency. Now the cloud customers are charged based upon the amount of resources they are consumed or held in reserve. Comparing these scheduling algorithms from different perspectives is needed for further improvement. This paper provides a comparative study about different resource allocation, load balancing and virtual machine consolidation algorithms in cloud computing. These algorithms have been evaluated in terms of their ability to provide QoS for the tasks and Service Level Agreement (SLA) guarantee amongst the jobs served. This study identifies current and future research directions in this area for QoS enabled cloud scheduling.  

scholarly journals The Integration of Lean and Resilience Paradigms: A Systematic Review Identifying Current and Future Research Directions

2021 ◽  
Vol 13 (16) ◽  
pp. 8893
Author(s):  
Mahyar Habibi Rad ◽  
Mohammad Mojtahedi ◽  
Michael J. Ostwald
Keyword(s):  
Conceptual Development ◽  
Concept Map ◽  
Future Research ◽  
Research Directions ◽  
Outcome Framework ◽  
Future Research Directions ◽  
Research Questions ◽  
Industry Sectors ◽  
First Time ◽  
Intervention Mechanism

Integration of the lean and resilience paradigms has attracted increasing attention among scientists and practitioners. In an interconnected world, the need to be resilient involves increased readiness to deal with risks from both outside and inside an enterprise, and to be lean involves maximizing value while minimizing waste. The combination of these requirements has been the catalyst for a move towards lean–resilience operations. To better understand this trend, which seeks to help firms retain a competitive position and survive disruptions, this paper provides a systematic literature review of 53 articles identified through the C-I-M-O (context-intervention-mechanism-outcome) framework and examines them using descriptive and content analysis. The results trace the growth of lean–resilience research from its infancy to its current advanced state. This paper also identifies for the first time the lack of structured research on the number and categories of implemented practices and their associated benefits. To address this deficiency, a concept map is developed to provide guidance on the topic, identify gaps and inconsistencies in the literature, understand the state of development and suggest future research directions. The results are used to identify four dominant streams: application, compatibility, integration, and impact assessment in the context of the supply chain, conceptual development and operational research of various organizational and industry sectors. Further topics for investigation are recommended in the form of research questions. The proposed concept map is intended to assist researchers and practitioners to develop knowledge about the integration of lean and resilience paradigms in new contexts and formulate more effective deployment strategies.

Sign in / Sign up

Export Citation Format

Share Document