a new metaheuristic algorithm for the split delivery vehicle fleet mix problem with access availability
نویسندگان
چکیده
0
منابع مشابه
A Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملFleet Size and Mix Split-Delivery Vehicle Routing
Abstract In the classic Vehicle Routing Problem (VRP) a fleet of of vehicles has to visit a set of customers while minimising the operations’ costs. We study a rich variant of the VRP featuring split deliveries, an heterogeneous fleet, and vehiclecommodity incompatibility constraints. Our goal is twofold: define the cheapest routing and the most adequate fleet. To do so, we split the problem in...
متن کاملThree New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem
In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...
متن کاملa hybrid metaheuristic algorithm for the vehicle routing problem with delivery time cost
this paper addresses the vehicle routing problem with delivery time cost. this problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. in this research, a hybrid metaheuristic approa...
متن کاملAn exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
The generalized vehicle routing problem (GVRP) involves finding a minimum-length set of vehicle routes passing through a set of clusters, where eachcluster contains a number of vertices, such that the tour includes exactly onevertex from each cluster and satisfies capacity constraints. We consider aversion of the GVRP where the number of vehicles is a decision variable. This...
متن کاملA Genetic Algorithm for the Split Delivery Vehicle Routing Problem
The Split Delivery Vehicle Routing Problem (SDVRP) allows customers to be assigned to multiple routes. Two hybrid genetic algorithms are developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance and computer time, the genetic algorithm compares favorably versus a column generation method and a two-pha...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
پژوهشنامه بازرگانیجلد ۱۷، شماره ۶۶، صفحات ۲۱-۴۸
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023