Route Optimization of Malatya Metropolitan Municipality Pesticide Vehicles

In today's competitive environment, businesses attach importance to transfer products, services and related information between supply and consumption points in order to meet increasing customer demands, in accordance with minimum cost, optimum route and customer satisfaction. Due to its importance in the economy, the Vehicle Routing Problem (VRP), which has been working hard on academics for the last 50 years and is a sub-topic of logistics management, constitutes a significant part of the total distribution cost in the businesses and financial expenditures are serious. In this study, VRP and Chinese Postman Problem (CPP) is introduced, optimal routes of Malatya Metropolitan Municipality pesticide vehicles is determined by using Hierholzer & Floyd Warshall Algorithms and Excel - Solver and solution is compared

A new genetic algorithm for the asymmetric traveling salesman problem

The asymmetric traveling salesman problem (ATSP) is one of the most important combinatorial optimization problems. It allows us to solve, either directly or through a transformation, many real-world problems. We present in this paper a new competitive genetic algorithm to solve this problem. This algorithm has been checked on a set of 153 benchmark instances with known optimal solution and it outperforms the results obtained with previous ATSP heuristic methods. © 2012 Elsevier Ltd. All rights reserved.This work has been partially supported by the Ministerio de Educacion y Ciencia of Spain (Project No. TIN2008-06441-C02-01).Yuichi Nagata; Soler Fernández, D. (2012). A new genetic algorithm for the asymmetric traveling salesman problem. Expert Systems with Applications. 39(10):8947-8953. https://doi.org/10.1016/j.eswa.2012.02.029S89478953391

Solving an Urban Waste Collection Problem Using Ants Heuristics

This paper describes the methodology that we have applied for the solution of an urban waste collection problem in the municipality of Sant Boi de Llobregat, within the metropolitan area of Barcelona (Spain). The basic nature of the considered problem is that of a capacitated arc routing problem, although it has several specific characteristics, mainly derived from trafic regulations. We present the model that we have built for the problem, which results after an appropriate transformation of the problem into a node routing one. We also present the ant colonies heuristics that we have used to obtain the solutions to the problem. These combine constructive methods, based on nearest neighbor and on nearest insertion, with a local search that explores various neighborhoods. The application of the proposed methods gives results that improve considerably the ones that were previously used in the municipality.Peer Reviewe

Chinese postman problem approach for a large-scale conventional rail network in Turkey

Svake se godine željezničke pruge periodički pregledavaju zbog ispitivanja stanja tračnica i osiguranja sigurnosti vlakova u Turskoj. Takvi se projekti moraju obaviti s nekoliko specijaliziranih lokomotiva i skupom opremom. Pronalaženje optimalnog puta takve lokomotive, vozeći na svim prugama, od bitne je važnosti zbog troškova i udaljenosti. U postojećoj praksi, određivanje rute tih lokomotiva uglavnom je manualno i oslanja se prvenstveno na znanje i procjenu stručnjaka. U ovom se radu za rješavanje problema usmjeravanja prometa inspekcijskom lokomotivom, predlaže "problem kineskog poštara" - Chinese Postman Problem (CPP). Cilj je minimizirati ukupnu prijeđenu udaljenost pronalaženjem najkraćeg pravca. Predloženi je model primijenjen na veliki problem u stvarnom svijetu. U usporedbi s postojećim stanjem predloženim se modelom smanjuje prijeđeni put za 20,76%.Every year, railways are inspected periodically to examine the status of rail tracks and ensure the safety of train operations of the railroad networks in Turkey. These inspection projects must be performed by several specialized machines with large and expensive equipment. Finding the optimum route of inspection machines that control through travelling all lines is critically important in terms of cost and distance. In current practice, determining the route of these machines is largerly manual and primarily relies on the knowledge and judgment of experts. This paper proposes Chinese Postman Problem (CPP) to solve the inspection machine routing problem. The objective is to minimize the total travel distance on the railroads by finding the shortest route. The proposed model is applied to a large-scale real world problem. Compared to the current practice the proposed approach significantly outperforms the reduced objective value by 20,76%

개미알고리즘을 이용한 드론의 제설 경로 최적화

