Results 81 to 90 of about 11,225 (197)

Workload Equity in Vehicle Routing Problems: A Survey and Analysis

open access: yes, 2018
Over the past two decades, equity aspects have been considered in a growing number of models and methods for vehicle routing problems (VRPs). Equity concerns most often relate to fairly allocating workloads and to balancing the utilization of resources ...
Hartl, Richard F.   +2 more
core   +1 more source

Constructive heuristics for Capacitated Vehicle Routing Problem: a comparative study

open access: yesТруды Института системного программирования РАН, 2019
Vehicle Routing Problem (VRP) is concerned with the optimal design of routes to be used by a fleet of vehicles to serve a set of customers. In this study we analyze constructive heuristics for a subcase of VRP, where the vehicles have a limited capacity –
Sergey Mikhailovitch Avdoshin   +1 more
doaj   +1 more source

The Vehicle Rescheduling Problem [PDF]

open access: yes
The capacitated vehicle routing problem is to find a routing schedule describing the order in which geographically dispersed customers are visited to satisfy demand by supplying goods stored at the depot, such that the traveling costs are minimized.
Dekker, R., Gabor, A.F., Spliet, R.
core   +1 more source

Probabilistic Analysis of a Capacitated Vehicle Routing Problem II

open access: yesThe Annals of Applied Probability, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

AASA: A Priori Adaptive Splitting Algorithm for the Split Delivery Vehicle Routing Problem

open access: yesAlgorithms
The split delivery vehicle routing problem (SDVRP) is a relaxed variant of the capacitated vehicle routing problem (CVRP) where the restriction that each customer is visited precisely once is removed.
Nariman Torkzaban   +3 more
doaj   +1 more source

A Simulation Based Metaheuristics for Capacitated Vehicle Routing Problem

open access: yesAutomotive Experiences
Waste collection and transportation are essential elements of effective waste management. However, despite their importance, previous studies have highlighted several challenges, such as routing inefficiencies and environmental concerns.
Tamara Latifah Jasmine   +3 more
doaj   +1 more source

A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs

open access: yes, 2019
The Capacitated Vehicle Routing problem is to find a minimum-cost set of tours that collectively cover clients in a graph, such that each tour starts and ends at a specified depot and is subject to a capacity bound on the number of clients it can serve ...
Andreas Emil Feldmann   +5 more
core   +1 more source

An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem

open access: yesIJAIN (International Journal of Advances in Intelligent Informatics), 2018
This work aims to develop an enhanced Perturbation based Variable Neighborhood Search with Adaptive Selection Mechanism (PVNS ASM) to solve the capacitated vehicle routing problem (CVRP).
Alfian Faiz   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy