530 research outputs found
On green routing and scheduling problem
The vehicle routing and scheduling problem has been studied with much
interest within the last four decades. In this paper, some of the existing
literature dealing with routing and scheduling problems with environmental
issues is reviewed, and a description is provided of the problems that have
been investigated and how they are treated using combinatorial optimization
tools
Waste Collection Vehicle Routing Problem Model with Multiple Trips, Time Windows, Split Delivery, Heterogeneous Fleet and Intermediate Facility
Waste Collection Vehicle Routing Problem (WCVRP) is one of the developments of a Vehicle Routing Problem, which can solve the route determination of transporting waste. This study aims to develop a model from WCVRP by adding characteristics such as split delivery, multiple trips, time windows, heterogeneous fleet, and intermediate facilities alongside an objective function to minimize costs and travel distance. Our model determines the route for transporting waste especially in Cakung District, East Jakarta. The additional characteristics are obtained by analyzing the characteristics of waste transportation in the area. The models are tested using dummy data to analyze the required computational time and route suitability. The models contribute to determining the route of transporting waste afterward. The WCVRP model has been successfully developed, conducted the numerical testing, and implemented with the actual characteristics such as split delivery, multiple trips, time windows, heterogeneous fleets, and intermediate facilities. The output has reached the global optimal for both dummy and real data
A group genetic algorithm for the fleet size and mix vehicle routing problem
In logistics management, the use of vehicles to distribute products from suppliers to customers is a major operational activity. Optimizing the routing of vehicles is crucial for providing cost-effective services to customers. This research addresses the fleet size and mix vehicle routing problem (FSMVRP), where the heterogeneous fleet and its size are to be determined. A group genetic algorithm (GGA) approach, with unique genetic operators, is designed and implemented on a number of existing benchmark problems. GGA demonstrates competitive performance in terms of cost and computation time when compared to other heuristics
On the use of reference points for the biobjective Inventory Routing Problem
The article presents a study on the biobjective inventory routing problem.
Contrary to most previous research, the problem is treated as a true
multi-objective optimization problem, with the goal of identifying
Pareto-optimal solutions. Due to the hardness of the problem at hand, a
reference point based optimization approach is presented and implemented into
an optimization and decision support system, which allows for the computation
of a true subset of the optimal outcomes. Experimental investigation involving
local search metaheuristics are conducted on benchmark data, and numerical
results are reported and analyzed
An artificial bee colony algorithm for the capacitated vehicle routing problem
Session MF-03: Population-based metaheuristics for routing problems - Stream: Metaheuristics - Invited session no. 3This paper introduces an artificial bee colony heuristic for the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. The performance of the heuristic is evaluated on two sets of benchmark instances. A new scheme is also developed to improve the performance of the artificial bee colony heuristic. Computational results show that the heuristic with the new scheme produces good solutions.postprintThe 24th European Conference on Operational Research (EURO 24), Lisbon, Portual, 11-14 July 2010. In Abstract Book of EURO 24, 2010, p. 89, MF-03-
Thirty years of heterogeneous vehicle routing
It has been around thirty years since the heterogeneous vehicle routing problem was introduced, and significant progress has since been made on this problem and its variants. The aim of this survey paper is to classify and review the literature on heterogeneous vehicle routing problems. The paper also presents a comparative analysis of the metaheuristic algorithms that have been proposed for these problems
Application of Genetic Algorithm in Containerships Network Design Problem
This paper studies the application of genetic
algorithm (GA) for heterogeneous vehicle routing problem
with time windows (HVRPTW) that considers fixed costs.
Typical application of this VRP variant can be found in
network design problem for containerships and an example
from Indonesian archipelago is used as a case study. The GA
is extended from the principles of effective GA published in
the literature and its performance is compared to that of LP
optimization using branch-and-bound. Two approaches in
population initialization are tested but no differences found.
However, on reaching optimality, the GA can point out the
optimal or less than one percent optimal solution ten times
faster than the B&B
- …