Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ UPCommons. Portal de...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
addClaim

Optimització de xarxes de magatzems en grafs

Authors: González Sierras, Pol;

Optimització de xarxes de magatzems en grafs

Abstract

Este trabajo de máster tiene como objetivo resolver el problema de agrupación de órdenes dentro de un almacén para minimizar el coste total de las rutas. El almacén se modela mediante un grafo que representa su distribución física, y se desarrolla un sistema que determina qué órdenes deben fusionarse para obtener la mejor configuración posible. El problema se resuelve utilizando heurísticas para el cálculo de rutas individuales (problema del viajante de comercio) y un algoritmo genético para la optimización de la agrupación de órdenes. Los resultados muestran que este enfoque híbrido reduce efectivamente los costes operativos manteniendo la eficiencia computacional, lo que lo hace adecuado para aplicaciones reales de gestión de almacenes.

Aquest treball de màster té com a objectiu resoldre el problema d'agrupació d'ordres dins d'un magatzem per minimitzar el cost total de les rutes. El magatzem es modela mitjançant un graf que representa la seva distribució física, i es desenvolupa un sistema que determina quines ordres s'han de fusionar per obtenir la millor configuració possible. El problema es resol utilitzant heurístiques per al càlcul de rutes individuals (problema del viatjant de comerç) i un algoritme genètic per a l'optimització de l'agrupació d'ordres. Els resultats mostren que aquest enfocament híbrid redueix efectivament els costos operatius mantenint l'eficiència computacional, cosa que el fa adequat per a aplicacions reals de gestió de magatzems.

This master’s thesis aims to solve the order grouping problem within a warehouse to minimize the total cost of routes. The warehouse is modeled using a graph representing its physical distribution, and a system is developed to determine which orders should be merged to obtain the best possible configuration. The problem is solved using heuristics for calculating individual routes (traveling salesman problem) and a genetic algorithm for optimizing order grouping. Results show that this hybrid approach effectively reduces operational costs while maintaining computational efficiency, making it suitable for real-world warehouse management applications.

Country
Spain
Related Organizations
Keywords

optimitzation, Àrees temàtiques de la UPC::Matemàtiques i estadística, Combinatorial optimization, Grafs, Teoria de, Operations research, graph, Investigació operativa, TSP, Optimització combinatòria, Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming, Classificació AMS::90 Operations research, mathematical programming::90B Operations research and management science, Graph theory, Classificació AMS::68 Computer science::68T Artificial intelligence, genetic algorithm, heuristic, warehouse, order grouping

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green