학위논문(석사) -- 서울대학교대학원 : 공과대학 건설환경공학부, 2022.2. 김동규.Drones can overcome the limitation of ground vehicles by replacing the congestion time and allowing rapid service. For sudden snowfall with climate change, a quickly deployed drone can be a flexible alternative considering the deadhead route and the labor costs. The goal of this study is to optimize a drone arc routing problem (D-ARP), servicing the required roads for snow removal. A D-ARP creates computational burden especially in large network. The D-ARP has a large search space due to its exponentially increased candidate route, arc direction decision, and continuous arc space. To reduce the search space, we developed the auxiliary transformation method in ACO algorithm and adopted the random walk method. The contribution of the work is introducing a new problem and optimization approach of D-ARP in snow removal operation and reduce its search space. The optimization results confirmed that the drone travels shorter distance compared to the truck with a reduction of 5% to 22%. Furthermore, even under the length constraint model, the drone shows 4% reduction compared to the truck. The result of the test sets demonstrated that the adopted heuristic algorithm performs well in the large size networks in reasonable time. Based on the results, introducing a drone in snow removal is expected to save the operation cost in practical terms.드론은 혼잡시간대를 대체하고 빠른 서비스를 가능하게 함으로써 지상차량의 한계를 극복할 수 있다. 최근 기후변화에 따른 갑작스런 강설의 경우에, 드론과 같이 빠르게 투입할 수 있는 서비스는 운행 경로와 노동비용을 고려했을 때도 유연한 운영 옵션이 될 수 있다. 본 연구의 목적은 드론 아크 라우팅(D-ARP)을 최적화하는 것이며, 이는 제설에 필요한 도로를 서비스하는 경로를 탐색하는 것이다. 드론 아크 라우팅은 특히 큰 네트워크에서 컴퓨터 부하를 생성한다. 다시 말해D-ARP는 큰 검색공간을 필요로 하며, 이는 기하급수적으로 증가하는 후보 경로 및 호의 방향 결정 그리고 연속적인 호의 공간으로부터 기인한다. 검색공간을 줄이기 위해, 우리는 개미알고리즘에 보조변환방법을 적용하는 방안을 도입하였으며 또한 랜덤워크 기법을 채택하였다. 본 연구의 기여는 제설 운영에 있어 D-ARP라는 새로운 문제를 설정하고 최적화 접근법을 도입하였으며 검색공간을 최소화한 것이다. 최적화 결과, 드론은 지상트럭에 비해 약 5% ~ 22%의 경로 비용 감소를 보였다. 나아가 길이 제약 모델에서도 드론은 4%의 비용 감소를 보였다. 또한 실험결과는 적용한 휴리스틱 알고리즘이 큰 네트워크에서도 합리적 시간 내에 최적해를 찾음을 입증하였다. 이러한 결과를 바탕으로, 드론을 제설에 도입하는 것은 미래에 제설 운영 비용을 실질적으로 감소시킬 것으로 기대된다.Chapter 1. Introduction 4 1.1. Study Background 4 1.2. Purpose of Research 6 Chapter 2. Literature Review 7 2.1. Drone Arc Routing problem 7 2.2. Snow Removal Routing Problem 8 2.3. The Classic ARPs and Algorithms 9 2.4. Large Search Space and Arc direction 11 Chapter 3. Method 13 3.1. Problem Statement 13 3.2. Formulation 16 Chapter 4. Algorithm 17 4.1. Overview 17 4.2. Auxilary Transformation Method 18 4.3. Ant Colony Optimization (ACO) 20 4.4. Post Process for Arc Direction Decision 23 4.5. Length Constraint and Random Walk 24 Chapter 5. Results 27 5.1. Application in Toy Network 27 5.2. Application in Real-world Networks 29 5.3. Application of the Refill Constraint in Seoul 31 Chapter 6. Conclusion 34 References 35 Acknowledgment 40석

Planeamento da recolha dos resíduos de papeleiras numa área urbana

Mestrado em Decisão Económica e EmpresarialA recolha de resíduos urbanos é um dos problemas que carece de grande atenção por parte das entidades municipais. Na freguesia de Alvalade, pretende-se criar rotas para um veículo elétrico afeto à recolha dos resíduos das papeleiras, de modo a que a duração total das rotas seja a menor possível e respeitem a capacidade do veículo e a duração dos turnos dos trabalhadores. Trata-se de um problema de otimização com procura nos arcos e restrições de capacidade (CARP). Assim, é adotado um modelo de programação linear inteira mista baseado em Gouveia et al. [15] para descrever matematicamente o problema prático e ajudar a resolvê-lo. O presente projeto iniciou-se com a recolha e tratamento dos dados. A informação recolhida foi organizada no Microsoft Excel 2013 e o modelo foi testado com o Premium Solver Pro. Obtiveram-se soluções para instâncias de média dimensão, baseadas em dados reais que permitiram avaliar o método utilizado. Este trabalho permitiu concluir que este método poderá vir a ser a base de um sistema automatizado para produzir percursos para o veículo que faz a recolha.Waste collection is a problem lacking attention from the Municipal entities. For the parish of Alvalade, routes are intended to be created for an electric vehicle that collets the litter bins' waste in such way that the total duration of routes is as shortest as possible, don't push the vehicle's own limits and don't interfere with the workers' shifts. This is presented as a capacitated arc routing problem (CARP). Therefore, a mixed integer linear programming model based on Gouveia et al. [15] was adopted to mathematically describe the practical problem and to help solving it. This project began with data collection and treatment. A database was then built using Excel 2013 and the model was tested on Premium Solver Pro. To assess the method used, solutions were obtained for midsized instances, based on real data. This work led to the conclusion that the method could be the basis for an automated system to produce itineraries for the garbage collecting vehicle

