Results 21 to 30 of about 5,853 (265)
Dynamic Vehicle Routing Schedule Algorithm Based on Big-data Platform [PDF]
Jisuanji gongcheng, 2018 In order to solve some problem of dynamic vehicle routing,this paper proposes a vehicle routing algorithm based on big-data calculation model.This algorithm uses big-data calculation to collect and process the initial data,it sets up the alerts trigger ...
TANG Dequan,HUANG Jingui,SHI Weiqi
doaj
SavingsAnts for the Vehicle Routing Problem
, 2002 In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP.
Karl Doerner +5 more
openaire +5 more sources
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
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem [PDF]
Yugoslav Journal of Operations Research, 2011 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 Flexible Periodic Vehicle Routing Problem [PDF]
Computers & Operations Research, 2017 Peer ...
Archetti, C +2 more
openaire +4 more sources
Ant Colony Optimization Method and Split-Delivery Vehicle Routing Problem
Communications, 2009 This paper deals with a split delivery vehicle routing problem, which is a modification of a vehicle routing problem. It consists in delivery routes optimization in communications network containing initial city of all routes and a given number of places,
Andrej Chu
doaj +1 more source
On the differential evolution for vehicle routing problem [PDF]
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR), 2013 Vehicle Routing Problem (VRP) is a well known NP-hard optimization problem with a number of real world applications and a variety of different versions. Due to its complexity, large instances of VRP are hard to solve using exact methods. Instead, various heuristic and meta-heuristic algorithms were used to find feasible VRP solutions.
Pavel Krömer +4 more
openaire +1 more source
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
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
The Vehicle Routing Problem with Transhipment Facilities [PDF]
Transportation Science, 2017 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 +5 more sources