Showing 1 - 10 of 527
verbes-serte Tourenplanung erschlossen werden können. Da nur einige wenige Zeitfensterrestriktionen zu beachten sind, wird …
Persistent link: https://www.econbiz.de/10005533265
The Vehicle Routing Problem (VRP) is one of the most studied problems in the field of Operations Research. Closely related to the VRP is the Capacitated Clustering Problem (CCP). The VRP can be considered as an 'extension' of the CCP in the way that for each cluster in the CCP solution,...
Persistent link: https://www.econbiz.de/10005121034
Persistent link: https://www.econbiz.de/10005371483
In this paper, we propose an assignment-based local search method for solving vehicle routing problems. This method is a multi-route improvement algorithm that can operate on several routes at a time. To evaluate the performance of the proposed method, extensive computational experiments on the...
Persistent link: https://www.econbiz.de/10004977547
In this paper, the Vehicle Routing Problem with Stochastic Demands (VRPSD) is considered where customer demands are normally distributed. We propose a new model for computing the expected length of a tour. Monte Carlo simulation is used to demonstrate the accuracy of the model on randomly...
Persistent link: https://www.econbiz.de/10004979796
This paper introduces an extension of the vehicle routing problem by including several distributors in competition. Each customer is characterized by demand and a wholesale price. Under this scenario a solution may have unserviced customers and elementary routes with no customer visits. The...
Persistent link: https://www.econbiz.de/10011096375
The Vehicle Routing Problem with Backhauls (VRPB) is an extension of the VRP that deals with two types of customers: the consumers (linehaul) that request goods from the depot and the suppliers (backhaul) that send goods to the depot. In this paper, we propose a simple yet effective iterated...
Persistent link: https://www.econbiz.de/10011097721
The classical objective function of the Vehicle Routing Problem (VRP) is to minimize the total distance traveled by all vehicles (Min–Sum). In several situations, such as disaster relief efforts, computer networks, and workload balance, the minimization of the longest route (Min–Max) is a...
Persistent link: https://www.econbiz.de/10011097756
Torespondto the reduction of greenhouse gas emissions and global warming, this paper investigates the minimal-carbon-footprint time-dependent heterogeneous-fleet vehicle routing problem with alternative paths (MTHVRPP). This finds a route with the smallestcarbon footprint, instead of the...
Persistent link: https://www.econbiz.de/10010798797
This paper addresses the planning of recyclable waste collection systems while accounting for economic and environmental concerns. Service areas and vehicle routes are defined for logistics networks with multiple depots where different products are collected. The problem is modeled as a...
Persistent link: https://www.econbiz.de/10011049008