Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 5,313 papers for “location assignment”

Storage Location Assignment

Mostafa Bahadornia · OSF Preprints (OSF Preprints) · 2025

Generated instances and their corresponding solutions.

Cited by 0

Assignment 1: Name & Location

Cody McElhinny · 2015

Before disclosing my findings from the lists that I ultimately created, it should be known that the technology I used was rather uncooperative throughout the

Cited by 0

Current studies on storage location assignment problem

Ercan Şenyiğit · Global Journal of Business Economics and Management Current Issues · 2022

Although operations seem more important than everything in a business operation, warehouse management has great importance to the success of a business operation. Storage location assignment is very important because of the uncertainty in the number of incoming products, the necessity of answering unknown customers’ demands and the speed rate of response to customer demands. Besides, several factors affect warehouse management. Assigning products to appropriate locations is one of the most important and complex. This study aims to present recent academic works on the storage location assignment problem published from 2018 to 2021. These problems are assigned accordingly. Methods of solution, goals and some related considerations are considered while investigating the works. Recommendations are provided in the conclusion. Based on the reviewed articles, warehouse capacity, market, products, logistics resources and operational configuration are taken into account as restrictions or considerations. Keywords: Location, logistics, storage, warehouse management;

Cited by 1Open access

Dynamic Task Assignment in Crowdsensing with Location Awareness and Location Diversity

Xiong Wang, Riheng Jia, Xiaohua Tian et al. · 2018

Crowdsensing paradigm facilitates a wide range of data collection, where great efforts have been made to address its fundamental issue of matching workers to their assigned tasks. In this paper, we reexamine this issue by considering the spatiotemporal worker mobility and task arrivals, which more fits the actual situation. Specifically, we study the location-aware and location diversity based dynamic crowdsensing system, where workers move over time and tasks arrive stochastically. We first exploit offline crowdsensing by proposing a combinatorial algorithm, for efficiently distributing tasks to workers. After that, we mainly study the online crowdsensing, and further consider an indispensable aspect of worker's fair allocation. Apart from the stochastic characteristics and discontinuous coverage, the nonlinear expectation is incurred as a new challenge concerning fairness issue. Based on Lyapunov optimization with perturbation parameters, we propose online control policy to overcome those challenges. Hereby we can maintain system stability and achieve a time average sensing utility arbitrarily close to the optimum. Performance evaluation on real data set validates the proposed algorithm, where 116% gain of fairness is achieved at the expense of 12% loss of sensing value on average.

Cited by 67

Optimizing Warehouse Storage Location Assignment Under Demand Uncertainty

Nguyen Truong Thi, Phan Thi Kim Phung, Trần Thị Thắm · 2020

Assigning storage location in a warehouse has significant influences on space - consuming, storage capacity, and handling activities of goods. Therefore, in this study, storage management that integrates the determinant of production quantity is considered for a production system with multi product and multi period. A mathematical model is constructed to determine the optimal values including production quantity, inventory levels, and storage locations for goods with cost consideration. Besides that, a stochastic programming- based model is used to deal with the impact of demand uncertainty on warehouse performance over a planning period. The proposed models and solution approach are then investigated in a case study for the design of warehouse layout. Numerical results obtained from the model implementation and sensitivity analysis arrive at important practical insights. The resulting study shows that the study has a significant contribution to the effectiveness of warehouse layout.

Cited by 1

Modeling Facility Location Problems as Generalized Assignment Problems.

Ross,G. Terry, Soland,Richard M. · Defense Technical Information Center (DTIC) · 1976

A variety of facility location models are shown to be equivalent to the generalized assignment problem. These location models include the p-median problem, the capacity contrained p-median problem and plant location problems in which customer demands must be satisfied by a single source. Further, it is shown how certain configuration constraints limiting site and capacity combinations can be incorporated into these models. Computational results are presented. (Author)

Cited by 0

Quantum Optimization for Location Assignment Problem in ASSR

Khalid Satori, Nobuyuki Yoshikawa · PHM Society Asia-Pacific Conference · 2023

In an Automated Storage and Retrieval System (AS/RS), a location assignment of products is important to improve the picking efficiency. In this paper, the optimization of shelf location assignment with a quantum annealing is investigated. Product pairs are considered in order of picking frequency and are assigned to empty shelves in order of distance from an outlet. Then swapping the position of product in the pair is considered as the decision variable. This reduces the number of required qubits and guarantees the feasibility of solution. The efficiency of quantum algorithm is evaluated by comparing with mixed integer programming (MIP).

Cited by 2Open access

The storage location assignment problem: A literature review

Juan José Reyes, Elyn L. Solano‐Charris, Jairo R. Montoya‐Torres · International Journal of Industrial Engineering Computations · 2018

