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
The k-dissimilar vehicle routing problem [PDF]
European Journal of Operational Research, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luca Talarico +2 more
openaire +3 more sources
Vehicle routing problem with deliveries and pickups: Modelling issues and meta-heuristics solution approaches [PDF]
, 2014 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
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
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
The Fleet Size and Mix vehicle Routing Problem with backhauls: Formulation and Set partitioning-based heuristics [PDF]
, 2013 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
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 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
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
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