A reinforcement learning hyper-heuristic for the optimisation of flight connections

Many combinatorial computational problems have been effectively solved by means of hyper-heuristics. In this study, we focus on a problem proposed by Kiwi.com and solve this problem by implementing a Reinforcement Learning (RL) hyperheuristic algorithm. Kiwi.com proposed a real-world NP-hard minimisation problem associated with air travelling services. The problem shares some characteristics with several TSP variants, such as time-dependence and time-windows that make the problem more complex in comparison to the classical TSP. In this work, we evaluate our proposed RL method on kiwi.com problem and compare its results statistically with common random-based hyper-heuristic approaches. The empirical results show that RL method achieves the best performance between the tested selection hyper-heuristics. Another significant achievement of RL is that better solutions were found compared to the best known solutions in several problem instances

Centralized versus market-based approaches to mobile task allocation problem: State-of-the-art

Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many real-life applications. On the other hand, market-based approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP

Efficient Fuel Consumption Minimization for Green Vehicle Routing Problems using a Hybrid Neural Network-Optimization Algorithm

Efficient routing optimization yields benefits that extend beyond mere financial gains. In this thesis, we present a methodology that utilizes a graph convolutional neural network to facilitate the development of energy-efficient waste collection routes. Our approach focuses on a Waste company in Tromsø, Remiks, and uses real-life datasets, ensuring practicability and ease of implementation. In particular, we extend the dpdp algorithm introduced by Kool et al. (2021) [1] to minimize fuel consumption and devise routes that account for the impact of elevation and real road distance traveled. Our findings shed light on the potential advantages and enhancements these optimized routes can offer Remiks, including improved effectiveness and cost savings. Additionally, we identify key areas for future research and development

Attention-Based Neural Network for Solving the Green Vehicle Routing Problem in Waste Management

23.08.23: Trekkes tilbake fra visning som løsning på at oppgaven ble ferdigstilt fra studieadministrasjonen litt for fort/IHTIThe transport sector is a major contributor to the emission of greenhouse gases and air pollution. As urbanization and population growth continue to increase, the demand for transportation services grows, emphasizing the need for sustainable practices. Therefore, incorporating sustainability into the transport sector can effectively reduce its negative impacts on the environment and optimize the utilization of resources. This thesis aims to address this issue by proposing a novel method that integrates neural networks into the development of a green vehicle routing model. By incorporating environmental considerations, particularly fuel consumption, into the optimization process, the model seeks to generate more sustainable route solutions. The integration of machine learning techniques, specifically an attention-based neural network, demonstrates the potential of combining machine learning with operations research for effective route optimization. While the effectiveness of the green vehicle routing problem (GVRP) has been demonstrated in providing sustainable routes, its practical applications in real-world scenarios are still limited. Therefore, this thesis proposes the implementation of the GVRP model in a real-world waste collection routing problem. The study utilizes data obtained from Remiks, a waste management company responsible for waste collection and handling in Tromsø and Karlsøy. The findings of this study highlight the promising synergy between machine learning and operations research for further advancements and real-world applications. Specifically, the application of the GVRP approach to waste management issues has been shown to reduce emissions during the waste collection process compared to routes optimized solely for distance minimization. The attention-based neural network approach successfully generates routes that minimize fuel consumption, outperforming distance-optimized routes. These results underscore the importance of leveraging the GVRP to address environmental challenges while enhancing decision-making efficiency and effectiveness. Overall, this thesis provides insights for developing sustainable and optimized routes for real-world problems

A Heuristic Method for Task Selection in Persistent ISR Missions Using Autonomous Unmanned Aerial Vehicles

