Search

In the recent era, the rapidly increasing trend of e-commerce business creates opportunities for logistics service providers to grow globally. With this growth, the concern regarding the implementation of sustainability in logistic networks has received attention in recent years. Thus, in this work, we have focused on the vehicle routing problem (VRP) to deliver the products in a lesser time horizon with driver safety concern considerations in business (B2B) e-commerce platforms. We proposed a sustainable logistics network that captures the complexities of suppliers, retailers, and logistics service providers. A mixed-integer nonlinear programming (MINLP) approach is applied to formulate a model to minimize total time associated with order processing, handling, packaging, shipping, and vehicle maintenance. Branch-and-bound algorithms in the LINGO optimization tool and genetic algorithm (GA) are used to solve the formulated mathematical model. The computational experiments are performed in eight different case scenarios (small-sized problem to large-sized problem) to validate the model.

The theoretical study of the use of cyano acid derivatives as electron acceptor groups in pelargonidin as a dye compound in sensitized solar cells (DSSC) was successfully carried out. Theoretical study was carried out with the purpose to determine the effect modification of the addition of cyanoacrylic benzothiadiazole, cyanoacrylate, cyanovinyl, and cyanocynamic as electron acceptors to the characteristics of pelargonidin as dye DSSC. The effect of modification is based on the parameters of bond length, spectra, molecular electron density, light harvesting efficiency (LHE), (VRP), and HOMO-LUMO energy. The molecular structure created using the Avogadro program, then optimized by DFT/TDDFT method using a base set 6.311G *. Based on the results of research on pelargonidin-benzothiadiazole cyanoacrylate is a better modification when compared with pelargonidin without modification or pelargonidin modified with other cyano acids. This modification is better modification based on parameters molecular electron density, HOMO-LUMO energy, (VRP), bond lengths, and spectra. Pelargonidin-benzothiadiazole cyanoacrylic electron density in LUMO conditions centred in benzothiadiazole cyanoacrylic, HOMO and LUMO energy of dye is -4.97856 eV & -2,56731 eV, VRP value 0.439, bond lengths 1.936 Å, and spectra at wavelength 393.14 nm & 377.09 nm. Based on the light harvesting efficiency (LHE), pelargonidin without modification is the best modification with an LHE value 0.820.

ネット通販市場の急速な拡大に伴い、宅配便の取扱い個数は増加の一途を辿っている 。このような状況の下、宅配便業界では様々な問題に直面している。近年の労働力不足 、トラック不足だけでなく、受取人不在による再配達が宅配便の配送効率を低下させる要因の 1つとなっている。宅配便各社はこれらの問題を解決すべく様々な取り組みを行っているが、根本的な解決には至っていない。本研究では、群馬県を例として、地域性を考慮した宅配便の配送効率向上に対する方策について調査し、その効果について論じるものとする。

National audience; L’utilisation de l’apprentissage automatique pour la résolution de problèmes d’optimisationcombinatoire attire l’attention des communautés de la RO et de l’apprentissage automatique.Un nouveau paradigme propose par exemple de créer des solveurs à base de réseaux de neuronesprofonds entraînés sur d’immenses bases de données d’instances à l’aide de l’apprentissage parrenforcement. Ce paradigme a été testé sur le problème du voyageur de commerce (TSP) [5, 1]et les problèmes de tournées de véhicules avec contraintes de capacité (VRP) [3, 2] ; il obtientd’assez bons résultats pour des instances de petites tailles (< 100 clients).Les modèles qui épousent ce paradigme sont aujourd’hui entraînés indépendemment pour leTSP et le VRP bien que les deux problèmes soient étroitement liés : un TSP est un VRP avecun seul tour, des clients avec une demande nulle, et une capacité infinie pour le véhicule. Dansce contexte, nous conjecturons qu’un apprentissage par transfert de connaissances du domainedu TSP au domaine du VRP pourrait apporter une plus-value pour la résolution de ce dernier :réduire les temps d’entraînement et nombre d’instances requis. A notre connaissance aucuneétude similaire n’a été faite dans le cadre du TSP et du VRP. Nos expériences préliminairesmontrent qu’entraîner un réseau de neurones à résoudre le VRP en ayant préalablement étéentraîné à résoudre le TSP offre un gain significatif en termes de vitesse d’apprentissage et delongueur de tours lorsque l’on a moins d’instances.

Submitted by Ana Maria de Sousa Rebelo (amsr@isep.ipp.pt) on 2022-02-01T11:38:25Z No. of bitstreams: 1 DM_AntonioCunha_2021_MEGI.pdf: 4151317 bytes, checksum: 2c73bfc6b473b4dfe2f800858c645bf1 (MD5) Approved for entry into archive by Ana Maria de Sousa Rebelo (amsr@isep.ipp.pt) on 2022-02-01T11:38:41Z (GMT) No. of bitstreams: 1 DM_AntonioCunha_2021_MEGI.pdf: 4151317 bytes, checksum: 2c73bfc6b473b4dfe2f800858c645bf1 (MD5) Made available in DSpace on 2022-02-01T11:38:41Z (GMT). No. of bitstreams: 1 DM_AntonioCunha_2021_MEGI.pdf: 4151317 bytes, checksum: 2c73bfc6b473b4dfe2f800858c645bf1 (MD5) Previous issue date: 2021

Περίληψη: Η συγκεκριμένη διπλωματική εργασία έχει ως αντικείμενο μελέτης το πρόβλημα Δρομολόγησης Οχημάτων με Ταυτόχρονη Διανομή και Παραλαβή Προϊόντων Κατά τη Διάρκεια της Διαδρομής (VRPSPD). Γενικά στα προβλήματα δρομολόγησής οχημάτων (VRP) ο κύριος στόχος είναι να ελαχιστοποιηθεί το κόστος (εξυπηρέτησης των πελατών ή μεταφοράς των προϊόντων ή διανομής ή παραλαβής των προϊόντων). Στο πρόβλημα της παρούσας εργασίας για το (VRPSPD), ένας πελάτης μπορεί να έχει την απαίτηση να του διανεμηθούν προϊόντα από την αποθήκη αλλά και να παραδώσει στο όχημα προϊόντα που θέλει να μεταφερθούν στην αποθήκη. Στη συνέχεια κατασκευάζεται αλγόριθμος για την επίλυση του παραπάνω προβλήματος. Αρχικά μέσω του αλγορίθμου των εξοικονομήσεων Clarke & Wright υπολογίζονται οι εξοικονομήσεις των πελατών και στη συνέχεια δημιουργούνται οι διαδρομές βάσει των καλύτερων εξοικονομήσεων. Οι διαδρομές που προκύπτουν με τη παραπάνω μέθοδο αποτελούν τις αρχικές μας λύσεις για το πρόβλημα. Στη συνέχεια αφού έχουν κατασκευαστεί οι διαδρομές-γειτονίες υλοποιείται ο αλγόριθμος Μεταβλητής Γειτονίας Αναζήτησης (VNS), στον οποίο εφαρμόζονται διαφορετικοί μέθοδοι τοπικής αναζήτησης o 1-1 exchange, o 1-0 relocate και ο 2-opt. Η εκμετάλλευση αυτού του γεγονότος μπορεί να οδηγήσουν σε διαφορετικά τοπικά βέλτιστα. Τέλος, υλοποιούμε τον αλγόριθμο σε 18 προβλήματα και συγκρίνουμε τα αποτελέσματα μας με τα βέλτιστα αυτών των παραδειγμάτων. Ο αλγόριθμος υλοποιείται στo προγραμματιστικό περιβάλλον MATLAB.

International audience; The aim of this study is to develop a solution to the problem of distribution of goods proposed by the Mathematical Competitive Game 2017-2018, jointly organized by the French Federation of Mathematical Games and Mathematical Modelling Company. Referred to as a productioninventory-distribution-routing problem (PIDRP), it is an NP-hard combinatorial optimization problem, which received the least attention in the literature. The research is quantitative model-based and combines exact and heuristic methods to propose a multiple-phase resolution approach to PIDRP. The results show that the use of clusters ensures practical operational aspects and provides good feasible solutions for the PIDRP in short and longterm planning. The theoretical contribution of this study lies in the PIDRP modeling strategy, and the practical contribution consists in solving a reallife PIDRP-based using optimization techniques.

