Vehicle Routing Problem with Stochastic Demands
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
The k-dissimilar vehicle routing problem [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luca Talarico +2 more
openaire +3 more sources
Exact algorithms for the clustered vehicle routing problem [PDF]
This study presents new exact algorithms for the Clustered Vehicle Routing Problem (CluVRP). The CluVRP is a generalization of the Capacitated Vehicle Routing Problem (CVRP), in which the customers are grouped into clusters.
Vigo, Daniele +9 more
core +1 more source
Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm
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
Vehicle routing problem with deliveries and pickups: Modelling issues and meta-heuristics solution approaches [PDF]
The paper investigates a class of extensions to the vehicle routing problem. Different problem versions – some well-known, some more recent – are explained and placed in a taxonomy. A central focus of the paper is on the assumptions generally made in
Nagy, Gábor, Wassan, Niaz A.
core +1 more source
A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP) [PDF]
The Capacitated Arc Routing Problem (CARP) is a difficult optimisation problem in vehicle routing with applications where a service must be provided by a set of vehicles on specified roads.
Eglese, R W, Brandao, J
core +4 more sources
Automobile chain maintenance parts delivery problem using an improved ant colony algorithm
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
SavingsAnts for the Vehicle Routing Problem
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 Fleet Size and Mix vehicle Routing Problem with backhauls: Formulation and Set partitioning-based heuristics [PDF]
In this paper we present a new variant of the classical Vehicle Routing Problem – the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). An ILP formulation of the FSMVRPB is presented.
Hajarat, Mutaz +2 more
core +1 more source
Dynamic Vehicle Routing Schedule Algorithm Based on Big-data Platform [PDF]
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

