Floyd-Warshall ve Karınca Kolonisi Optimizasyonu Algoritmaları ile Depo Rota Planlaması

Amaç: Bu çalışmada, depo rota planlama problemleri için tam ve bütünleşik bir çözüm yaklaşımı önerilmektedir. Yöntem: Önerilen çözüm yaklaşımına göre, öncelikle depoda ziyaret edilmesi gereken noktaların bazılarını temsil eden bir ağ gösterimi oluşturulmaktadır. Daha sonra, her turda bir gezgin satıcı problemi oluşturmak ve söz konusu ağ yapısının ilgili düğümler arasındaki en kısa yolların belirlenmesi için Floyd-Warshall algoritması kullanılmaktadır. Son olarak, aracın toplam seyahat mesafesini minimize ederek ilgili gezgin satıcı probleminin çözümünü sağlamak için karınca kolonisi optimizasyonu algoritması kullanılmaktadır. Bulgular: Önerilen çözüm yaklaşımının performansını göstermek için çeşitli veri kümeleri ile hesaplamalı deneyler gerçekleştirilmiştir. Sonuçların oldukça tatmin edici olduğu ve önerilen çözüm metodolojisinin depo rota planlamasında önemli faydalar sağlayabileceği gözlemlenmiştir. Özgünlük: Çalışmanın en önemli katkısını, depo rota planlama problemi için Floyd-Warshall algoritması ile karınca kolonisi optimizasyonu algoritmasını bir arada kullanan esnek bir çözüm yaklaşımı çerçevesi sunulması oluşturmaktadır.

• Publication year

  2025

• Venue

  Verimlilik Dergisi

• Publication date

  2025-04-16

• Fields of study

  Not labeled

• Identifiers
  DOI 10.51551/verimlilik.1539618
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals

  2024cited by this paper
• Joint green dynamic order batching and picker routing problem using PSO with global worst experience

  2024cited by this paper
• An adaptive large neighborhood search for the order picking process: the case of a retail distribution company in Italy

  2023cited by this paper
• A memetic algorithm with fuzzy-based population control for the joint order batching and picker routing problem

  2023cited by this paper
• Enhance picking viability in E-commerce warehouses under pandemic

  2022cited by this paper
• A bi-level memetic algorithm for the integrated order and vehicle scheduling in a RMFS

  2022cited by this paper
• Wave order picking under the mixed-shelves storage strategy: A solution method and advantages

  2022cited by this paper
• Solving the picker routing problem in multi-block high-level storage systems using metaheuristics

  2022cited by this paper
• Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders

  2021cited by this paper
• A method for efficiently routing order pickers in the leaf warehouse

  2021cited by this paper
• A computational software system to design order picking warehouses

  2021cited by this paper
• A heuristic approach for the online order batching problem with multiple pickers

  2021cited by this paper
• The joint order batching and picker routing problem: Modelled and solved as a clustered vehicle routing problem

  2021cited by this paper
• Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses

  2021cited by this paper
• Optimal order picker routing in a conventional warehouse with two blocks and arbitrary starting and ending points of a tour

  2020cited by this paper
• Ant Colony Optimization

  2020cited by this paper
• Genetic algorithm based approaches to solve the order batching problem and a case study in a distribution center

  2020cited by this paper
• Integrating storage location and order picking problems in warehouse planning

  2020cited by this paper
• A hybrid artificial neural network, genetic algorithm and column generation heuristic for minimizing makespan in manual order picking operations

  2020cited by this paper
• Robust possibilistic programming for joint order batching and picker routing problem in warehouse management

  2020cited by this paper
• A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses

  2020cited by this paper
• Designing efficient order picking systems: The effect of real-life features on the relationship among planning problems

  2019cited by this paper
• Vertical Lift Modules for small items order picking: an economic evaluation

  2019cited by this paper
• Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse

  2019cited by this paper
• The online integrated order picking and delivery considering Pickers’ learning effects for an O2O community supermarket

  2019cited by this paper
• Multi-dock unit-load warehouse designs with a cross-aisle

  2019cited by this paper
• Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems

  2019cited by this paper
• Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic

  2018cited by this paper
• An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses

  2017cited by this paper
• A new mathematical programming formulation for the Single-Picker Routing Problem

  2016cited by this paper
• An algorithm for dynamic order-picking in warehouse operations

  2016cited by this paper
• Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem

  2015cited by this paper
• Dynamic material flow control in mixed model assembly lines

  2015cited by this paper
• Part feeding at high-variant mixed-model assembly lines

  2012cited by this paper
• Optimally locating in-house logistics areas to facilitate JIT-supply of mixed-model assembly lines

  2012cited by this paper
• Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines

  2011cited by this paper
• Warehouse design: A structured approach

  2009cited by this paper
• A comparison of solution strategies for biobjective shortest path problems

  2009cited by this paper
• Packing items to feed assembly lines

  2008cited by this paper
• Designing the layout structure of manual order picking areas in warehouses

  2008cited by this paper
• Research on warehouse operation: A comprehensive review

  2007cited by this paper
• A comparison of picking, storage, and routing policies in manual order picking

  2004cited by this paper
• Routing methods for warehouses with multiple cross aisles

  2001cited by this paper
• Optimal layout in low-level picker-to-part systems

  2000cited by this paper
• Ant Algorithms for Discrete Optimization

  1999cited by this paper
• A capacitated vehicle routing problem for just-in-time delivery

  1999cited by this paper
• The impact of routing and storage policies on warehouse efficiency

  1999cited by this paper
• The effect of warehouse cross aisles on order picking efficiency

  1999cited by this paper
• Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions

  1998cited by this paper
• Routing policies and COI-based storage policies in picker-to-part systems

  1998cited by this paper
• Ant colony system: a cooperative learning approach to the traveling salesman problem

  1997cited by this paper
• An evaluation of order picking routeing policies

  1997cited by this paper
• The Ant System: Optimization by a colony of cooperating agents

  1996cited by this paper
• DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE

  1993cited by this paper
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem

  1983cited by this paper
• Algorithm 97: Shortest path

  1962cited by this paper
• A Theorem on Boolean Matrices

  1962cited by this paper

• Performance Optimization of PID Controllers for DC Machine Drives Using PSO, ACO, and Hybrid PSO-ACO Algorithms

  2025cites this paper