The growing demand for logistics services for deliveries, collections, or home health services, have significantly increased. However, there is a need to have a technologically innovative information system for digitizing data in the operational logistics of these services, required for an increasingly better vehicle route planning. Unsurprisingly, for many years, there has been an increasing and steady growth in the interest and development of optimization tools to solve real-world problems, namely in the logistic domain. The evolution and support of computational power and the fact that advances in optimization solvers have allowed many of them to be developed as free or open-source software, to the detriment of some classic numerical calculation software. The main issue arises in the dynamic search for solutions obtained by open-source solvers and how they can be useful in solving complex combinatorial problems in real life, such as the optimal allocation of routes in logistics planning services. This work proposes an application that integrates the Google OR-Tools software and the Google Maps and Distance Matrix API. The approach developed in this work uses a VRP mathematical model to minimize the maximum route (considering as objective function the time or the distance) and provide a workload balancing, with the use of a cloud application to reduce costs and an online map service. Experimental results were obtained on simulated VRP instances in the district of Porto, where the quality of the computational solution is analyzed for training and easy usability in logistics problems. info:eu-repo/semantics/publishedVersion

Trabajo de investigación Con el presente trabajo de investigación se trae a colación, cómo se puede llegar a evaluar la viabilidad del aprovechamiento de la energía disipada en las redes de abastecimiento de agua potable en los distritos de Belén, La Guaca, Santander, San Eusebio, Montevideo, Modelia y Transito Oriental; de la zona 3 del acueducto de Bogotá. Lo anterior a través de la modelación hidráulica de la red aunado con dispositivos PAT, bombas funcionando como turbinas, por sus siglas en inglés. Pregrado Ingeniero Civil INTRODUCCIÓN 1. ANTECEDENTES Y JUSTIFICACIÓN 2 PLANTEAMIENTO Y FORMULACIÓN DEL PROBLEMA 3 MARCO DE REFERENCIA 4 ESTADO DEL ARTE 5 OBJETIVOS 6 METODOLOGÍA 7 ZONA DE ESTUDIO 8 MODELACIÓN DE LOS DISTRITOS EN EPANET 9 DIAGNÓSTICO PRELIMINAR DE LOS DISTRITOS 10 ANÁLISIS ENERGÉTICO DEL SISTEMA 11 MODELACIÓN DE DATOS OBTENIDOS PARA INTRODUCIR UNA PAT EN EPANET 12 DISCUSIÓN DE RESULTADOS OBTENIDOS 13 CONCLUSIONES 14 BIBLIOGRAFÍA ANEXOS

Una compañia colombiana quiere mejorar el proceso de entrega de pedidos a clientes, y para ello desea abrir nuevos depositos en la ciudad. La compañia necesita un algoritmo que permita ubicar las bodegas, teniendo en cuenta minimizar la distancia de las rutas que saldran de cada bodega. A Colombian company wants to improve the delivery process, and for this they want to open new warehouses in a city they operate in. The company needs an algorithm that allows locating the warehouses, taking into account minimizing the distance of the routes that will leave each warehouse. Magíster en Ingeniería Industrial Maestría

