Einloggen

Thematische Bibliographien / Picking route problem / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Picking route problem.

Zeitschriftenartikel zum Thema „Picking route problem“

Autor: Grafiati

Veröffentlicht am 29. Juni 2021

Zuletzt aktualisiert am 29. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Picking route problem" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Casarrubias-Vargas, Heriberto, Noé V´ásquez-Godínez, Maribel Chavéz-Hernández, and Gabriela Gaviño-Ortiz. "Genetic algorithms for route optimization in the picking problem." International Journal of Combinatorial Optimization Problems and Informatics 12, no. 2 (2021): 32–46. https://doi.org/10.61467/2007.1558.2021.v12i2.189.

Der volle Inhalt der Quelle

Annotation:

The picking problem is part of the item picking problem in a warehouse for a given order and is the most expensive in the process; Optimizing the item collection time is essential because it is a bottleneck in the service rate of orders fulfilled and has a significant impact on the efficiency of the supply chain. This work proposes a strategy to reduce the picking time by minimizing the route using a genetic algorithm; a comparison is performed with other heuristic strategies in warehouses with different morphologies and considering orders of different sizes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Hermanto, Koko, and Tita Dwi Ermayanti. "Analisa Optimasi Rute Transportasi Antar Jemput Siswa Menggunakan Model CGVRP dan Algoritma Dijkstra di SDIT Darus Sunnah." Unisda Journal of Mathematics and Computer Science (UJMC) 5, no. 2 (2019): 19–28. http://dx.doi.org/10.52166/ujmc.v5i2.1653.

Der volle Inhalt der Quelle

Annotation:

School transportation is one of the facilities provided by the school in the process of picking up students. In the process of picking up, taking the optimal route is needed to save costs and time. The purpose of this study is to develop a model School transportation routes using the Clustered Generalized Vehicle Routing Problem (CGVRP ) model and the Dijkstra algorithm to get a more optimal route from the route that has been used. Furthermore, comparing the real distance from the shuttle transportation routes with the distance from the results of this case study using the CGVRP model and the

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Wang, Pei Guang, Xing Min Qi, Xiao Ping Zong, and Ling Ling Zhu. "Picking Route Optimization of Automated Warehouse Based on Improved Genetic Algorithms." Applied Mechanics and Materials 411-414 (September 2013): 2694–97. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.2694.

Der volle Inhalt der Quelle

Annotation:

In order to improve the efficiency of automated warehouse, the order-picking task of the fixed shelve was researched and analysed. The picking mathematical model of automated warehouse was established and attributed to the classical traveling salesman problem (TSP) model. At the same time, using an improved genetic algorithms(improved GAs) solved the optimization problem. Firstly, the initial population of the algorithm was optimized, and then a 'reverse evolution operator' was introduced in the improved genetic algorithms because of the lack of local optimization ability of genetic algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Poere, Eirinne Carenina de, Falia Nurnabila, and Rienna Oktarina. "Re-Design Layout and Optimization of Order Picking Routes to Implement Sustainable Warehouse Management at FMCG Company’s Raw Material Warehouse." IOP Conference Series: Earth and Environmental Science 1488, no. 1 (2025): 012023. https://doi.org/10.1088/1755-1315/1488/1/012023.

Der volle Inhalt der Quelle

Annotation:

Abstract The problem at FMCG company is concentrated on waste that occurs during the internal logistics process in the raw material warehouse. The solution to the problem was solved by using the Value Stream Mapping (VSM) method, ABC Classification, and Order Picking Route Strategy. The purpose of this research is to propose a new layout and propose an optimal order picking route to reduce time, distance, material handling costs, and environmental impacts to implement sustainable warehouse management on FMCG Company. The processing results show that waste in the process of internal activities

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Guo, Jian, Li Zhou, and Jie Zhu. "Stochastic Model and Simulation Research for Random-Storage S-Type Manual Order Picking." Key Engineering Materials 467-469 (February 2011): 92–97. http://dx.doi.org/10.4028/www.scientific.net/kem.467-469.92.

Der volle Inhalt der Quelle

Annotation:

It researches the service efficient problem of logistics distribution center manual order picking, tour length and then. It builds picker route stochastic model under random storage S-type picking condition. It makes model approximation calculation with simulation result under order random arrival frequencies. It conducts well approximation between model and simulation results under the condition of permission error. It is the foundation for improving storage strategy. And it provides basic foundation for researching of picking time distribution function for manual order picking random service

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Jin, Hui, Qingsong He, Miao He, Shiqing Lu, Fangchao Hu, and Daxian Hao. "Optimization for medical logistics robot based on model of traveling salesman problems and vehicle routing problems." International Journal of Advanced Robotic Systems 18, no. 3 (2021): 172988142110225. http://dx.doi.org/10.1177/17298814211022539.

Der volle Inhalt der Quelle

Annotation:

