Results 31 to 40 of about 21,347 (311)
Current State of Dynamic Vehicle Routing Problems Solved by Ant Colony Optimization Algorithm
Tehnički Glasnik, 2021 Dynamic Vehicle Routing Problem is a more complex version of Vehicle Routing Problem, closer to the present, real-world problems. Heuristic methods are used to solve the problem as Vehicle Routing Problem is NP-hard. Among many different solution methods,
Luka Olivari, Goran Đukić
doaj
The Generalized Consistent Vehicle Routing Problem [PDF]
Transportation Science, 2015 The consistent vehicle routing problem (ConVRP) takes customer satisfaction into account by assigning one driver to a customer and by bounding the variation in the arrival times over a given planning horizon. These requirements may be too restrictive in some applications.
Attila A. Kovacs +3 more
openaire +2 more sources
Ontology Support for Vehicle Routing Problem
Applied Sciences, 2022 This paper aims to present a generalized ontology model for the Vehicle Routing Problem (VRP) and it gives some out-plant material handling case studies.
Anita Agárdi +2 more
doaj +1 more source
Location-Routing: Issues, Models and Methods [PDF]
, 2006 This paper is a survey of location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects. We propose a classification scheme and look at a number of problem variants. Both exact and heuristic algorithms
Gábor Nagy +3 more
core +1 more source
Alexandria Engineering Journal, 2018 The vehicle routing problem is the basic problem of distribution planning which seeks to find the best route with minimum displacement cost considering the number of customers, their constraints, and number and capacity of the available vehicles. In this
Davoud Sedighizadeh, Houman Mazaheripour
doaj +1 more source
Cogent Engineering, 2020 This article aims to present research conducted on the literature regarding multi-objective optimization for routing problems with environmental considerations, referred to here as Multi-objective Optimization for the Green Vehicle Routing Problem ...
Júlio César Ferreira +2 more
doaj +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 +1 more source
The two-echelon capacitated vehicle routing problem: models and math-based heuristics [PDF]
, 2011 Multiechelon distribution systems are quite common in supply-chain and logistics. They are used by public administrations in their transportation and traffic planning strategies, as well as by companies, to model own distribution systems.
R. Tadei +9 more
core +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 +1 more source
The Flexible Periodic Vehicle Routing Problem [PDF]
Computers & Operations Research, 2017 This paper introduces the Flexible Periodic Vehicle Routing Problem (FPVRP) where a carrier has to establish a distribution plan to serve his customers over a planning horizon. Each customer has a total demand that must be served within the horizon and a limit on the maximum quantity that can be delivered at each visit.
Archetti, C +2 more
openaire +4 more sources