3,971 research outputs found
Industrial and Tramp Ship Routing Problems: Closing the Gap for Real-Scale Instances
Recent studies in maritime logistics have introduced a general ship routing
problem and a benchmark suite based on real shipping segments, considering
pickups and deliveries, cargo selection, ship-dependent starting locations,
travel times and costs, time windows, and incompatibility constraints, among
other features. Together, these characteristics pose considerable challenges
for exact and heuristic methods, and some cases with as few as 18 cargoes
remain unsolved. To face this challenge, we propose an exact branch-and-price
(B&P) algorithm and a hybrid metaheuristic. Our exact method generates
elementary routes, but exploits decremental state-space relaxation to speed up
column generation, heuristic strong branching, as well as advanced
preprocessing and route enumeration techniques. Our metaheuristic is a
sophisticated extension of the unified hybrid genetic search. It exploits a
set-partitioning phase and uses problem-tailored variation operators to
efficiently handle all the problem characteristics. As shown in our
experimental analyses, the B&P optimally solves 239/240 existing instances
within one hour. Scalability experiments on even larger problems demonstrate
that it can optimally solve problems with around 60 ships and 200 cargoes
(i.e., 400 pickup and delivery services) and find optimality gaps below 1.04%
on the largest cases with up to 260 cargoes. The hybrid metaheuristic
outperforms all previous heuristics and produces near-optimal solutions within
minutes. These results are noteworthy, since these instances are comparable in
size with the largest problems routinely solved by shipping companies
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
Variable-depth adaptive large meighbourhood search algorithm for Open Periodic Vehicle Routing Problem with time windows
The Open Periodic Vehicle Routing Problem with Time Windows (OPVRPTW) is a practical transportation routing and scheduling problem arising from real-world scenarios. It shares some common features with some classic VRP variants. The problem has a tightly constrained large-scale solution space and requires well balanced diversification and intensification in search. In Variable Depth Neighbourhood Search, large neighbourhood depth prevents the search from trapping into local optima prematurely, while small depth provides thorough exploitation in local areas. Considering the multi-dimensional solution structure and tight constraints in OPVRPTW, a Variable-Depth Adaptive Large Neighbourhood Search (VD-ALNS) algorithm is proposed in this paper. Contributions of four tailored destroy operators and three repair operators at variable depths are investigated. Comparing to existing methods, VD-ALNS makes a good trade-off between exploration and exploitation, and produces promising results on both small and large size benchmark instances
Genetic algorithm for the continuous location-routing problem
This paper focuses on the continuous location-routing problem that comprises of the location of multiple depots from a given region and determining the routes of vehicles assigned to these depots. The objective of the problem is to design the delivery system of depots and routes so that the total cost is minimal. The standard location-routing problem considers a finite number of possible locations. The continuous location-routing problem allows location to infinite number of locations in a given region and makes the problem much more complex. We present a genetic algorithm that tackles both location and routing subproblems simultaneously.Web of Science29318717
A review of the Tabu Search Literature on Traveling Salesman Problems
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition to exactrnmethods. Tabu search is one of the most widely applied metaheuristic for solving the TSP. Inrnthis paper, we review the tabu search literature on the TSP, point out trends in it, and bringrnout some interesting research gaps in this literature.
The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context
AbstractCollection of waste is an important logistic activity within any city. In this paper we study how to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem with Time Window which is concerned with finding cost optimal routes for garbage trucks such that all garbage bins are emptied and the waste is driven to disposal sites while respecting customer time windows and ensuring that drivers are given the breaks that the law requires. We propose an adaptive large neighborhood search algorithm for solving the problem and illustrate the usefulness of the algorithm by showing that the algorithm can improve the objective of a set of instances from the literature as well as for instances provided by a Danish garbage collection company
- …