Uma meta-heurística Adaptive Large Neighborhood Search com mecanismos de paralelismo, detecção de estagnação e perturbações para o problema de roteamento de veículos com frota heterogênea, periódico e Multi-Trips

The planning of vehicle routes is a major issue involved in supply chains. In real environment we can find situations involving a very large number of clients or constraints witch indicate that exact methods should be avoided. In this context, this work presents an metaheuristic for solving some variants of the vehicle routing problem (VRP): Heterogeneous VRP, VRP Periodic and VRP with multi-trips. The metaheuristic chosen, called Adaptive Large Neighborhood Search (ALNS), combines the power of successful strategies in the literature as a large neighborhood search and adaptive mechanisms with new features such as parallelism, detection of stagnation and perturbations. Our ALNS was implemented in such a way that all variants of the VRP are solved without changes in the code. The results for several instances proposed in the literature are satisfactory, showing the good performance of the approach.A atribuição e o planejamento de rotas de veículos são problemas importantes envolvidos nas cadeias de suprimentos. Em ambiente real é comum encontrar situações que envolvam uma quantidade muito grande de clientes ou de restrições que consequentemente fogem do alcance de métodos exatos. Neste contexto, este trabalho apresenta uma meta-heurística capaz de resolver algumas variantes do problema de roteamento de veículos (PRV) combinadas: o PRV capacitado com frota heterogênea, o PRV periódico e o PRV com multi-trips. A meta-heurística escolhida, denominada Adaptive Large Neighborhood Search (ALNS), combina a força de estratégias bem-sucedidas na literatura como busca em vizinhança ampla e mecanismos adaptativos e também novos mecanismos como paralelismo, detecção de estagnação e perturbações. O ALNS foi implementado de tal maneira que todas as variantes do PRV citadas pudessem ser resolvidas sem alterações de código. Os resultados obtidos, em diversas instâncias propostas na literatura foram satisfatórios, mostrando o bom desempenho do método proposto

A STOWAGE PLANNING MODEL FOR MULTIPORT CONTAINER TRANSPORTATION

The ship turnaround time at container terminals is an important measure of a port's efficiency and attractiveness. The speed and quality of load planning affect the length of turnaround time considerably. Container operations are extremely important from an economic standpoint, making them a prime target for productivity improvements. In addition, load planning is a very complex problem, since the planners have to account for the stability of the ship and rely on a variety of other stochastic processes. Unfortunately, the load-planning problem is NP-hard making it difficult to obtain an optimal solution in polynomial time. Heuristics that trade quality for tractability are therefore promising tools when coping with this problem. Efficient load planning is accomplished by formulating the stowage-planning model to minimize extra shifting as a mixed integer-programming problem. The key contributions of this dissertation are as follows. A mathematical model is developed which considers real life constraints and considering loading/unloading along the entire voyage. A second mathematical model is formulated to obtain a lower bound on the value of the objective function of the exact solution. A heuristic procedure is developed that is guide by practical considerations that account for the structure of the stowage-planning problem. All proposed mathematical models and heuristic are validated with experimental results. In all cases, these results demonstrate the stability, flexibility and efficiency of the model, and establish its potential as a versatile and practical method for large scale container loading

Algoritmos heurísticos de cobertura de arcos

Tese (doutorado) - Universidade Federal de Santa Catarina. Centro Tecnológico. Programa de Pós-Graduação em Engenharia de ProduçãoNos problemas de roteamento o objetivo é determinar um circuito de custo mínimo que cobre um dado conjunto de arcos ou nós de um grafo, sujeito a algumas restrições. Existem duas classes bem conhecidas de tais problemas, denominadas como o Problema de Caixeiro Viajante (PCV), e o Problema do Carteiro Chinês (PCC). Com raras exceções, todos os problemas já formulados nessas duas classes são NP-completos. Portanto, para os problemas de maior porte existem apenas soluções aproximadas. Nessa Tese foi considerado o problema de determinar um circuito de custo mínimo que cobre um dado subconjunto de arcos, de arestas e de nós de um grafo misto, sujeito a algumas restrições nos vértices (restrições que proíbem conversões indesejáveis nos cruzamentos de malhas urbanas). Obviamente, o PCV, PCC e a maior parte de suas variações, como: o Problema do Carteiro Chinês Misto e o Problema do Carteiro Rural são casos particulares deste problema geral. A solução proposta é baseada numa transformação polinomial do grafo que possibilita a solução do problema resultante como um PCV padrão. Resultados computacionais confirmam a eficiência do método na obtenção de soluções próxima a ótimas para problemas razoavelmente grandes