Podemos definir ride-pooling como el servicio de movilidad en el cual varios pasajeros comparten un conductor profesional. El objetivo de ride-pooling es proporcionar una solución que permita reducir el coste económico de los viajes (menos viajes con más pasajeros), tratar de minimizar los viajes en vacío (trayectos sin pasajero) y de ese modo ayudar a lograr ciudades más sostenibles medioambientalmente y con menos coches. El trabajo se centra el desarrollo de una solución tecnológica que permita obtener rutas de transporte óptimas mediante la agrupación de usuarios. El problema que se trata de abordar es una especialización de VPR o problema de enrutamiento de vehículos. Para lograr el objetivo el trabajo contextualiza e investiga el problema para abordar finalmente de forma iterativa e incremental la construcción en lenguaje Go de un servicio de optimización de rutas para ride-pooling. Para ello, se apoya en la implementación de un algoritmo heurístico que soluciona nuestro problema. El resultado del trabajo incluye como entregables un servicio funcional en forma de API HTTP que permite enviar problemas de VRP y obtener su solución de forma escalable y eficiente. Este solver permite agrupar usuarios en vehículos proporcionando como resultado rutas óptimas, tanto de forma síncrona como asíncrona, atendiendo a las restricciones del problema. We can define ride-pooling as the mobility service in which several passengers share a professional driver. The objective of ride-pooling is to provide a solution that allows to reduce the economic cost of journeys (fewer journeys with more passengers), try to minimize empty journeys (journeys without a passenger) and thus help to achieve more environmentally sustainable cities and with fewer cars. The work focuses on the development of a technological solution that allows obtaining optimal transport routes by grouping users. The problem they are trying to address is a VPR (vehicle routing problem) specialization. To achieve the objective, the work contextualizes and investigates the problem to finally approach in an iterative and incremental way the construction in Go language of a route optimization service for ride-pooling. For this, it relies on the implementation of a heuristic algorithm that solves our problem. The result of the work includes as deliverables a functional service in the form of an HTTP API that allows to send VRP problems and obtain their solution in a scalable and efficient way. This solver allows users to be grouped into vehicles, resulting in optimal routes, both synchronously and asynchronously, taking into account the constraints of the problem. Podem definir ride-pooling com el servei de mobilitat en el qual diversos passatgers comparteixen un conductor professional. L'objectiu de ride-pooling és proporcionar una solució que permeti reduir el cost econòmic dels viatges (menys viatges amb més passatgers), tractar de minimitzar els viatges en buit (trajectes sense passatger) i d'aquesta manera ajudar a aconseguir ciutats més sostenibles mediambientalment i amb menys cotxes. El treball se centra el desenvolupament d'una solució tecnològica que permeti obtenir rutes de transport òptimes mitjançant l'agrupació d'usuaris. El problema que es tracta d'abordar és una especialització de VPR o problema d'encaminament de vehicles. Per a aconseguir l'objectiu el treball contextualitza i investiga el problema per a abordar finalment de manera iterativa i incremental la construcció en llenguatge Go d'un servei d'optimització de rutes per a ride-pooling. Per a això, es recolza en la implementació d'un algorisme heurístic que soluciona el nostre problema. El resultat del treball inclou com a lliurables un servei funcional en forma de API HTTP que permet enviar problemes de VRP i obtenir la seva solució de manera escalable i eficient. Aquest solver permet agrupar usuaris en vehicles proporcionant com a resultat rutes òptimes, tant de manera síncrona com asíncrona, ateses les restriccions del problema.