Fast medicine dispensing system (FMDS) as a kind of medical logistic robot can dispense many drugs for one prescription at the same time. To guarantee the sustainability of drug dispensation, it is required that FMDS replenish drugs rapidly. The traditional order picking model (OPM) is difficult to meet the demand of prompt replenishment. To solve the problems of prolonged refilling route and inefficiency of drugs replenishment, a mixed refilling model based on multiple steps traveling salesman problem model (MTSPM) and vehicle routing problem model (VRPM) is proposed, and it is deployed in tw

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Wan, Fu Cai, Duo Chen, and Yong Qiang Wu. "Based on Genetic Algorithm Research of Stocker Picking Shortest Path." Applied Mechanics and Materials 155-156 (February 2012): 186–90. http://dx.doi.org/10.4028/www.scientific.net/amm.155-156.186.

Der volle Inhalt der Quelle

Annotation:

This paper analyzes characteristics of automated warehouse stocker picking operating process. Path optimization problem is considered as traveling salesman problem. The coordinates of picking points by calculating determine a stocker running route. The mathematical model of a path distance is built. And using the improved genetic algorithm solves the above problem. Finally, M-file program of stocker running path optimization is written and run in MATLAB. The simulation results that, in solving stocker path optimization problem, it can search for a shortest path by genetic algorithm. Thereby en

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Natalia, C., V. Triyanti, G. Setiawan, and M. Haryanto. "Completion of Capacitated Vehicle Routing Problem (CVRP) and Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) Using Bee Algorithm Approach to Optimize Waste Picking Transportation Problem." Journal of Modern Manufacturing Systems and Technology 5, no. 2 (2021): 69–77. http://dx.doi.org/10.15282/jmmst.v5i2.6855.

Der volle Inhalt der Quelle

Annotation:

Bee Algorithm (BA) is an algorithm that adapts the way of life of bees and their intelligence in finding food sources. This research is a combination of two projects that both use BA as the completion algorithm. BA is applied to solve CVRP and CVRPTW problems, both aim to provide effective and efficient advice solutions related to waste transportation routes of the upcoming ITF Sunter project. Using CVRP approach, the capacity of the waste transported will not exceed the capacity of the waste transport vehicle owned. Meanwhile, using CVRPTW approach, the route formed also considers the travel

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Zhang, Jin, Wenquan Li, Guoqing Wang, and Jingcai Yu. "Feasibility Study of Transferring Shared Bicycle Users with Commuting Demand to Flex-Route Transit—A Case Study of Nanjing City, China." Sustainability 13, no. 11 (2021): 6067. http://dx.doi.org/10.3390/su13116067.

Der volle Inhalt der Quelle

Annotation:

Shared bicycle users with commuting purposes generally need to take a traditional public transit and then use the shared bicycle to complete the first/last mile transport. While shared bicycle provides convenient travel for travelers, it also brings a series of problems such as disorderly parking and road occupancy. Therefore, exploring the problem of travel mode shift between shared bicycle and public transit is of significance for improving the traffic environment and increasing the sharing rate of public transit. This paper introduces the flex-route transit system and quantitatively analyze

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Wang, Hong Jun, Xiang Jun Zou, D. J. Zou, J. Liu, and Tian Hu Liu. "Study on Location Simulation for Picking Manipulator in Virtual Environment Based on Information Fusion of Multi-Sensor." Key Engineering Materials 392-394 (October 2008): 596–600. http://dx.doi.org/10.4028/www.scientific.net/kem.392-394.596.

Der volle Inhalt der Quelle

Annotation:

In picking manipulator location system, it is the key problem that the positions of obi-object and picking manipulator are exactly determined in complex environment. Based on multi-sensor information fusion method, a data fusion system of multi-sensor integrating laser-sensor for absolute location with ultrasonic-sensor for inspection impediment was presented. Firstly, data collection and fusion were implemented employing a two- level distribution system. Secondly, the method of data collection and fusion in virtual environment was discussed, and the result data could drive picking manipulator

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Bavar, Farhad, Majid Sabzehparvar, and Mona Ahmadi Rad. "Routing cross-docking depots, considering the time windows and pricing routes (case study: container transportation of Chabahar port)." Nexo Revista Científica 33, no. 02 (2020): 409–22. http://dx.doi.org/10.5377/nexo.v33i02.10780.

Der volle Inhalt der Quelle

Annotation:

In this study, we develop a model for routing cross-docking centers considering time windows and pricing routs. In this model picking and delivery in several times is permitted and each knot can be serviced by more than one vehicle. Every truck can transport one or more product, in other words, we consider compatibility between product and vehicle. This model includes two goals: reducing the total cost and reducing the cost of carrying goods (freight fare). The total cost includes the cost required to traverse between the points, the cost of traversing the routes between the central cross-dock

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Puspita, Fitri Maya, Ani Sahara Br. Simanjuntak, Rima Melati, and Sisca Octarina. "Demand robust counterpart open capacitated vehicle routing problem time windows and deadline model of garbage transportation with LINGO 13.0." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 6 (2020): 6380. http://dx.doi.org/10.11591/ijece.v10i6.pp6380-6388.

Der volle Inhalt der Quelle

Annotation:

Demand robust counterpart-open capacitated vehicle routing problem with time windows and deadline (DRC-OCVRPtw,d) model formed and explained in this paper, is the model used to find the minimum distance and the time needed for vehicles to transport garbage in Sukarami Sub-District, Palembang that consists of the time it takes for the vehicle to pass through the route. Time needed to transport garbage to the vehicle is called time windows. Combination of the thoses times is called deadline. The farther  the distance passed by vehicle and the more garbage transported, the longer the deadli

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Fitri, Maya Puspita, Sahara Br. Simanjuntak Ani, Melati Rima, and Octarina Sisca. "Demand robust counterpart open capacitated vehicle routing problem time windows and deadline model of garbage transportation with LINGO 13.0." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 5 (2020): 6380–88. https://doi.org/10.11591/ijece.v10i6.pp6380-6388.

Der volle Inhalt der Quelle

Annotation:

Demand robust counterpart-open capacitated vehicle routing problem with time windows and deadline (DRC-OCVRPtw,d) model formed and explained in this paper, is the model used to find the minimum distance and the time needed for vehicles to transport garbage in Sukarami Sub-District, Palembang that consists of the time it takes for the vehicle to pass through the route. Time needed to transport garbage to the vehicle is called time windows. Combination of the thoses times is called deadline. The farther the distance passed by vehicle and the more garbage transported, the longer the deadline is n

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Sri, Suryani Prasetiyowati, Sibaroni Yuliant, and Prabangkara Derwin. "The Prediction of Optimal Route of City Transportation Based on Passenger Occupancy using Genetic Algorithm: A Case Study in the City of Bandung." TELKOMNIKA Telecommunication, Computing, Electronics and Control 16, no. 3 (2018): 1201–7. https://doi.org/10.12928/TELKOMNIKA.v16i3.7077.

Der volle Inhalt der Quelle

Annotation:

Currently, the existence of city transport is increasingly eliminated by private vehicles such as cars and motorcycles. This situation is further exacerbated by the behavior of city transport drivers who are less discipline in driving, or in picking up and dropping off their passengers. The bad behavior is partly caused by the low level of passenger occupancy. The drivers try to search for passengers as much as possible but often ignore the traffic rules. To overcome this problem, an optimal transport route with high passenger potential is required. Therefore, this study investigated the optim

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Jin, Hui, Qingsong He, Miao He, Fangchao Hu, and Shiqing Lu. "New Method of Path Optimization for Medical Logistics Robots." Journal of Robotics and Mechatronics 33, no. 4 (2021): 944–54. http://dx.doi.org/10.20965/jrm.2021.p0944.

Der volle Inhalt der Quelle

Annotation:

The path planning problem of logistics robots is mainly subjected to the time cost of the operation of the mathematical model. To save the time of refilling process in the fast medicine dispensing system (FMDS), the optimization procedure is divided into two steps in this study. First, a new mathematical model called the multiple steps traveling salesman problem model (MTSPM) is proposed to optimize the replenishment quantity of each picking and establish picking sets. Second, an improved ant colony optimization (IACO) algorithm is employed, considering the effects of velocity, acceleration, a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Gamarra, Caio Jorge, Mauro Sampaio, and Fábio Lima. "Optimising picking operations in distribution centres: a simulation and algorithm-based approach for travel distance reduction." Engineering Management in Production and Services 16, no. 3 (2024): 98–114. http://dx.doi.org/10.2478/emj-2024-0026.

Der volle Inhalt der Quelle

Annotation:

Abstract This study examines the pivotal role of the logistics sector in corporations, particularly those with diverse product portfolios. It focuses on the time-intensive “picking” process, driven by various products and material handling requirements for order fulfilment. The research presents a methodology that combines distribution centre modelling for simulation with an optimisation algorithm to enhance operational efficiency. The goal is to determine an optimal route for product retrieval, minimising employee travel distances, using the simulated annealing algorithm. The results showcase

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Shariff, S. Sarifah Radiah, Noraimi Azlin Mohd Nordin, Mohd Omar, and Siti Suzlin Supadi. "Modelling the Inner Warehouse Shortest Route Planning using Dynamic Programming Block." Environment-Behaviour Proceedings Journal 7, SI9 (2022): 611–17. http://dx.doi.org/10.21834/ebpj.v7isi9.4314.

Der volle Inhalt der Quelle

Annotation:

Fulfilling the customer requirement has always been of utmost concern to logistics service companies, namely those providing warehouse and transportation services. In the warehouse, inner transportation problem affects its performance. Order picker problem is one of the problems that involves the transportation problem within the warehouse. The problem can be handled properly by having proper storage assignment, proper tasking allocation and optimal routing for inner warehouse vehicles’ movement. This study proposed a modified Dynamic Programming model to determine the shortest route for the o

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Vodovozov, Valery, Madis Lehtla, Zoja Raud, Natalia Semjonova, and Eduard Petlenkov. "Managing Energy Consumption of Linear Delta Robots Using Neural Network Models." Energies 17, no. 16 (2024): 4081. http://dx.doi.org/10.3390/en17164081.

