Results 41 to 50 of about 6,722,909 (287)
Current State of Dynamic Vehicle Routing Problems Solved by Ant Colony Optimization Algorithm
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
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem [PDF]
Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets.
Pop Petrica, Pop-Sitar Corina
doaj +1 more source
The Vehicle Routing Problem with Divisible Deliveries and Pickups [PDF]
The vehicle routing problem with divisible deliveries and pickups is a new and interesting model within reverse logistics. Each customer may have a pickup and delivery demand that have to be served with capacitated vehicles. The pickup and the delivery
Nagy, Gábor +6 more
core +1 more source
The Vehicle Routing Problem with Transhipment Facilities [PDF]
This paper proposes an exact method for solving an optimization problem arising in several distribution networks where customers can be served directly, using vehicle routes from a central depot, or through transhipment facilities. The problem consists of optimizing the following inter-dependent decisions: selecting transhipment facilities, allocating
Roberto Baldacci +2 more
openaire +6 more sources
Location-Routing: Issues, Models and Methods [PDF]
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
Ontology Support for Vehicle Routing Problem
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
Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs [PDF]
Metaheuristic algorithms, such as simulated annealing and tabu search, are popular solution techniques for vehicle routing problems (VRPs). These approaches rely on iterative improvements to a starting solution, involving slight alterations to the routes
Harwood, Kieran +2 more
core +5 more sources
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
The Generalized Consistent Vehicle Routing Problem [PDF]
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 +3 more sources
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