Disserta??o de Mestrado em Log?stica(APNOR) apresentada na Escola Superior de Ci?ncias Empresariais do Instituto Polit?cnico de Viana do Castelo A presente proposta incide sobre o desenvolvimento de um projeto na empresa Brunswick Marine ? EMEA Operation Lda, em Vila Nova de Cerveira, que visa a otimiza??o de um circuito em round trip que permita a minimiza??o dos custos operacionais e a redu??o do impacto ambiental. Atualmente uma das maiores preocupa??es das empresas ? o custo de transporte dos seus produtos e transporte da mat?ria-prima. Aproximadamente 60% do custo com log?stica do produto terminado est? relacionado com o transporte. A Brunswick Marine ? EMEA Operation ? uma empresa do ramo naval, o seu produto final possu? caracter?stica especiais que requerem transporte especial, ou seja, necessitam de um cami?o com estrutura especial para poder transportar os barcos de recreio. Esta situa??o origina o retorno em vazio do ve?culo at? ? empresa, percurso que a empresa ter? de suportar economicamente. A empresa j? abordou diversas op??es junto de fornecedores de servi?os log?sticos (3PL) n?o obtendo solu??es positivas. O grupo Brunswick Marine EMEA possui v?rias f?bricas na Europa, sendo as mais significativas em Portugal e na Pol?nia. Entre as empresas referidas existe semanalmente um circuito, a Brunswick Marine em Portugal recebe cami?es da Pol?nia com mat?ria-prima e envia cami?es de estrutura especial com produto final. ? neste sentido que surge o projeto de otimiza??o do circuito em round trip, sendo que no contexto atual a empresa pretende adquirir um ve?culo com reduzido impacto ambiental. Numa primeira fase analisamos ?s necessidades da empresa tendo por base as caracter?sticas singulares do produto final, seguidamente estudamos as op??es existentes no mercado. Culminando na proposta de um ve?culo que permite realizar um circuito em round trip (distribuir o produto final e regressar com mat?ria-prima e n?o em vazio) movido a energia renov?vel. This proposal focuses on the development of a project at the company Brunswick Marine ? EMEA Operation, Ltd, in Vila Nova de Cerveira, which aims to optimize a Milk Run that allows the minimization of operating costs and the reduction of environmental impact. Currently, one of the biggest worries of companies is the cost of transporting their products and transporting raw materials. Approximately 60% of the logistics cost of the final product is related to transportation. Brunswick Marine - EMEA Operation, Ltd is a boatbuilding company, their final product has special characteristics that require special transport, so they need a truck with customized truck structure to be able to transport pleasure boats. This situation leads to the empty return of the vehicle to the company, the route that the company will have to bear economically. The company has already discussed several options with logistical services (3PL) without obtaining positive solutions. The Brunswick group has several factories in Europe, the most significant of which are in Portugal and Poland. Between the Brunswick Factories exist weekly truck, Brunswick Marine in Portugal receives trucks from Poland with raw material and then sends trucks of special structure with final product. In this sense, the milk run optimization project appears, and in the current context the company intends to purchase a vehicle with reduced environmental impact. In a first phase, pretends to collect an information about Brunswick needs based on the final product characteristics, then will be studied available options existing in the market. Culminating in the proposal of a vehicle that allows to make a circuit in round trip (distribute the final product and return with raw material and not empty) powered by renewable energy.

U navedenom radu opisan je problema usmjeravanja vozila sa ograničenim kapacitetom. Objašnjeni su Clarke-Wrightov algoritam, Holmes-Parkerov algoritam, Sweep algoritam i Fisher-Jaikumarov algoritam, uspoređene su njihove performanse, vizualno su demonstrirani i prikazani su detalji njihove izvedbe. The following paper deals with vehicle routing problem with capacity constraints. The problem is explained, and we present several heuristics used for finding adequate solutions to the problem. The following heuristics are explained: Clarke-Wright algorithm, Holmes-Parker algorithm, Sweep algorithm and Fisher-Jaikumar algorithm. Their performances are compared, and we show visual representation of the solutions.

Ovaj rad se bavi problemom usmjeravanja vozila i njegovim varijantama. Opis metoda i principa rješavanja problema usmjeravanja vozila. Heuristički algoritam ušteda, genetski algoritam i genetski operatori su ostvareni, isto kao i dva prikaza rješenja. Ocjena učinkovitosti ostvarenih metoda nad tri tipa instanci problema. Rezultati su prikazani grafički te su analizirani i međusobno uspoređeni. This paper deals with vehicle routing problem and its flavors. Detailed descriptions of vehicle routing problem solving methods and principles were given. Heuristic savings algorithm, genetic algorithm and genetic operators were implemented, as well as two forms of results. Efficiency evaluation of selected methods and their performance on three types of vehicle routing problem. Graphic representations of results were created and results were analysed and mutually compared.

