386 research outputs found
Multi-echelon distribution systems in city logistics
In the last decades
,
the increasing quality of services requested by the cust
omer, yields to the necessity of
optimizing
the whole distribution process.
This goal may be achieved through a smart exploitation of
existing resources other than a clever planning of the whole distribution process. For doing that, it is
necessary to enha
nce goods consolidation.
One of the most efficient way to implement
it
is to adopt
Multi
-
Echelon distribution systems
which are very common in
City Logistic context,
in which they allow
to keep large trucks from the city center, with strong
environmental
a
dvantages
.
The aim of the
paper
is to
review
routing
problems
arising
in City Logistics
, in which multi
-
e
chelon distribution systems are
involved: the
Two Echelon
Location Routing Problem (
2E
-
LRP)
, the Two
Echelon Vehicle Routing
Problem (2E
-
VRP) and Truck and Trailer Routing Problem (TTRP), and to discuss literature on
optimization methods, both exact and heuristic, developed to address these problems
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.
A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem
This paper presents a novel GRASP algorithm based on a new randomized heuristic for solving the capacitated vehicle routing problem, which characterized by using a fleet of homogenous vehicle capacity that will start from one depot, to serve a number of customers with demands that are less than the vehicle capacity. The proposed method is based on a new constructive heuristic and a simulated annealing procedure as an improvement phase. The new constructive heuristic uses four steps to generate feasible initial solutions, and the simulated annealing enhances these solutions found to reach the optimal one. We tested our algorithm on two sets of benchmark instances and the obtained results are very encouraging
The Vehicle Routing Problem with Service Level Constraints
We consider a vehicle routing problem which seeks to minimize cost subject to
service level constraints on several groups of deliveries. This problem
captures some essential challenges faced by a logistics provider which operates
transportation services for a limited number of partners and should respect
contractual obligations on service levels. The problem also generalizes several
important classes of vehicle routing problems with profits. To solve it, we
propose a compact mathematical formulation, a branch-and-price algorithm, and a
hybrid genetic algorithm with population management, which relies on
problem-tailored solution representation, crossover and local search operators,
as well as an adaptive penalization mechanism establishing a good balance
between service levels and costs. Our computational experiments show that the
proposed heuristic returns very high-quality solutions for this difficult
problem, matches all optimal solutions found for small and medium-scale
benchmark instances, and improves upon existing algorithms for two important
special cases: the vehicle routing problem with private fleet and common
carrier, and the capacitated profitable tour problem. The branch-and-price
algorithm also produces new optimal solutions for all three problems
Meta-RaPS Hybridization with Machine Learning Algorithms
This dissertation focuses on advancing the Metaheuristic for Randomized Priority Search algorithm, known as Meta-RaPS, by integrating it with machine learning algorithms. Introducing a new metaheuristic algorithm starts with demonstrating its performance. This is accomplished by using the new algorithm to solve various combinatorial optimization problems in their basic form. The next stage focuses on advancing the new algorithm by strengthening its relatively weaker characteristics. In the third traditional stage, the algorithms are exercised in solving more complex optimization problems. In the case of effective algorithms, the second and third stages can occur in parallel as researchers are eager to employ good algorithms to solve complex problems. The third stage can inadvertently strengthen the original algorithm. The simplicity and effectiveness Meta-RaPS enjoys places it in both second and third research stages concurrently. This dissertation explores strengthening Meta-RaPS by incorporating memory and learning features. The major conceptual frameworks that guided this work are the Adaptive Memory Programming framework (or AMP) and the metaheuristic hybridization taxonomy. The concepts from both frameworks are followed when identifying useful information that Meta-RaPS can collect during execution. Hybridizing Meta-RaPS with machine learning algorithms helped in transforming the collected information into knowledge. The learning concepts selected are supervised and unsupervised learning. The algorithms selected to achieve both types of learning are the Inductive Decision Tree (supervised learning) and Association Rules (unsupervised learning). The objective behind hybridizing Meta-RaPS with an Inductive Decision Tree algorithm is to perform online control for Meta-RaPS\u27 parameters. This Inductive Decision Tree algorithm is used to find favorable parameter values using knowledge gained from previous Meta-RaPS iterations. The values selected are used in future Meta-RaPS iterations. The objective behind hybridizing Meta-RaPS with an Association Rules algorithm is to identify patterns associated with good solutions. These patterns are considered knowledge and are inherited as starting points for in future Meta-RaPS iteration. The performance of the hybrid Meta-RaPS algorithms is demonstrated by solving the capacitated Vehicle Routing Problem with and without time windows
REVISIÓN DE LA LITERATURA DEL PROBLEMA DE RUTEO DE VEHÍCULOS EN UN CONTEXTO DE TRANSPORTE VERDE
In the efficient management of the supply chain the optimal management of transport of consumables and finished products appears. The costs associated with transport have direct impact on the final value consumers must pay, which in addition to requiring competitive products also demand that they are generated in environmentally friendly organizations. Aware of this reality, this document is intended to be a starting point for Master's and Doctoral degree students who want to work in a line of research recently proposed: green routing. The state of the art of the vehicle routing problem is presented in this paper, listing its variants, models and methodologies for solution. Furthermore, the proposed interaction between variants of classical routing problems and environmental effects of its operations, known in the literature as Green-VRP is presented. The goal is to generate a discussion in which mathematical models and solution strategies that can be applied within organizations that consider within their objectives an efficient and sustainable operation are posed. En el gerenciamiento eficiente de la cadena de suministro aparece la gestión óptima del transporte de insumos y productos terminados. Los costos asociados al transporte tienen impacto directo sobre el valor final que deben pagar los consumidores, que además de requerir productos competitivos también exigen que los mismos sean generados en organizaciones amigables con el medioambiente. Consientes de esa realidad este documento pretende ser un punto de partida para estudiantes de maestría y doctorado que quieran trabajar en una línea de investigación propuesta recientemente: el ruteo verde. En este trabajo se muestra un estado del arte del problema de ruteo de vehículos, enumerando sus variantes, modelos y metodologías de solución. Además, se presenta la interacción que se ha propuesto entre variantes clásicas de los problemas de ruteo y los efectos ambientales de su operación, denominados en la literatura como Green-VRP. El objetivo es generar una discusión donde se planteen modelos matemáticos y estrategias de solución que puedan ser aplicadas en organizaciones que consideren dentro de sus objetivos una operación eficiente y sustentable.
Document type: Articl
Combining heuristics with simulation and fuzzy logic to solve a flexible-size location routing problem under uncertainty
The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers’ demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm.This work has been partially supported by the Spanish Ministry of Science (PID2019-111100RB-C21/AEI/10.13039/501100011033). In addition, it has received the support of the Doctoral School at the Universitat Oberta de Catalunya (Spain) and the Universidad de La Sabana (INGPhD-12-2020).Peer ReviewedPostprint (published version
- …