Locating Collection and Delivery Points Using the <i>p</i>-Median Location Problem by Snežana Tadić, Mladen Krstić, Željko Stević, Miloš Veljović

“…<i>Conclusions</i>: User households can be used as CDPs to achieve various benefits. Locating CDPs, i.e., selecting households, can be solved as a <i>p</i>-median problem, using a combination of heuristic and metaheuristic algorithms. …”
Get full text

acACS: Improving the Prediction Accuracy of Protein Subcellular Locations and Protein Classification by Incorporating the Average Chemical Shifts Composition by Guo-Liang Fan, Yan-Ling Liu, Yong-Chun Zuo, Han-Xue Mei, Yi Rang, Bao-Yan Hou, Yan Zhao

“…The structure information of a protein can be represented by the average chemical shifts (ACS) composition, which has been broadly applied for enhancing the prediction accuracy in protein subcellular locations and protein classification. …”
Get full text

Facility location problem for senior centers in an upcoming super-aging society by Eun Hak Lee, Jonghwa Jeong

“…This study aims to address the facility location problem for senior centers in upcoming super-aging societies. …”
Get full text

Tabu Search Algorithm for Solving a Location-Routing-Inventory Problem by Nova Indah Saragih, Peri Turnip

“…Therefore, how to decide locations, determine vehicle routing, and control inventory optimally, or location-routing-inventory problem (LRIP), becomes an important issue to design logistics systems. …”
Get full text

A MCDM approach to the facility location selection problem of sustainable solid waste management by Pınar ÖZKURT

Get full text

A Dynamic Framework for Community-Facility Siting with Inter-Community Competition by Sisi Zhu, Haoying Han, Anran Dai

Get full text

A Multi-Strategy ALNS for the VRP with Flexible Time Windows and Delivery Locations by Xiaomei Zhang, Xinchen Dai, Ping Lou, Jianmin Hu

“…Therefore, this paper introduces a Vehicle Routing Problem with flexible time windows and delivery locations, considering customer satisfaction (VRP-CS), which considers customer satisfaction by using prospect theory from two aspects: the flexibility of delivery time and delivery locations. …”
Get full text

A distributed algorithm for solving large-scale p-median problems using expectation maximization by Harsha Gwalani, Joseph Helsing, Sultanah M. Alshammari, Chetan Tiwari, Armin R. Mikler

“…The p-median problem selects p source locations to serve n destinations such that the average distance between the destinations and corresponding sources is minimized. …”
Get full text

Average error determination in the calculation of earthquake epicenter coordinates by G. K. Aslanov, T. G. Aslanov

“…The study is aimed at determining the dependence of the average error in calculating the epicenter coordinates of an earthquake on errors in measuring the velocities of seismic waves for various methods of seismic event localization. …”
Get full text

Exploring efficiency and spatial equity trade-offs in docked bike-sharing by Yusfita Chrisnawati, Yusak O. Susilo

“…These inputs are applied to the maximal covering location problem to create a comprehensive framework that evaluates interactions between spatial configurations, station size, scale, and design variables while examining trade-offs between efficiency and equity objectives. …”
Get full text

The Hybrid Taguchi-Genetic Algorithm for Mobile Location by Chien-Sheng Chen, Jium-Ming Lin, Chin-Tan Lee, Chyuan-Der Lu

“…To estimate the mobile location is an important topic in wireless communication. …”
Get full text

AUTOREGRESSIVE INTEGRATED MOVING AVERAGE FOR COCOA PRODUCTION IN SULAWESI ISLAND 2021-2030 by Nixia Tenriawaru, Achmad Amiruddin, Muhammad Arsyad, Mahyuddin Mahyuddin, N Kharisma, Fengying Nie, Muhammad Ridwan

“…At the moment this Indonesia's position is ranked third highest, however with problems production faced _ of course just rating this could shift to down, though riches nature and location geographical very support cultivation. …”
Get full text

A Capacitated Location-Inventory Model with Demand Selection by Zhengyi Li, Jiangtao Hai

“…In this paper, we consider an integrated supply chain network design problem, which incorporates inventory and pricing decisions into the capacitated facility location model. …”
Get full text

Optimal surveillance against foot-and-mouth disease: A sample average approximation approach. by Tom Kompas, Pham Van Ha, Hoa-Thi-Minh Nguyen, Graeme Garner, Sharon Roche, Iain East

“…This paper focuses on the case of finding the optimal level of surveillance against a highly infectious animal disease where time, space and randomness are fully considered. We apply the Sample Average Approximation approach to solve our problem, and to control model dimension, we propose the use of an infection tree model, in combination with sensible 'tree-pruning' and parallel processing techniques. …”
Get full text

Location of Al and Si atoms in substituted boron carbide by V. V. Garbuz, V. A. Sydorenchuk, V. B. Muratov, L. N. Kuzmenko, A. A. Vasiliev, P. V. Mazur, M. V. Karpets, T. V. Khomko, T. A. Silinska, T. N. Terentyeva, L. O. Romanova

Get full text

Uncertainty of industrial noise measurement at distant locations from the source by Tadeusz Wszołek

Get full text

OS-PSO: A Modified Ratio of Exponentially Weighted Averages-Based Optical and SAR Image Registration by Hui Zhang, Yu Song, Jingfang Hu, Yansheng Li, Yang Li, Guowei Gao

“…Immediately after that, the gradient location orientation histogram (GLOH) method is adopted to construct the feature descriptors. …”
Get full text

Research on the Location-Routing Optimization of International Freight Trains Considering the Implementation of Blockchain by Zhichao Hong, Hao Shen, Wenjie Sun, Jin Zhang, Hongbin Liang, Gang Zhao

“…A bi-objective location-routing optimization model is constructed to optimize problems, such as the location of the assembly center, route of freight assembly, frequency of international freight trains, and number of formations. …”
Get full text

Spectral clustering and embedding-enhanced POI recommendation in location-based social network by Zhen LIU, Na’na WANG, Xiaodong WANG, Yongqi SUN

Get full text

Location privacy protection method based on lightweight K-anonymity incremental nearest neighbor algorithm by Saite CHEN, Weihai LI, Yuanzhi YAO, Nenghai YU

“…The use of location-based service brings convenience to people’s daily lives, but it also raises concerns about users’ location privacy.In the k-nearest neighbor query problem, constructing K-anonymizing spatial regions is a method used to protects users’ location privacy, but it results in a large waste of communication overhead.The SpaceTwist scheme is an alternative method that uses an anchor point instead of the real location to complete the k-nearest neighbor query,which is simple to implement and has less waste of communication overhead.However,it cannot guarantee K-anonymous security, and the specific selection method of the anchor point is not provided.To address these shortcomings in SpaceTwist, some schemes calculate the user’s K-anonymity group by introducing a trusted anonymous server or using the way of user collaboration, and then enhance the end condition of the query algorithm to achieve K-anonymity security.Other schemes propose the anchor point optimization method based on the approximate distribution of interest points, which can further reduce the average communication overhead.A lightweight K-anonymity incremental nearest neighbor (LKINN) location privacy protection algorithm was proposed to improve SpaceTwist.LKINN used convex hull mathematical tool to calculate the key points of K-anonymity group, and proposed an anchor selection method based on it, achieving K-anonymity security with low computational and communication costs.LKINN was based on a hybrid location privacy protection architecture, making only semi-trusted security assumptions for all members of the system, which had lax security assumptions compared to some existing research schemes.Simulation results show that LKINN can prevent semi-trusted users from stealing the location privacy of normal users and has smaller query response time and communication overhead compare to some existing schemes.…”
Get full text