Dissertação de Mestrado em Engenharia e Gestão Industrial apresentada à Faculdade de Ciências e Tecnologia O presente resumo presente na dissertação, apresenta-se seguidamente:Resumo..............................................................Atualmente, com a presença de mercados cada vez mais competitivos, as empresas têm virado as suas estratégias para a otimização de processos de forma a dar uma melhor resposta às exigências dos clientes. O problema de planeamento de rotas é um dos problemas que tem ganho maior destaque nesta mudança de paradigma, uma vez que através da sua resolução se podem obter ganhos bastante significativos no sentido da melhoria da utilização dos recursosNeste trabalho, desenvolveu-se uma metodologia de planeamento de rotas de um grossista farmacêutico, que alterou recentemente a localização da sua operação para novas instalações, sendo, portanto, necessário redefinir toda a sua estrutura de serviço às diferentes farmácias, partindo de instâncias reais.A metodologia proposta consiste na conjugação de métodos exatos co uma metodologia cluster first-route second para a resolução de um problema de planeamento de rotas consistente com um elevado número de clientes, restrições de janelas temporais, frota heterogénea e diferentes períodos de entrega. Desta forma, foi possível aplicar um método exato para grupos até 23 clientes, atingindo resultados com relativo baixo esforço computacionalOs resultados obtidos demonstram a potencialidade da metodologia proposta através da redução de custos operacionais ao mesmo tempo que se melhora o nível de serviço prestado. Palavras-chave: Logística, Planeamento de rotas consistente, Métodos exatos, Elevado número de clientes, The present abstract present in the dissertation, is presented below.Abstract.............................................................Currently with the presence of ever more competitive markets, companies and businesses have turned to their process optimisation procedures to try and meet the ever growing needs of their clients. The problem with planning of rotas is one of the most highlighted problems in this paradigm shift: solving this problem would allow for a greater use of resources. In this work, the development of a method for planning the rotas of a wholesale pharmacist (who has recently changed his distribution location) is key to ensuring that the distribution needs of other pharmacies are met.The methodology proposed consists of a variety of exact methods taking into account the cluster first route second to be able to solve the problem of planning rotas in a scenario where there are an elevated number of clientes in the mix, time restrictions, heterogenous routes and different delivery dates. This way it was possible to apply a method for groups of up to 23 clientes, achieving results with relatively low computacional power. The results obtained from this work show an exciting potential for the application of this method through not only the reduction of operational costs but in conjuncture vastly improving the service provided to the clientes.......................................................................................................................................................................................................................................

La generación de rutas óptimas para la distribución en las empresas se ha convertido en un eslabón muy importante dentro de su cadena logística, ya que es el proceso de entrega al cliente final, este proceso, es de vital importancia para que el cliente reciba su producto en el lugar, horario y destino acordado. Para ello las empresas se esfuerzan en generar rutas de distribución de mercancías que sean lo más dinámicas posibles, y que le permitan entregar los productos al menor tiempo posible con los mayores estándares de calidad y en el cual, el servicio al cliente sea lo más importante, ya que el personal que realiza las entregas, son la cara de la compañía, y por eso se esmeran en brindar la mejor experiencia al cliente, con el fin de mejorar y fidelizar al usuario final. Este documento presenta una propuesta para generar rutas de distribución para una empresa del sector de publicidad en el cual, la entrega se realiza con la instalación de material publicitario en las diferentes vallas seleccionadas por el cliente en las locaciones ofrecidas. Para ello se propondrá un método de ruteo que le permita la compañía optimizar las rutas rediciendo los tiempos de tránsito y aumentando la cantidad de instalaciones diarias. Usando los modelos planteados en la propuesta se espera que se aumente la capacidad de instalación de material publicitario, con el fin de mejorar el nivel de servicio al cliente, siguiendo con la mejora continua de los estándares de calidad en el proceso designados por la compañía. The generation of optimal routes for distribution in companies has become a very important link in their logistics chain, since it is the process of delivery to the end customer, this process is of vital importance for the customer to receive their product. at the agreed place, time and destination. For this, companies strive to generate merchandise distribution routes that are as dynamic as possible, and that allow them to deliver products as quickly as possible with the highest quality standards and in which customer service is the most important, since the personnel who make the deliveries are the face of the company, and for this reason they strive to provide the best customer experience, in order to improve and retain the end user. This document presents a proposal to generate distribution routes for a company in the advertising sector in which the delivery is made with the installation of advertising material in the different fences selected by the client in the locations offered. For this, a routing method will be proposed that allows the company to optimize routes by reducing transit times and increasing the number of daily installations. Using the models proposed in the proposal, it is expected that the installation capacity of advertising material will be increased, in order to improve the level of customer service, continuing with the continuous improvement of quality standards in the process designated by the company. Especialización

