Results 181 to 190 of about 8,135 (227)

ABC Algorithm for VRP

2014
Vehicle routing problem(VRP) has the same mathematical model with many combinatorial optimization problems, they are typical NP- hard problems in combinatorial optimization problem. In this paper, artificial bee colony (ABC) algorithm is applied to solve VRP. We propose a method to keep the colony diversity and improve the search efficiency of ABC.
Kai Shao, Kang Zhou 0005, Jiang Qiu, Juan Zhao   +3 more
openaire   +1 more source

Complexity of the VRP and SDVRP

Transportation Research Part C: Emerging Technologies, 2011
Abstract In this paper we study the computational complexity of the vehicle routing problem (VRP) and of the split delivery vehicle routing problem (SDVRP) on some special classes of instances, characterized by special structures of the underlying graph, namely a line, a star, a tree and a circle.
ARCHETTI, Claudia, D. Feillet, M. Gendreau, SPERANZA, Maria Grazia   +3 more
openaire   +1 more source

The Capacitated VRP with Equal Demands

2013
In this chapter, we consider the capacitated vehicle routing problem with unequal demands (UCVRP). In this version of the problem, each customer i has a demand w i and the capacity constraint stipulates that the total amount delivered by a single vehicle cannot exceed Q.
David Simchi-Levi, Xin Chen, Julien Bramel   +2 more
openaire   +1 more source

The VRP with Time-Window Constraints

2013
In many distribution systems, in addition to the load that has to be delivered to it, each customer specifies a period of time, called a time window, in which this delivery must occur. The objective is to find a set of routes for the vehicles, where each route begins and ends at the depot, that serves a subset of the customers without violating the ...
David Simchi-Levi, Xin Chen, Julien Bramel   +2 more
openaire   +1 more source

Bridging Theory and Practice in VRP

Journal of the Operational Research Society, 1995
This article examines the use of theory and practice in the solution of Vehicle Routeing Problems (VRPs) in some major organizations located in Scotland. The respective organizations' backgrounds and delivery structures are presented. Solutions and implementations together with the role of computer software are discussed.
Alberto G. Canen, Leonard G. Scott
openaire   +1 more source

VRP PROBLEM

This paper focuses on the Vehicle Routing Problem (VRP) with the aim of optimizing routes to enhance sustainability in Supply Chain Management. It explores fundamental concepts of logistics and transportation, analyzes the Travelling Salesman Problem, and examines key algorithms used for route optimization. A case study using real data from SLT SAMARAS
openaire   +1 more source

The Research on VRP Based on Max-Min Ant Colony Algorithm

Advanced Materials Research, 2011
Vehicle routing problem (VRP) is the key to reducing the cost of logistics, and also an NP-hard problem. Ant colony algorithm is a very effective method to solve the VRP, but it is easy to fall into local optimum and has a long search time.
Chang Min Chen, Song Song Fan, Wei Cheng Xie   +2 more
exaly   +2 more sources

A GVNS Algorithm to Solve VRP with Optional Visits

2019
In this paper we deal with a generalization of the multi-depot capacitated vehicle routing problem namely the multi-depot covering tour vehicle routing problem (MDCTVRP). This problem is considered more challenging since it deals with some situations where it is not possible to visit all the customers with the vehicles routes.
Manel Kammoun, Houda Derbel, Bassem Jarboui   +2 more
openaire   +1 more source

Approximation Algorithms for Cumulative VRP with Stochastic Demands

2016
In this paper we give randomized approximation algorithms for stochastic cumulative VRPs for split and unsplit deliveries. The approximation ratios are $$21+\alpha $$ and 7 respectively, where $$\alpha $$ is the approximation ratio for the metric TSP. The approximation factor is further reduced for trees and paths.
Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh   +2 more
openaire   +1 more source

Tabu Search for Vehicle Routing Problems (VRPs)

International Journal of Computer Mathematics, 2002
Vehicle Routing Problems (VRPs) considered in this paper involve a set of engineers operating from one base and a set of geographically distributed jobs or services to be performed by them under the given technological and temporal constraints. All engineers have different time-windows for their working and the technological constraints specify their ...
openaire   +1 more source