The Persistent Intelligence, Surveillance, and Reconnaissance (PISR) problem seeks to provide timely collection and delivery of data from prioritized ISR tasks using an autonomous Unmanned Aerial Vehicle (UAV). In the literature, PISR is classified as a type of Vehicle Routing Problem (VRP), often called by other names such as persistent monitoring, persistent surveillance, and patrolling. The objective of PISR is to minimize the weighted revisit time to each task (called weighted latency) using an optimal task selection algorithm. In this research, we utilize the average weighted latency as our performance metric and investigate a method for task selection called the Maximal Distance Discounted and Weighted Revisit Period (MD2WRP) utility function. The MD2WRP function is a heuristic method of task selection that uses n+1 parameters, where n is the number of PISR tasks. We develop a two-step optimization method for the MD2WRP parameters to deliver optimal latency performance for any given task configuration, which accommodates both single and multi-vehicle scenarios. To validate our optimization method, we compare the performance of MD2WRP to common Traveling Salesman Problem (TSP) methods for PISR using different task configurations. We find that the optimized MD2WRP function is competitive with the TSP methods, and that MD2WRP often results in steady-state task visit sequences that are equivalent to the TSP solution for a single vehicle. We also compare MD2WRP to other utility methods from the literature, finding thatMD2WRP performs on par with or better than these other methods even when optimizing only one of its n + 1 parameters. To address real-world operational factors, we test MD2WRP with Dubins constraints, no-y zones in the operational area, return-to-base requirements, and the addition and removal of vehicles and tasks mid-mission. For each operational factor, we demonstrate its effect on PISR task selections using MD2WRP and how MD2WRP needs to be modified, if at all, to compensate. Finally, we make practical suggestions about implementing MD2WRP for flight testing, outline potential areas for future study, and offer recommendations about the conduct of PISR missions in general

Optimization of vehicle routing and scheduling with travel time variability - application in winter road maintenance

This study developed a mathematical model for optimizing vehicle routing and scheduling, which can be used to collect travel time information, and also to perform winter road maintenance operations (e.g., salting, plowing). The objective of this research was to minimize the total vehicle travel time to complete a given set of service tasks, subject to resource constraints (e.g., truck capacity, fleet size) and operational constraints (e.g., service time windows, service time limit). The nature of the problem is to design vehicle routes and schedules to perform the required service on predetermined road segments, which can be interpreted as an arc routing problem (ARP). By using a network transformation technique, an ARP can be transformed into a well-studied node routing problem (NRP). A set-partitioning (SP) approach was introduced to formulate the problem into an integer programming problem (I PP). To solve this problem, firstly, a number of feasible routes were generated, subject to resources and operational constraints. A genetic algorithm based heuristic was developed to improve the efficiency of generating feasible routes. Secondly, the corresponding travel time of each route was computed. Finally, the feasible routes were entered into the linear programming solver (CPL EX) to obtain final optimized results. The impact of travel time variability on vehicle routing and scheduling for transportation planning was also considered in this study. Usually in the concern of vehicle and pedestrian\u27s safety, federal, state governments and local agencies are more leaning towards using a conservative approach with constant travel time for the planning of winter roadway maintenance than an aggressive approach, which means that they would rather have a redundancy of plow trucks than a shortage. The proposed model and solution algorithm were validated with an empirical case study of 41 snow sections in the northwest area of New Jersey. Comprehensive analysis based on a deterministic travel time setting and a time-dependent travel time setting were both performed. The results show that a model that includes time dependent travel time produces better results than travel time being underestimated and being overestimated in transportation planning. In addition, a scenario-based analysis suggests that the current NJDOT operation based on given snow sector design, service routes and fleet size can be improved by the proposed model that considers time dependent travel time and the geometry of the road network to optimize vehicle routing and scheduling. In general, the benefit of better routing and scheduling design for snow plowing could be reflected in smaller minimum required fleet size and shorter total vehicle travel time. The depot location and number of service routes also have an impact on the final optimized results. This suggests that managers should consider the depot location, vehicle fleet sizing and the routing design problem simultaneously at the planning stage to minimize the total cost for snow plowing operations

The AddACO: A bio-inspired modified version of the ant colony optimization algorithm to solve travel salesman problems

