Results 81 to 90 of about 107,892 (239)
Distributed Decision Making in Combined Vehicle Routing and Break Scheduling [PDF]
, 2009 The problem of combined vehicle routing and break scheduling comprises three subproblems: clustering of customer requests, routing of vehicles, and break scheduling.
Kok, Adrianus Leendert +3 more
core +1 more source
Optimal Routing of Energy-aware Vehicles in Networks with Inhomogeneous Charging Nodes
, 2014 We study the routing problem for vehicles with limited energy through a network of inhomogeneous charging nodes. This is substantially more complicated than the homogeneous node case studied in [1]. We seek to minimize the total elapsed time for vehicles
Cassandras, Christos G. +1 more
core +1 more source
Different versions of the savings method for the time limited vehicle routing problem
Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 2012 The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main difference is that the routes are paths (not cycles), i.e. vehicles do not return to the central city (or at least we do not observe their way back).
Petr Kučera
doaj +1 more source
On a Labeled Vehicle Routing Problem [PDF]
, 2010 In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V,E) containing a special vertex 0 called the depot and where the edges are colored (labeled), the minimum label k-vehicle routing problem consists in finding a k-vehicle routing E?, i.e. a collection of cycles
Hatem Chatti +2 more
openaire +2 more sources
Analyzing combined vehicle routing and break scheduling from a distributed decision making perspective [PDF]
, 2009 We analyze the problem of combined vehicle routing and break scheduling from a distributed decision making perspective. The problem of combined vehicle routing and break scheduling can be defined as the problem of finding vehicle routes to serve a set of
Kok, A.L. +3 more
core +1 more source
AASA: A Priori Adaptive Splitting Algorithm for the Split Delivery Vehicle Routing Problem
AlgorithmsThe split delivery vehicle routing problem (SDVRP) is a relaxed variant of the capacitated vehicle routing problem (CVRP) where the restriction that each customer is visited precisely once is removed.
Nariman Torkzaban +3 more
doaj +1 more source
Comparing descent heuristics and metaheuristics for the vehicle routing problem [PDF]
, 2001 Alex Van Breedam
openalex +1 more source
Optimizing departure times in vehicle routes [PDF]
, 2007 Most solution methods for the vehicle routing problem with time\ud windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make\ud that such solutions are not optimal with respect to ...
Hans, E.W., Kok, A.L., Schutten, J.M.J.
core +1 more source
EURO Journal on Transportation and Logistics, 2021 Delivery options are at the heart of the generalized vehicle routing problem with time windows (GVRPTW) allowing that customer requests are shipped to alternative delivery locations which can also have different time windows.
Dorian Dumez +4 more
doaj
Dataset for the cumulative unmanned aerial vehicle routing problem. [PDF]
Data Brief, 2023 Kyriakakis NA +3 more
europepmc +1 more source