The storage of goods plays a crucial role in warehouse management systems. Although this operation is often considered simple, it is in fact complex, due to the volume of products, the uncertainty in demands, and the rapid customer service response that the market requires. Moreover, the optimization of logistical resources to maintain an efficient operational flow, such as the allocation of storage spaces, often requires complex decisions. In this paper, we analyze academic contributions on the storage location assignment problem published between 2005 and 2017. The literature is classified according to the solution methods, objectives, and related considerations. Suggestions are also provided for future research.

Cited by 107Open access

Location and assignment : application to content delivery networks

SEGURA, Jean-Mathieu, CHRETIENNE, Philippe · OpenGrey (Institut de l'Information Scientifique et Technique) · 2011

Sur le réseau Internet, les usagers demandent un accès de plus en plus rapide à des contenus de plus en plus volumineux. Notamment, le service de Vidéo à la Demande (VoD) voit la taille des données échangées augmenter fortement avec l'arrivée de la haute définition et des vidéos en 3D. Les réseaux physiques des fournisseurs d accès à Internet doivent ainsi sans cesse s'adapter à l'augmentation des demandes de téléchargements. La solution qui a pendant longtemps consisté à augmenter les débits en posant de nouveaux câbles connaît aujourd'hui ses limites. Une nouvelle approche efficace consiste à déployer des réseaux de distribution de contenus (CDN) qui peuvent être décrits comme un ensemble d'équipements, appelés caches, où les données sont dupliquées et stockées au plus proche des utilisateurs. Lors de la conception d'un CDN, plusieurs questions se posent quant au nombre, à la dimension et la localisation des caches, de manière à servir au mieux l'usager. En nous plaçant du point de vue d'un fournisseur d'accès à Internet, nous montrons que la conception d'un service de VoD s'inscrit dans la problématique de localisation et d'affectation de ressources en recherche opérationnelle. En particulier, nous nous intéressons à deux problèmes mêlant localisation et affectation: le problème du 2-p-Médian et le problème de Location-Dispatching. Nous montrons que, dans le cas où le réseau considéré est un arbre, le premier problème est polynomial. Nous formulons le second problème comme un programme linéaire en nombre entiers et nous proposons une étude polyédrale du polytope associé, ainsi que de nouvelles inégalités valides. A partir de cette étude, nous déduisons un algorithme de coupes et branchements pour résoudre le problème. Nous proposons également de nouvelles formulations entières de problèmes de localisation et d'affectation et nous comparons expérimentalement leurs efficacités. En conclusion nous tentons de répondre aux questions posées par la conception de CDN à partir des différentes approches étudiées dans ce document.

Cited by 0Open access

Decision Support for Storage Location Assignment in Warehousing

Snartland, Ina · Duo Research Archive (University of Oslo) · 2023

Et lager kan motta, plukke og sende hundrevis av paller hver dag. Plasseringen av hver\nvareenhet på lageret påvirker effektiviteten og kostnadene ved transporten av varene. Opp-\ngaver som mottak, innsetting, plukking og forsendelse av varer er arbeidskrevende i manuelle\nlagre og kan bli betydelig forbedret ved å optimalisere vareenhetenes lokasjon på lager. Da\ntransport utgjør over halvparten av tiden brukt på plukking av ordre, kan optimalisering av\nvareenheters lokasjon betydelig forbedre effektiviteten ved plukking av ordre. Innenfor daglig-\nvarebransen er varer utsatt for store variasjoner i etterspørsel, og den korte holdbarheten\nbringer en ekstra kompleksitet. Dette argumenterer for at lagre som opererer i denne bran-\nsjen bør tilnærme seg tildelingen av lokasjoner dynamisk for å sikre at vareenheters lokasjon\ntilpasses den varierende etterspørselen. Dette innebærer at vareenheter med høy frekvens\nskal plasseres på mer gunstige steder, som for eksempel nær mottak-/utleveringsområdet.\nArbeidere på lagre står overfor beslutninger på alle trinn i en vares forsyningskjede. For å\norganisere alle disse aktivitetene, brukes et lagerstyringssystem (WMS) for beslutningsstøtte.\nFor lagre som ikke benytter matematisk modellering for tildeling av lokasjoner, er denne\nbeslutningsstøtten avgjørende. Informasjon må presenteres for beslutningstakerne på en\nmåte som gjør det enkelt for dem å oppdage når det er behov for endring i lokasjoner. Denne\ninformasjonen må også være lett tilgjengelig gjennom WMS-funksjonalitetene.\n\nMålet med studien er å undersøke hvilken informasjon beslutningstakere på et lager trenger\nfor å kunne ta kvalitetsbeslutninger angående tildelingen av lokasjoner. Dette blir adressert\ngjennom tre forskningsspørsmål, tilnærmet gjennom en litteraturstudie og en case-studie.\nDet første spørsmålet går ut på å identifisere hvordan beslutninger angående tildeling av\nlokasjoner blir tatt i dag. Det andre utforsker hvilken informasjon som er nødvendig for\nå støtte disse beslutningene. Det tredje spørsmålet tar for seg hvordan informasjonen kan\npresenteres for å hjelpe beslutningstakerne.\n\nHovedfunnet fra studien er at litteraturen baserer seg på komplekse matematiske mod-\neller for å tildele vareenheter til lokasjoner, mens case-studien viser at det er et team av\nbeslutningstakere som vurderer tilgjengelig informasjon for å tildele vareenheter til optimale\nlokasjoner i plukk-området. Case-studien argumenterer også for at lagre i dagligvarebran-\nsjen er sterkt begrenset av produktgrupper. Hvilke produktgrupper vareenhetene på lageret\ntilhører må vurderes i hver operasjonell beslutning om tildeling av lokasjon. Denne infor-\nmasjonen bør derfor presenteres i WMS-funksjonalitetene for å øke synligheten og tilgjenge-\nligheten av informasjonen.\n\nDen viktigste begrensningen ved studien er at bare ett enkelt tilfelle har blitt undersøkt.\nResultatene er derfor vanskelige å generalisere og kan være relevante for kun dette spesi-\nfikke tilfellet. Det er imidlertid grunn til å tro at de identifiserte beslutningsområdene og\ninformasjonsbehovet for beslutningsstøtte er relevant for andre varedistribusjonssentre som\nopererer i dagligvarebransjen. Før resultatene kan implementeres, må man undersøke hvilke\ndata som er nødvendig for å presentere informasjonen fra WMS. Videre må måten infor-\nmasjonen kan presenteres gjennom dataene utforskes.

Cited by 0Open access

Storage location assignment problem in a warehouse system

Sushant Gupta. · DR-NTU (Nanyang Technological University) · 2013

In a warehouse management system, there are a large number of items that needs to be handled efficiently with an emphasis on timely execution andoptimum utilization of storage space. A mathematical model is presented that involves the use of randomized storage and class based storage policy solving the storae assignment problem by reducing the transit time. The results are analyzed with the use of two and four forklifts in a warehouse. The thesis examines the robustness of the proposed method using several case studies of different number of forklifts.

Cited by 0

Robotics assignment 2: Robotic mapping Time and location:

2015

May 27:th. Location and exact starting time will be annonced on the web page prior to the contest. Description: The task of your robot is to explore a given robot arena and generate a metric description (i.e. a map) of the arena. The arena will be in the form of a labyinth with walls of approximately 30 cm height (the walls will be of the same type as in the previous task, mine field navigation). The representation of the map should be on the form "2D occupancy grid", see references [1, 2]. The size of each grid cell should be 30x30 cm. Apart from the walls there will also be a number of (identical) objects in the arean, which the robot should try to identify (the loccation of) as well. The objects will be in the form of blank metal cylinders with the diameter of 10.5 cm and 27.0 cm height. Points will be given for each correctly identified cylinder in the map, as well as for each correctly classified grid cell (see below). The map should be coded according to the following scheme: 0=unknown, 1=free, 2=occupied, 3=object. That is, each state is associated with a number (0, 1, 2, or

Cited by 0

Constraint satisfaction for relative location assignment and scheduling

C. Alba-Pinto, B. Mesman, J. Jess · 2002

Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor implies resource constraints. Instead of random-access registers, relative location storages or rotating register files are used to exploit the available parallelism of resources by means of reducing the initiation interval in pipelined schedules. Therefore, the compiler or synthesis tool must deal with the difficult tasks of scheduling of operations and location assignment of values while respecting all the constraints including the storage file capacity. This paper presents a method that handles constraints of relative location storages during scheduling together with timing and resource constraints. The characteristics of the coloring of conflict graphs, representing the relative overlap of value instances, are analyzed in order to identify the bottlenecks for location assignment with the aim of serializing their lifetimes. This is done with pairs of loop instances of values until it can be guaranteed that all constraints will be satisfied.

Cited by 0

MARINE CORPS DUAL-MILITARY CO-LOCATION ASSIGNMENT POLICY ANALYSIS

Dixon, Sara R. · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 2024

This thesis examines the Marine Corps' dual-military co-location assignment policy, analyzing its challenges, comparing it to other military branches, and exploring alternatives to improve retention among dual-military personnel. This study uses a policy analysis framework to evaluate four policy alternatives: prioritizing co-location, introducing a dual-military program, applying a two-sided matching algorithm, and establishing an auction-based marketplace. Criteria for evaluation include budget impact, effectiveness on retention, political feasibility, and administrative feasibility subcategories. The analysis highlights that current Marine Corps policies lag other services' transparency and efficacy, as evidenced by lower co-location rates. Results suggest that implementing structured co-location prioritization or adopting data-driven matching systems could enhance alignment with Marine Corps objectives. The thesis concludes with actionable recommendations to prioritize co-location and modernize the assignment process with two-sided matching models, addressing dual-military couples' unique needs while maintaining operational readiness. These changes hold the potential to strengthen retention, improve satisfaction, and bolster the overall effectiveness of Marine Corps personnel assignment policy and processes.

Cited by 0