103 research outputs found
Dynamic vehicle routing problems: Three decades and counting
Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing a real explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy of DVRP papers according to 11 criteria. These are (1) type of problem, (2) logistical context, (3) transportation mode, (4) objective function, (5) fleet size, (6) time constraints, (7) vehicle capacity constraints, (8) the ability to reject customers, (9) the nature of the dynamic element, (10) the nature of the stochasticity (if any), and (11) the solution method. We comment on technological vis-à-vis methodological advances for this class of problems and suggest directions for further research. The latter include alternative objective functions, vehicle speed as decision variable, more explicit linkages of methodology to technological advances and analysis of worst case or average case performance of heuristics.© 2015 Wiley Periodicals, Inc
Solving Combinatorial Optimization Problems Using Genetic Algorithms and Ant Colony Optimization
This dissertation presents metaheuristic approaches in the areas of genetic algorithms and ant colony optimization to combinatorial optimization problems.
Ant colony optimization for the split delivery vehicle routing problem
An Ant Colony Optimization (ACO) based approach is presented to solve the Split Delivery Vehicle Routing Problem (SDVRP). SDVRP is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) wherein a customer can be visited by more than one vehicle. The proposed ACO based algorithm is tested on benchmark problems previously published in the literature. The results indicate that the ACO based approach is competitive in both solution quality and solution time. In some instances, the ACO method achieves the best known results to date for the benchmark problems.
Hybrid genetic algorithm for the split delivery vehicle routing problem (SDVRP)
The Vehicle Routing Problem (VRP) is a combinatory optimization problem in the field of transportation and logistics. There are various variants of VRP which have been developed of the years; one of which is the Split Delivery Vehicle Routing Problem (SDVRP). The SDVRP allows customers to be assigned to multiple routes. A hybrid genetic algorithm comprising a combination of ant colony optimization, genetic algorithm, and heuristics is proposed and tested on benchmark SDVRP test problems.
Genetic algorithm approach to solve the hospital physician scheduling problem
Emergency departments have repeating 24-hour cycles of non-stationary Poisson arrivals and high levels of service time variation. The problem is to find a shift schedule that considers queuing effects and minimizes average patient waiting time and maximizes physicians’ shift preference subject to constraints on shift start times, shift durations and total physician hours available per day. An approach that utilizes a genetic algorithm and discrete event simulation to solve the physician scheduling problem in a hospital is proposed. The approach is tested on real world datasets for physician schedules
Algorithms for multi-robot systems on the cooperative exploration & last-mile delivery problems
La aparición de los vehículos aéreos no tripulados (UAVs) y de los vehículos terrestres no tripulados (UGVs) ha llevado a la comunidad científica a enfrentarse a problemas ideando paradigmas de cooperación con UGVs y UAVs. Sin embargo, no suele ser trivial determinar si la cooperación entre UGVs y UAVs es adecuada para un determinado problema. Por esta razón, en esta tesis, investigamos un paradigma particular de cooperación UGV-UAV en dos problemas de la literatura, y proponemos un controlador autónomo para probarlo en escenarios simulados.
Primero, formulamos un problema particular de exploración cooperativa que consiste en alcanzar un conjunto de puntos de destino en un área de exploración a gran escala. Este problema define al UGV como una estación de carga móvil para transportar el UAV a través de diferentes lugares desde donde el UAV puede alcanzar los puntos de destino. Por consiguiente, proponemos el algoritmo TERRA para resolverlo. Este algoritmo se destaca por dividir el problema de exploración en cinco subproblemas, en los que cada subproblema se resuelve en una etapa particular del algoritmo.
Debido a la explosión de la entrega de paquetes en las empresas de comercio electrónico, formulamos también una generalización del conocido problema de la entrega en la última milla. En este caso, el UGV actúa como una estación de carga móvil que transporta a los paquetes y a los UAVs, y estos se encargan de entregarlos. De esta manera, seguimos la estrategia de división descrita por TERRA, y proponemos el algoritmo COURIER. Este algoritmo replica las cuatro primeras etapas de TERRA, pero construye una nueva quinta etapa para producir un plan de tareas que resuelva el problema. Para evaluar el paradigma de cooperación UGV-UAV en escenarios simulados, proponemos el controlador autónomo ARIES. Este controlador sigue un enfoque jerárquico descentralizado de líder-seguidor para integrar cualquier paradigma de cooperación de manera distribuida.
Ambos algoritmos han sido caracterizados para identificar los aspectos relevantes del paradigma de cooperación en los problemas relacionados. Además, ambos demuestran un gran rendimiento del paradigma de cooperación en tales problemas, y al igual que el controlador autónomo, revelan un gran potencial para futuras aplicaciones reales.The emergence of Unmanned Aerial Vehicles (UAVs) and Unmanned
Ground Vehicles (UGVs) has conducted the research community to
face historical complex problems by devising UGV-UAV cooperation
paradigms. However, it is usually not a trivial task to determine
whether or not a UGV-UAV cooperation is suitable for a particular
problem. For this reason, in this thesis, we investigate a particular
UGV-UAV cooperation paradigm over two problems in the literature,
and we propose an autonomous controller to test it on simulated
scenarios.
Driven by the planetary exploration, we formulate a particular cooperative
exploration problem consisting of reaching a set of target
points in a large-scale exploration area. This problem defines the UGV
as a moving charging station to carry the UAV through different locations
from where the UAV can reach the target points. Consequently,
we propose the cooperaTive ExploRation Routing Algorithm (TERRA)
to solve it. This algorithm stands out for splitting up the exploration
problem into five sub-problems, in which each sub-problem is solved
in a particular stage of the algorithm. In the same way, driven by the
explosion of parcels delivery in e-commerce companies, we formulate
a generalization of the well-known last-mile delivery problem. This
generalization defines the same UGV’s and UAV’s rol as the exploration
problem. That is, the UGV acts as a moving charging station
which carries the parcels along several UAVs to deliver them. In this
way, we follow the split strategy depicted by TERRA to propose the
COoperative Unmanned deliveRIEs planning algoRithm (COURIER).
This algorithm replicates the first four TERRA’s stages, but it builds a
new fifth stage to produce a task plan solving the problem. In order to
evaluate the UGV-UAV cooperation paradigm on simulated scenarios,
we propose the Autonomous coopeRatIve Execution System (ARIES).
This controller follows a hierarchical decentralized leader-follower approach
to integrate any cooperation paradigm in a distributed manner.
Both algorithms have been characterized to identify the relevant
aspects of the cooperation paradigm in the related problems. Also,
both of them demonstrate a great performance of the cooperation
paradigm in such problems, and as well as the autonomous controller,
reveal a great potential for future real applications
An Optimization Framework for a Dynamic Multi-Skill Workforce Scheduling and Routing Problem with Time Windows and Synchronization Constraints
This article addresses the dynamic multi-skill workforce scheduling and
routing problem with time windows and synchronization constraints (DWSRP-TW-SC)
inherent in the on-demand home services sector. In this problem, new service
requests (tasks) emerge in real-time, necessitating a constant reevaluation of
service team task plans. This reevaluation involves maintaining a portion of
the plan unaltered, ensuring team-task compatibility, addressing task
priorities, and managing synchronization when task demands exceed a team's
capabilities. To address the problem, we introduce a real-time optimization
framework triggered upon the arrival of new tasks or the elapse of a set time.
This framework redesigns the routes of teams with the goal of minimizing the
cumulative weighted throughput time for all tasks. For the route redesign phase
of this framework, we develop both a mathematical model and an Adaptive Large
Neighborhood Search (ALNS) algorithm. We conduct a comprehensive computational
study to assess the performance of our proposed ALNS-based reoptimization
framework and to examine the impact of reoptimization strategies, frozen period
lengths, and varying degrees of dynamism. Our contributions provide practical
insights and solutions for effective dynamic workforce management in on-demand
home services
Methodologies for Solving Integrated Transportation and Scheduling Problems
This research proposes novel solution techniques to optimize two real-world problems in the area of scheduling and transportation. We first consider a model for optimizing the operations of dredges. In this problem, scheduling and assignment decisions are integrated across a finite planning horizon. Additional constraints and problem elements explicitly considered include, but are not limited, to environmental work window restrictions, budget limitations, dredge operation rates and schedule-dependent dredge availability. Our approach makes use of Constraint Programming (CP) to obtain quality and robust solutions within an amount of time small enough to be useful to practitioners. The expanded feature set of the methodology presented makes our solution tool the most comprehensive and flexible decision-making framework for dredge scheduling in existence.
The second transportation and logistics problem considered in this dissertation considers a unified variation of the Vehicle Routing Problem (VRP). This work offers a powerful yet flexible tool to model and solve real-world problems, each with their specifications, constraints, and requirements. We review existing VRP problems from the literature and propose new VRP variants that differ from the existing ones by the consideration of hours of service regulation on the active and drive hours of drivers in a single or multiple shifts. Real-world instances of these problems consist of thousands of customer locations and hundreds of vehicles. To ensure the quality of the solutions, we compare the performance of our approach with CPLEX on several benchmark instances from the literature.
Finally, the third chapter of this work focuses on a comprehensive analysis of the methodology presented in Chapter 4. Specifically, sensitivity analysis regarding the parameters driving the performance of the heuristics is performed. Also, we propose a Genetic Algorithm (GA) to solve the VRP variants in Chapter 3 and provide a computational study of its performance against CPLEX and the approaches in Chapter 3
Recommended from our members
A survey of swarm intelligence for dynamic optimization: algorithms and applications
Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given
Applied (Meta)-Heuristic in Intelligent Systems
Engineering and business problems are becoming increasingly difficult to solve due to the new economics triggered by big data, artificial intelligence, and the internet of things. Exact algorithms and heuristics are insufficient for solving such large and unstructured problems; instead, metaheuristic algorithms have emerged as the prevailing methods. A generic metaheuristic framework guides the course of search trajectories beyond local optimality, thus overcoming the limitations of traditional computation methods. The application of modern metaheuristics ranges from unmanned aerial and ground surface vehicles, unmanned factories, resource-constrained production, and humanoids to green logistics, renewable energy, circular economy, agricultural technology, environmental protection, finance technology, and the entertainment industry. This Special Issue presents high-quality papers proposing modern metaheuristics in intelligent systems
- …