Results 21 to 30 of about 21,347 (311)
A Survey of Transportation Problems
Journal of Applied Mathematics, 2014 This paper aims at being a guide to understand the different types of transportation problems by presenting a survey of mathematical models and algorithms used to solve different types of transportation modes (ship, plane, train, bus, truck, Motorcycle ...
Ocotlán Díaz-Parra +4 more
doaj +1 more source
Vehicle Routing Problem with Stochastic Demands
Communications, 2003 In the introductory section of this paper there is a view of several types of stochastic vehicle routing problems. In the second section of the paper the vehicle routing problem with stochastic demands is described.
Vaclav Korenar
doaj +1 more source
Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm
Contemporary Mathematics and Applications (ConMathA), 2020 The purpose of this research is to solve the Close-Open Mixed Vehicle Routing Problem (COMVRP) using Bat Algorithm. COMVRP which is a combination of Close Vehicle Routing Problem or commonly known as Vehicle Routing Problem (VRP) with Open Vehicle ...
Atika Dwi Hanun Amalia +2 more
doaj +1 more source
The Vehicle Routing Problem with Divisible Deliveries and Pickups [PDF]
, 2012 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
Automobile chain maintenance parts delivery problem using an improved ant colony algorithm
Advances in Mechanical Engineering, 2016 The mode of automotive maintenance chain is gaining more and more attention in China because of its advantages such as the lower cost, higher speed, higher availability, and strong adaptability.
Junjie Gao +4 more
doaj +1 more source
A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem [PDF]
, 2008 The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the ...
Imran, Arif +2 more
core +1 more source
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
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
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
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