1,230 research outputs found
A Survey On Multi Trip Vehicle Routing Problem
The vehicle routing problem (VRP) and its variants are well known and greatly explored in the transportation literature. The vehicle routing problem can be considered as the scheduling of vehicles (trucks) to a set of customers under various side constraints. In most studies, a fundamental assumption is that a vehicle dispatched for service finishes its duty in that scheduling period after it returns back to the depot. Clearly, in many cases this assumption may not hold. Thus, in the last decade some studies appeared in the literature where this basic assumption is relaxed, and it is allowed for a vehicle to make multiple trips per period. We consider this new variant of the VRP an important one with direct practical impact. In this survey, we define the vehicle routing problem with multiple trips, define the current state-of-the-art, and report existing results from the current literature
Recommended from our members
Some applications of continuous variable neighbourhood search metaheuristic (mathematical modelling)
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In the real world, many problems are continuous in nature. In some cases, finding the global solutions for these problems is di±cult. The reason is that the problem's objective function is non convex, nor concave and even not differentiable. Tackling these problems is often computationally too expensive. Although the development in computer technologies are increasing the speed of computations, this often is not adequate, particularly if the size of the problem's instance are large. Applying exact methods on some problems may necessitate their linearisation. Several new ideas using heuristic approaches have been considered particularly since they tackle the problems within reasonable computational time and give an approximate solution. In this thesis, the variable neighbourhood search (VNS) metaheuristic (the framework for building heuristic) has been considered. Two variants of variable neighbourhood search
metaheuristic have been developed, continuous variable neighbourhood search and reformulation descent variable neighbourhood search. The GLOB-VNS software (Drazic et al., 2006) hybridises the Microsoft Visual Studio C++ solver with variable neighbourhood search metaheuristics. It has been used as a starting point for this research and then adapted and modified for problems studied in this thesis. In fact, two problems have been considered, censored quantile regression and the circle packing problem. The results of this approach for censored quantile regression outperforms other methods described in the literature, and the near-optimal solutions are obtained in short running computational time. In addition, the reformulation descent variable neighbourhood search variant in solving circle packing problems is developed and the computational results are provided
A Vitual-Force Based Swarm Algorithm for Balanced Circular Bin Packing Problems
Balanced circular bin packing problems consist in positioning a given number
of weighted circles in order to minimize the radius of a circular container
while satisfying equilibrium constraints. These problems are NP-hard, highly
constrained and dimensional. This paper describes a swarm algorithm based on a
virtual-force system in order to solve balanced circular bin packing problems.
In the proposed approach, a system of forces is applied to each component
allowing to take into account the constraints and minimizing the objective
function using the fundamental principle of dynamics. The proposed algorithm is
experimented and validated on benchmarks of various balanced circular bin
packing problems with up to 300 circles. The reported results allow to assess
the effectiveness of the proposed approach compared to existing results from
the literature.Comment: 23 pages including reference
- …