Der volle Inhalt der Quelle

Annotation:

A new approach to managing linear Delta robots is developed and two problems of their energy-efficient operation are solved in this work based on neural network models. The first solution concentrates on the minimization of the power consumed by the robot at various tool positions as a function of joint configurations. This problem is actually faced in industrial processes, in which the steady-state placing and holding phases of the pick-and-place cycle continue for much more time than picking, such as quality control, welding, packaging, and wrapping. The second solution relates to searching

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Narsaiah, M. N., Chappidi Vamsi Naveen Kumar, Matta Pranay Yadav, Myadam Venkat Sai, M. Shamila, and Yamini Ghildiyal. "Automatic Route Clearance for Ambulance." E3S Web of Conferences 430 (2023): 01169. http://dx.doi.org/10.1051/e3sconf/202343001169.

Der volle Inhalt der Quelle

Annotation:

For densely populated urban areas like Chennai, traffic congestion becomes a significant problem. One of the key services that is impacted by traffic bottlenecks is the ambulance service the use of “Intelligent Automatic Traffic Control for Ambulance” is suggested in this article as a means of enhancing ambulance mobility. The suggested method creates an Android application that connects the traffic signal station and the ambulance over a cloud network. Due to the traffic these days, picking up the patient from the scene of the incident and transporting him to the hospital takes a lot of time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Amine Masmoudi, Mohamed, Katarzyna Anna Kuzmicz, Erwin Pesch, Emrah Demir, and Manar Hosny. "Container truck transportation routing as a Mixed Fleet Heterogeneous Dial-a-Ride Problem." MATEC Web of Conferences 312 (2020): 02005. http://dx.doi.org/10.1051/matecconf/202031202005.

Der volle Inhalt der Quelle

Annotation:

In this paper, a new variant of the Heterogeneous Dial-a-Ride Problem (HDARP) is innovatively applied to a routing problem of trucks picking up and delivering full and empty containers in the logistic chain, including container depots, importers demanding full containers and exporters requesting empty containers. On the route different types of trucks pick-up and deliver full and empty 20- and 40-foot containers. We consider trucks that are operated by alternative fuel, as well as the need for refuelling of trucks in any alternative fuel station to eliminate the risk of running out of fuel dur

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

TORAN, CHAITANYA. "AI-Powered Route Selection in Ad Hoc Wireless Networks." INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 04 (2025): 1–9. https://doi.org/10.55041/ijsrem44739.

Der volle Inhalt der Quelle

Annotation:

ABSTRACT - Ad hoc wireless networks (AHWNs) are decentralized and change without warning; therefore, selecting a good route presents a key problem. Established routing protocols battle to change to many network topology changes. They also have a hard time with diverse link conditions. In this study, we propose an AI-supported method for picking routes that uses a Random Forest Classifier (RFC) to make the best choice of paths in AHWNs. We use network graph modeling, feature extraction, and machine learning to forecast the optimal routes according to node attributes. We use NetworkX to create a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Konstantakopoulos, Grigorios D., Sotiris P. Gayialis, Evripidis P. Kechagias, Georgios A. Papadopoulos, and Ilias P. Tatsiopoulos. "Delivering and picking goods under time window restrictions: an effective evolutionary algorithm." Journal of Intelligent & Fuzzy Systems 40, no. 3 (2021): 5323–36. http://dx.doi.org/10.3233/jifs-202129.

Der volle Inhalt der Quelle

Annotation:

Routing of vehicles and scheduling of deliveries play a crucial role in logistics operations as they affect both the distribution cost and customer satisfaction. That is why researchers have intensively studied this problem in conjunction with the multiple variables and constraints involved in the logistics operations. In this paper, the cases of time windows and simultaneous pickups and deliveries, where goods are simultaneously delivered and collected from customers within a predetermined time slot, are studied. The objective of our research is to create efficient routes that minimize both t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

MITRA, SUBRATA. "AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING." Asia-Pacific Journal of Operational Research 22, no. 02 (2005): 153–69. http://dx.doi.org/10.1142/s0217595905000522.

Der volle Inhalt der Quelle

Annotation:

The Vehicle Routing Problem with Backhauling deals with the supply of finished goods from a depot to a number of delivery points, and picking up returnable items and bringing them back to the depot using a fleet of trucks. Traditionally, the objective of the problem has been to determine the truck routes such that the total number of trucks and/or the total distance traveled/total route cost are minimized. Most of the papers available in the literature in this connection deal with problems where the linehaul (having a demand for finished goods) and backhaul (having items to be returned to the

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

ROZI, SYAMSYIDA, and CUT MULTAHADAH. "RUTE TERPENDEK UNTUK PENGANGKUTAN SAMPAH DENGAN PENDEKATAN LINTASAN HAMILTON." E-Jurnal Matematika 10, no. 2 (2021): 115. http://dx.doi.org/10.24843/mtk.2021.v10.i02.p330.

Der volle Inhalt der Quelle

Annotation:

This research is related to the route of picking up the waste which done by janitors in housing complex of Aur Duri Indah Rt.14 Jambi considering the condition of that housing which have some crossroads, such that janitors take the same road twice which seems inefficient in terms of time and fuel consumption. This research is aimed to identify scientifically about the shortest and more efficient route which should be taken by janitors. This problem is considered as optimization problem through graph modelling. To check the efficient route, the existence of Hamiltonian Path of the graph is iden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Marni, Prina, Hadi Asnal, Susi Erlinda, and Agustin Agustin. "E-Travel Riau Berbasis Mobile Menggunakan Metode Dijkstra." JURNAL MEDIA INFORMATIKA BUDIDARMA 5, no. 4 (2021): 1336. http://dx.doi.org/10.30865/mib.v5i4.3261.

Der volle Inhalt der Quelle

Annotation:

Travel is one of the transportation that is often used by study tours or tourism in Riau Province. Travel is not only engaged in ordering but also in the field of delivery of goods. But what often happens to travel is that bookings are still done manually. The ordering process is carried out by telephone, then the admin records the address of the passenger to be picked up and the admin immediately confirms to the driver to pick up the passenger. The purpose of this study is to assist passengers in ordering travel online and drivers can monitor and determine the location of prospective passenge

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Wang, Yuhan, Yanshan Liao, Junhong Kang, Yu Dang, and Zixin Jiang. "Optimization of Warehouse Picking Based on TSP." Applied Science and Innovative Research 6, no. 2 (2022): p85. http://dx.doi.org/10.22158/asir.v6n2p85.

Der volle Inhalt der Quelle

Annotation:

Modern warehouse management has entered the era of information intelligence, which requires the establishment of a set of accurate, reasonable and efficient warehouse management methods, to improve the efficiency of workers. In this paper, a series of TSP (Traveling salesman problem) algorithms are used to further optimize the process efficiency of goods removal from the warehouse. Based on Freudian algorithm, the distance problem between cargo grid and recheck station was solved in the first problem. Founded on the genetic algorithm in TSP, specific application problems were solved in two, th

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Rymarczyk, Paweł, Sylwester Bogacki, Cezary Figura, Marek Rutkowski, and Piotr Staliński. "Optimizing order picking processes in warehouses: strategies for efficient routing and clustering." Journal of Modern Science 57, no. 3 (2024): 467–84. http://dx.doi.org/10.13166/jms/191201.

Der volle Inhalt der Quelle

Annotation:

The study employed a simulation based on a detailed dataset containing over 307,046 unique order identifiers and 1,050 unique product identifiers. This dataset included information such as order placement dates, product codes, quantities, and precise locations within the warehouse, including coordinates. The simulation modeled the order-picking route using the Single-Picker Routing Problem (SPRP) algorithms to minimize distance and travel time. The methods compared various wave-picking strategies and grouping methods (single-line and multi-line) for their effectiveness.The applied method signi

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Peng, Wanqing, Siqi Guo, and Haoxuan Li. "Research on Picking Route Optimization of Multi-zone Warehouse Based on Traveling Salesman Problem and Simulated Annealing Algorithm." Journal of Physics: Conference Series 1861, no. 1 (2021): 012031. http://dx.doi.org/10.1088/1742-6596/1861/1/012031.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Mohd Nordin, Noraimi Azlin, S. Sarifah Radiah Shariff, Siti Suzlin Supadi, and Yosi Pahala. "Determining the Shortest Path for Inner Warehouse Transportation." Journal of ASIAN Behavioural Studies 8, no. 25 (2023): 1–21. http://dx.doi.org/10.21834/jabs.v8i25.425.

Der volle Inhalt der Quelle

Annotation:

Always meeting customer needs is the primary goal of logistic service companies specializing in warehousing. However, warehouses are often large, and the movement of goods in the warehouse is problematic because it takes a long time and slows the order-picking process. This problem can be solved if storage assignment and the optimal warehouse movement route are appropriately planned. This study compares the use of Dynamic Programming models for two data in this warehouse in determining the shortest path for the Order Picker in completing and fulfilling customer orders. Keywords: Order picking,

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Wu, Gen-Han, Chen-Yang Cheng, and Ming-Hong Liu. "Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems." Applied Sciences 12, no. 21 (2022): 10921. http://dx.doi.org/10.3390/app122110921.

Der volle Inhalt der Quelle

Annotation:

Because of time and cost constraints, item picking plays a major role in warehouse operations. Considering diversified orders and a constant warehouse design, deciding how to combine each batch and picker route effectively is a challenge in warehouse management. In this study, we focus on the evaluation of order-batching strategies for a single picker facing multiple orders with the objective of minimizing the total traveling distance. We propose two-stage simulated annealing and variable neighborhood search algorithms to solve the combined problem. The orders are first merged into batches, fo

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Le, Thi Diem Chau, Duy Duc Nguyen, Judit Oláh, and Miklós Pakurár. "Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study." Production Engineering Archives 26, no. 4 (2020): 174–84. http://dx.doi.org/10.30657/pea.2020.26.31.

Der volle Inhalt der Quelle

Annotation:

Abstract This study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, ou

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Le, Thi Diem Chau, Duy Duc Nguyen, Judit Oláh, and Miklós Pakurár. "Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study." Production Engineering Archives 26, no. 4 (2020): 174–84. http://dx.doi.org/10.30657/pea.2020.26.31.

Der volle Inhalt der Quelle

Annotation:

AbstractThis study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Leon, Jonas F., Yuda Li, Mohammad Peyman, Laura Calvet, and Angel A. Juan. "A Discrete-Event Simheuristic for Solving a Realistic Storage Location Assignment Problem." Mathematics 11, no. 7 (2023): 1577. http://dx.doi.org/10.3390/math11071577.

Der volle Inhalt der Quelle

Annotation:

In the context of increasing complexity in manufacturing and logistic systems, the combination of optimization and simulation can be considered a versatile tool for supporting managerial decision-making. An informed storage location assignment policy is key for improving warehouse operations, which play a vital role in the efficiency of supply chains. Traditional approaches in the literature to solve the storage location assignment problem present some limitations, such as excluding the stochastic variability of processes or the interaction among different warehouse activities. This work addre

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Zhan, Yajun, and Yiping Jiang. "Integrated Optimization of Order Allocation and Last-Mile Multi-Temperature Joint Distribution for Fresh Agriproduct Community Retail." Sustainability 14, no. 15 (2022): 9790. http://dx.doi.org/10.3390/su14159790.

Der volle Inhalt der Quelle

Annotation:

Community retail is an important research issue in the field of fresh agriproduct e-commerce. This paper focuses on the problem of last-mile multi-temperature joint distribution (MTJD), which combines time coupling, order allocation, and vehicle scheduling. Firstly, according to the temperature of a refrigerated truck in multi-temperature zones, a split-order packing decision is proposed to integrate the different types of fresh agriproduct. Then, the order allocation strategy is incorporated into a comprehensive picking and distribution schedule, while taking into account the time-coupling of

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Wu, Xue, Dawei Hu, and Tianyang Gao. "Green pickup and delivery problem with private drivers for crowd-shipping distribution considering traffic congestion." International Journal of Industrial Engineering Computations 16, no. 1 (2025): 129–46. https://doi.org/10.5267/j.ijiec.2024.10.006.

Der volle Inhalt der Quelle

Annotation:

Crowd-shipping, employing private drivers to partially replace company-owned trucks in distribution, has emerged as a prominent trend for its cost-effectiveness and sustainability. While crowd-shipping is known as a distribution pattern that combines economic efficiency and environmental benefits, however, the frequent occurrence of traffic congestion has made this pattern less effective than it should be. In this research, the problem of vehicle routing optimization under traffic congestion is investigated from the perspective of simultaneously reducing environmental pollution and costs. Cons

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Fisher, Kathryn C., Pascal Haegeli, and Patrick Mair. "Impact of information presentation on interpretability of spatial hazard information: lessons from a study in avalanche safety." Natural Hazards and Earth System Sciences 21, no. 10 (2021): 3219–42. http://dx.doi.org/10.5194/nhess-21-3219-2021.

Der volle Inhalt der Quelle

Annotation:

Abstract. Avalanche warning services publish avalanche condition reports, often called avalanche bulletins, to help backcountry recreationists make informed risk management choices regarding when and where to travel in avalanche terrain. To be successful, these bulletins must be interpreted and applied by users prior to entering avalanche terrain. However, few avalanche bulletin elements have been empirically tested for their efficacy in communicating hazard information. The objective of this study is to explicitly test the effectiveness of three different graphics representing the aspect and

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Zunic, Emir, Haris Hasic, and Sead Delalic. "Strategic Approach to Implementation and Integration of Routing-Based Tasks in Warehouse Management Information Systems." International Journal of e-Education, e-Business, e-Management and e-Learning 10, no. 4 (2020): 294–311. http://dx.doi.org/10.17706/ijeeee.2020.10.4.294-311.

Der volle Inhalt der Quelle

Annotation:

One of the frequently occurring tasks during the development of warehouse management systems is the implementation of routing algorithms of some kind. Whether it is for routing workers during order picking, delivery vehicles or company representatives, this task has proven to be challenging in the technical as well as the social sense. In other words, the task is heavily dependent on various general and company-specific constraints and it directly dictates the way employees should do their job. This paper describes a strategic approach to the development and gradual integration of such algorit

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Rodrigo, Andrés Gómez-Montoya, Alberto Correa-Espinal Alexander, and Daniel Hernández-Vahos José. "Picking Routing Problem with K homogenous material handling equipment for a refrigerated warehouse." Revista Facultad de Ingeniería -redin-, no. 80 (September 15, 2016): 9–20. https://doi.org/10.17533/udea.redin.n80a02.

Der volle Inhalt der Quelle

Annotation:

This paper aims at formulating a Picking Routing Problem with K homogenous material handling equipment for a refrigerated warehouse (PRPHE). Discrete particle swarm optimization (PSO) and genetic algorithm (GA) metaheuristics are developed and validated for solving PRPHE. The discrete PSO is a novel approach to solving cold routing picking problems, which has not been detected in the scientific literature and is considered a contribution to the state of the art. The main difference between classical and discrete PSO is the structure and algebraic formulation of the positions and velocities of

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Bolaños Zuñiga, Johanna, Jania Astrid Saucedo Martínez, Tomas Eloy Salais Fierro, and José Antonio Marmolejo Saucedo. "Optimization of the Storage Location Assignment and the Picker-Routing Problem by Using Mathematical Programming." Applied Sciences 10, no. 2 (2020): 534. http://dx.doi.org/10.3390/app10020534.

Der volle Inhalt der Quelle

Annotation:

The order picking process involves a series of activities in response to customer needs, such as the selection or programming of orders (batches), and the selection of different items from their storage location to shipment. These activities are accomplished by a routing policy that determines the picker sequence for retrieving the items from the storage location. Therefore, the order picking problem has been plenty investigated; however, in previous research, the proposed models were based on demand fulfilling, putting aside factors such as the product weight—which is an important criterion—a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Denizhan, Berrin, Elif Yıldırım, and Öznur Akkan. "An Order-Picking Problem in a Medical Facility Using Genetic Algorithm." Processes 13, no. 1 (2024): 22. https://doi.org/10.3390/pr13010022.

Der volle Inhalt der Quelle

Annotation:

Storage operations, order-picking, and product-handling processes have become increasingly important in today’s industrial environment. These operations are a huge burden for businesses in terms of time and cost, but they often do not add direct value to products or services. Therefore, it has become essential to improve the storage operations to the highest quality, reduce the costs arising from storage, and increase customer satisfaction. This study compared genetic algorithm (GA) and simulated annealing (SA) methods with existing real results and operations in order to minimize the distance

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Madhani, Genta Yusuf, Iphov Kumala Sriwana, and Muhammad Nashir Ardiansyah. "Sequential model of FSN classification with ZABLS slotting and vehicle routing problem using hybridization of ant colony optimization and tabu search to reduce picking time." Journal of Industrial Engineering and Management 17, no. 3 (2024): 853. http://dx.doi.org/10.3926/jiem.7333.

Der volle Inhalt der Quelle

Annotation:

Purpose: The research purpose is to enhance picking performance by developing a hybrid algorithm that classifies SKU, determines slot, and routes the process for Delivery Order (DO).Design/methodology/approach: FSN classification is used for categorizing the products into three groups: fast-moving, slow-moving, and not-moving based on the consumption rate and average stay of each SKU. The result of classification is continued with ZABLS Slotting for product placement on warehouse shelves based on the quickest to the longest picking time on each slot. Slotting results are used for VRP addresses

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

M., Gyamfi, Samuel Kwame Amponsah Professor, Annan Jonathan, and Fianko Alexander Otchere. "Sequential Ordering Of Routes For Trucks For Efficient Garbage Collection: Case Study Of Sekondi –Takoradi Metropolitan Assembly (Stma)." American Based Research Journal 2, no. 9 (2013): 22–30. https://doi.org/10.5281/zenodo.3412180.

Der volle Inhalt der Quelle

Annotation:

<em>This research paper presents a case study of a Vehicle Routing Problem (VRP). The objective is to minimize the total lengths taken by trucks of the Waste Management Department of Sekondi-Takoradi Metropolitan Assembly in transporting solid waste from the Metropolis to the Dump Site. The problem was formulated as an Integer Programming Model and the Ant Colony Meta-heuristic for the Travelling Salesman Problem was used to obtain the optimal solution. Data on distances between potential garbage picking points were obtained, and the Cartesian coordinates of the various garbage collection poin

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Bhadrinarayanan, L. S., and C. Anand Babu. "A resins-neutralization coupled route for the treatment of stainless-steel pickling effluent: A research study." Chemical Industry and Chemical Engineering Quarterly, no. 00 (2023): 7. http://dx.doi.org/10.2298/ciceq221023007b.

Der volle Inhalt der Quelle

Annotation:

One of the major environmental problems caused by stainless-steel industries is the liquid effluents generated during the production processes. It contains a high concentration of metal ions such as Fe (III), Cr (III), Cr (VI), and Ni (II) in HF and HNO3 mixture, oil, and rinse wastewater. The used pickling waste stream has a pH of 0.5, and Total Dissolved Salts (TDS) of 520g/L with a density of 1.20g/CC. The present work focused on the recycling of pickling effluent by applying a combination of filtration, resins, and neutralization for the efficient removal of metal ions and F- greater than

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Andreatta, Giovanni, Carla De Francesco, and Luigi De Giovanni. "Algorithms for Smooth, Safe and Quick Routing on Sensor-Equipped Grid Networks." Sensors 21, no. 24 (2021): 8188. http://dx.doi.org/10.3390/s21248188.

Der volle Inhalt der Quelle

Annotation:

Automation plays an important role in modern transportation and handling systems, e.g., to control the routes of aircraft and ground service equipment in airport aprons, automated guided vehicles in port terminals or in public transportation, handling robots in automated factories, drones in warehouse picking operations, etc. Information technology provides hardware and software (e.g., collision detection sensors, routing and collision avoidance logic) that contribute to safe and efficient operations, with relevant social benefits in terms of improved system performance and reduced accident ra

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Viveros, Pablo, Katalina González, Rodrigo Mena, Fredy Kristjanpoller, and Javier Robledo. "Slotting Optimization Model for a Warehouse with Divisible First-Level Accommodation Locations." Applied Sciences 11, no. 3 (2021): 936. http://dx.doi.org/10.3390/app11030936.

Der volle Inhalt der Quelle

Annotation:

Efficiency in supply chains is critically affected by the performance of operations within warehouses. For this reason, the activities related to the disposition and management of inventories are crucial. This work addresses the multi-level storage locations assignment problem for SKU pallets, considering divisible locations in the first level to improve the picking operation and reduce the travel times associated with the routes of the cranes. A mathematical programming model is developed considering the objective of minimizing the total travel distance, and in the background, maximizing the

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Hu, Hongtao, Jiao Mo, and Chengle Ma. "Optimization of Vehicle Routing with Pickup Based on Multibatch Production." Discrete Dynamics in Nature and Society 2018 (November 1, 2018): 1–9. http://dx.doi.org/10.1155/2018/2804589.

Der volle Inhalt der Quelle

Annotation:

To reduce the inventory cost and ensure product quality while meeting the diverse demands of customers, manufacturers yield products in batches. However, the raw materials required for manufacturing need to be obtained from suppliers in advance, making it necessary to understand beforehand how to best structure the pickup routes so as to reduce the cost of picking up and stocking while also ensuring the supply of raw materials required for each batch of production. To reduce the transportation and inventory costs, therefore, this paper establishes a mixed integer programming model for the join

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Yin, Yugang, and Yahui Liu. "Quasi-Closeness: A Toolkit for Social Network Applications Involving Indirect Connections." Mathematical Problems in Engineering 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/7420281.

Der volle Inhalt der Quelle

Annotation:

We come up with a punishment in the form of exponential decay for the number of vertices that a path passes through, which is able to reconcile the contradictory effects of geodesic length and edge weights. This core thought is the key to handling three typical applications; that is, given an information demander, he may be faced with the following problems: choosing optimal route to contact the single supplier, picking out the best supplier between multiple candidates, and calculating his point centrality, which involves indirect connections. Accordingly, three concrete solutions in one logic

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Hu, Haoyuan, Ying Zhang, Jiangwen Wei, et al. "Alibaba Vehicle Routing Algorithms Enable Rapid Pick and Delivery." INFORMS Journal on Applied Analytics 52, no. 1 (2022): 27–41. http://dx.doi.org/10.1287/inte.2021.1108.

Der volle Inhalt der Quelle

Annotation:

Alibaba Group pioneered integrated online and offline retail models to allow customers to place online orders of e-commerce and grocery products at its participating stores or restaurants for rapid delivery—in some cases, in as little as 30 minutes after an order has been placed. To meet these service commitments, quick online routing decisions must be made to optimize order picking routes at warehouses and delivery routes for drivers. The solutions to these routing problems are complicated by stringent service commitments, uncertainties, and complex operations in warehouses with limited space

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Safa, Gharbi, Hayfa ZGAYA, and Slim HAMMADI. "Alliance between agents and optimization in warehouse logistics." INTERNATIONAL JOURNAL OF MANAGEMENT & INFORMATION TECHNOLOGY 8, no. 3 (2014): 1372–91. http://dx.doi.org/10.24297/ijmit.v8i3.1951.

Der volle Inhalt der Quelle

Annotation:

Nowadays, logistics has become an important part in the supply chain due to the effects of globalization. A warehouse is a large building where goods are stored, and where they may be shipped, catalogued, or received. When considering the level of effort involved in warehouse operations, the greatest expenditure of effort is in the picking process. In warehouse, the major goal is to improve the efficiency, accurancy and safety of warehouse operations. Supply chain managers focus to gain maximum efficiency for minimum cost. Therefore, Warehouse Management Systemd (WMS) first appeared on the mar

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Kraska, Tim, Tianyu Li, Samuel Madden, et al. "Check Out the Big Brain on BRAD: Simplifying Cloud Data Processing with Learned Automated Data Meshes." Proceedings of the VLDB Endowment 16, no. 11 (2023): 3293–301. http://dx.doi.org/10.14778/3611479.3611526.

Der volle Inhalt der Quelle

Annotation:

The last decade of database research has led to the prevalence of specialized systems for different workloads. Consequently, organizations often rely on a combination of specialized systems, organized in a Data Mesh. Data meshes present significant challenges for system administrators, including picking the right system for each workload, moving data between systems, maintaining consistency, and correctly configuring each system. Many non-expert end users (e.g., data analysts or app developers) either cannot solve their business problems, or suffer from sub-optimal performance or cost due to t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!