SyD Colombia S.A.S, es una organización que en los últimos años ha presentado un crecimiento en el número de operaciones, el cual ha venido acompañado de altos costos logísticos y problemas relacionados con el servicio al cliente debido al uso de empresas de mensajería externas para la distribución de sus productos. Para resolver esta problemática se diseñó un sistema de ruteo vehicular usando la metodología Cluster First-Route Second, en la que se realiza la formación de clústeres por medio de una adaptación del método de barrido, para luego elaborar una ruta dentro de cada uno de estos, usando un modelo matemático del Problema de Ruteo de Vehículos con Capacidad, con soporte del software de uso libre llamado “Grafos”. Finalmente, se validó el diseño propuesto con los datos de un día de operación en la empresa SyD Colombia S.A.S, donde se evalúan diferentes indicadores, los cuales son esenciales para medir la efectividad de la nueva metodología. Como resultado del diseño desarrollado, se logró una disminución del 25.08% en la distancia recorrida en comparación con la metodología actual de la empresa, acompañada de una reducción de 13.75% en los costos de fletes. Se espera que con la adaptación realizada en la etapa de clusterización, la empresa logre reducir el porcentaje de inconformidad presentado por los clientes preferenciales. SyD Colombia S.A.S, is an organization that in recent years has presented a growth in the number of its operations, which has been accompanied by high logistics costs and problems related to customer service due to the use of external courier companies for the distribution of their products. To solve this problem, a vehicle routing system was designed using the Cluster First - Route Second methodology, in which clusters are formed by adapting the Sweep Algorithm, and then a route is created within each of these, using a mathematical model of the capacitated vehicle routing problem with support from the free software called "Grafos". Finally, the proposed design was validated with data from one day of operation in the company SyD Colombia S.A.S, where different indicators are evaluated, which are essential to measure the effectiveness of the new methodology. As a result of the design developed, a 25.08% decrease in the distance traveled was achieved in comparison with the company's current methodology, accompanied by a 13.75% reduction in freight costs. It is expected that with the adaptation made in the clustering stage, the company will be able to reduce the percentage of dissatisfaction presented by preferential clients.

Decarbonisation is a major challenge for the coming decades, for all industries, including the transport sector. Battery electric vehicles are a potential solution for the transport sector to reduce its carbon impact. Asides from the question whether there is sufficient supply of electric vehicles for freight transport, it is also unclear whether battery-powered trucks meet the practical requirements, especially in terms of their driving range. To investigate this, synthetic tours were generated by solving a Vehicle Routing Problem (VRP). This also generates the fleet size and composition depending on a set of different vehicle types. The network with underlying traffic conditions comes from an publicly available transport model. The generated tours are then simulated with an open-source transport simulation (MATSim), for both diesel and battery electric vehicles (BEVs). In a sensitivity study, two different purchase prices were considered for calculating vehicle costs. The case study uses a model of the food retailing industry for the city of Berlin. 56% of the tours can be driven without recharging. When recharged one time, 90% of the tours are suitable for BEVs. The costs for transporting the goods will increase by 17 to 23% depending on the assumption for the purchase prices for the BEVs. Using a well-to-wheel calculation, the electrification of all tours leads to a reduction of greenhouse gas (GHG) emissions by 26 to 96% depending on the assumed electricity production. DFG, 398051144, Analyse von Strategien zur vollständigen Dekarbonisierung des urbanen Verkehrs

Submitted by Ana Rebelo (amsr@isep.ipp.pt) on 2021-03-30T13:53:42Z No. of bitstreams: 1 DM_DiogoRibeiro_2020_MEM.pdf: 3745389 bytes, checksum: 27fb172dcd4260030263995c8be2f413 (MD5) Approved for entry into archive by Ana Rebelo (amsr@isep.ipp.pt) on 2021-03-30T13:54:23Z (GMT) No. of bitstreams: 1 DM_DiogoRibeiro_2020_MEM.pdf: 3745389 bytes, checksum: 27fb172dcd4260030263995c8be2f413 (MD5) Made available in DSpace on 2021-03-30T13:54:23Z (GMT). No. of bitstreams: 1 DM_DiogoRibeiro_2020_MEM.pdf: 3745389 bytes, checksum: 27fb172dcd4260030263995c8be2f413 (MD5) Previous issue date: 2020