The Travel Salesman Problem (TSP) consists in finding the minimal-length closed tour that connects the entire group of nodes of a given graph. We propose to solve such a combinatorial optimization problem with the AddACO algorithm: it is a version of the Ant Colony Optimization method that is characterized by a modified probabilistic law at the basis of the exploratory movement of the artificial insects. In particular, the ant decisional rule is here set to amount in a linear convex combination of competing behavioral stimuli and has therefore an additive form (hence the name of our algorithm), rather than the canonical multiplicative one. The AddACO intends to address two conceptual shortcomings that characterize classical ACO methods: (i) the population of artificial insects is in principle allowed to simultaneously minimize/maximize all migratory guidance cues (which is in implausible from a biological/ecological point of view) and (ii) a given edge of the graph has a null probability to be explored if at least one of the movement trait is therein equal to zero, i.e., regardless the intensity of the others (this in principle reduces the exploratory potential of the ant colony). Three possible variants of our method are then specified: the AddACO-V1, which includes pheromone trail and visibility as insect decisional variables, and the AddACO-V2 and the AddACO-V3, which in turn add random effects and inertia, respectively, to the two classical migratory stimuli. The three versions of our algorithm are tested on benchmark middle-scale TPS instances, in order to assess their performance and to find their optimal parameter setting. The best performing variant is finally applied to large-scale TSPs, compared to the naive Ant-Cycle Ant System, proposed by Dorigo and colleagues, and evaluated in terms of quality of the solutions, computational time, and convergence speed. The aim is in fact to show that the proposed transition probability, as long as its conceptual advantages, is competitive from a performance perspective, i.e., if it does not reduce the exploratory capacity of the ant population w.r.t. the canonical one (at least in the case of selected TSPs). A theoretical study of the asymptotic behavior of the AddACO is given in the appendix of the work, whose conclusive section contains some hints for further improvements of our algorithm, also in the perspective of its application to other optimization problems

Rough-Cut Capacity Planning in Multimodal Freight Transportation Networks

A main challenge in transporting cargo for United States Transportation Command (USTRANSCOM) is in mode selection or integration. Demand for cargo is time sensitive and must be fulfilled by an established due date. Since these due dates are often inflexible, commercial carriers are used at an enormous expense, in order to fill the gap in organic transportation asset capacity. This dissertation develops a new methodology for transportation capacity assignment to routes based on the Resource Constrained Shortest Path Problem (RCSP). Routes can be single or multimodal depending on the characteristics of the network, delivery timeline, modal capacities, and costs. The difficulty of the RCSP requires use of metaheuristics to produce solutions. An Ant Colony System to solve the RCSP is developed in this dissertation. Finally, a method for generating near Pareto optimal solutions with respect to the objectives of cost and time is developed

School bus selection, routing and scheduling.

The aim of this thesis is to develop formulations and exact algorithms for the school bus routing and scheduling problem and to develop an integrated software implementation using Xpress-MP/CPLEX and ArcGIS of ESRI, a geographical information system software package. In this thesis, bus flow, single commodity flow, two-commodity flow, multi-commodity flow, and time window formulations have been developed. They capture all of the important elements of the School Bus Routing and Scheduling Problem (SBRSP) including homogeneous or heterogeneous bus fleets, the identification of bus stops from a large set of potential bus stops, and the assignment of students to stops and stops to routes. They allow for the one stop-one bus and one stop-multi bus scenarios. Each formulation of the SBRSP has a linear programming relaxation and we present the relationships among them. We present a Branch-and-Cut exact algorithm which makes use of new linearization techniques, new valid inequalities, and the first valid equalities. We develop an integrated software package that is based on Geographical Information System (GIS) map-based interface, linking to an Xpress-MP/CPLEX solver. The interface between GIS and Xpress-MP is written in VBA and VC++.Dept. of Mathematics and Statistics. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .K4. Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6250. Thesis (Ph.D.)--University of Windsor (Canada), 2005