Klassische Transportprobleme kennt man aus dem Bereich der Postzustellung, der Müllentsorgung und dem Waren- und Gütertransport mittels Lastkraftwagen (LKW), Schiff oder Flugzeug. Das Ziel all dieser Herausforderungen ist es unter anderem, die Bestimmung kürzester Wege und die Generierung optimaler Rundreisen und Touren. Aufgrund des Strukturwandels und als Beitrag für den Klimaschutz werden auch landwirtschaftliche Betriebe mit diesen Problemen und Herausforderungen vermehrt konfrontiert. Daher steigt die Relevanz für optimale Lösungen in diesem Sektor. Da die Transportlogistik eine Bandbreite an Aufgaben zu erfüllen hat, liegt der Fokus dieser Arbeit auf der Bestimmung optimaler Rundreisen und Touren, angelehnt an das klassische Traveling Salesman Problem (TSP) und dem Vehicle Routing Problem (VRP). Betrachtet man eine Reihe von Tätigkeiten in der landwirtschaftlichen Urproduktion, kann man erkennen, dass oft Rundreisen und Touren bei der Bewirtschaftung der Flächen entstehen. Als anschauliche Beispiele seien hier das Mähen der Grünflächen für die Silagefutterernte und Pflanzenschutzmaßnahmen auf Wiesen und Äcker genannt. Wissenschaftler haben Methoden und Verfahren entwickelt, die jene Rundreisen- und Tourenprobleme lösen. In vielen Branchen finden diese Innovationen Anwendung, steuern den täglichen Arbeitsablauf und haben zum Ziel, die Transportkosten zu minimieren. In der Land- und Forstwirtschaft gibt es diesbezüglich kaum bzw. keine empirischen Erkenntnisse. eingereicht von Thomas Kainz, BSc Universität Linz, Diplomarbeit, 2020 (VLID)4738675

U prvom poglavlju rada predstavljen je problem usmjeravanja vozila i njegove varijante, s naglaskom na problem usmjeravanja školskog autobusa. Zatim je u drugom poglavlju definiran problem usmjeravanja školskog autobusa koji će se razmatrati i opisani su pristupi koje koriste postojeći algoritmi, a jedan od njih je i pobliže opisan. U trećem poglavlju predstavljen je razvijeni algoritam, vizualizator rješenja, i na kraju izneseni su rezultati testiranja algoritma koji su analizirani po raznim kriterijima. In the first chapter the vehicle routing problem and its variants are introduced, with an emphasis on the school bus routing problem. In the second chapter the school bus routing problem is formally defined and existing approaches are looked at, with one existing algorithm being presented. In the third chapter the developed algorithm is described, a visualization tool is showcased, and finally experimental results are presented and analyzed.

U ovom je radu obrađen problem usmjeravanja vozila. Opisane su karakteristike problema i glavne sastavnice genetskih algoritama, metode koja je korištena za rješavanje problema. Implementirano je rješenje u programskom jeziku C++, temeljeno na radnom okviru ECF. Kao genotip korištene su dvije verzije permutacije. Kvaliteta rješenja isprobana je i analizirana na 3 primjera različite dimenzije. In this paper the vehicle routing problem was discussed. The problem's characteristics were described as well as the main components and principles of genetic algorithms. A problem solution was implemented using the ECF framework and programming language C++. Two different genotypes were used and discussed. The solution's accuracy and possible upgrades were tested and discussed on three VRP examples of different complexity.

Vehicle Routing Problem (VRP) is the problem for finding optimal routes in the distribution system, and this problem needs attention because it can improve distribution performance. One of the problems in VRP is the Vehicle Routing Problem for Perishable Goods (VRPfPG). This issue addresses VRP for products that are rapidly losing quality and perishable. This paper attempts to review the Vehicle Routing Problem for Perishable Goods (VRPfPG). A systematic review has been carried out on fifty-nine (59) published papers from 2001 to March 2020. The optimization methods in this review were classified into single and multi-objective problems. In addition, the review was also conducted based on the objective function. The results show the metaheuristic algorithm to be a popular optimization method for solving single and multi-objective problems. Further, the results also show that minimizing the total cost distribution to be the objective function that was often used by researchers. Finally, future studies are suggested to explore a more comprehensive investigation in the VRPfPG.