Results 261 to 270 of about 11,439 (294)

Energy minimizing capacitated covering vehicle routing problem

Applied Soft Computing
This paper introduces the Energy Minimizing Covering Capacitated Vehicle Routing Problem, which aims to minimize total energy consumed during delivery routes while satisfying customers’ demands. The problem considers a homogeneous fleet of identical vehicles stationed at a central depot and utilizes a concept of flexible delivery. Customers can receive
Vukićević, Milena, Ratli, Mustapha, Rivenq, Atika, Todosijević, Raca, Jarboui, Bassem   +4 more
openaire   +1 more source

Vehicle Routing Optimization Problem: A Study on Capacitated Vehicle Routing Problem

Materials Today: Proceedings, 2022
V. Praveen, Dr.P. Keerthika, G. Sivapriya, A. Sarankumar, Boddu Bhasker   +4 more
openaire   +1 more source

Capacitated-Vehicle Routing Problem with Backhauls on Trees

Transportation Research Record: Journal of the Transportation Research Board, 2011
The capacitated-vehicle routing problem (CVRP) is a classical problem that has been well studied by the transportation science community. A special case of the CVRP in which the network is constrained to have a tree structure (TCVRP) is studied here.
Roshan Kumar, Avinash Unnikrishnan, S. Travis Waller   +2 more
openaire   +1 more source

Polyhedral study of the capacitated vehicle routing problem

Mathematical Programming, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cornuejols, Gerard, Harche, Farid
openaire   +2 more sources

UCT-Based Approach to Capacitated Vehicle Routing Problem

2015
Vehicle Routing Problem (VRP) is a popular combinatorial optimization problem which consists in finding an optimal set of routes for a fleet of vehicles in order to serve a specified collection of clients. Capacitated VRP (CVRP) is a version of VRP in which every vehicle has a capacity parameter assigned.
Jacek Mańdziuk, Cezary Nejman
openaire   +1 more source

The Capacitated Vehicle Routing Problem

Digitale Welt, 2019
Christoph Roch, Stefan Langer
openaire   +1 more source

A Dynamic and Stochastic Cumulative Capacitated Vehicle Routing Problem

Asia-Pacific Journal of Operational Research
The cumulative capacitated vehicle routing problem (CCVRP) is a variant of the classical capacitated vehicle routing problem in which the objective is the minimization of customers’ total waiting time prior to service. Inspired by the first-mile pick-up service within 3rd-Party Logistics operations, we study a dynamic and stochastic variant of the ...
openaire   +2 more sources

Exact Solution of the Capacitated Vehicle Routing Problem

2011
This multi-volume encyclopedia is organized alphabetically and contains four levels of articles (Introductory, Advanced, Technical, and Case Studies/Historical Interludes) designed to make its content useful and accessible to the widest possible readership.
BALDACCI, ROBERTO, TOTH, PAOLO, VIGO, DANIELE   +2 more
openaire   +1 more source

New Genetic Algorithm for Capacitated Vehicle Routing Problem

2012
In logistic transport industry, individual demands and the diversity requirements are matters in transport operation; this paper focused on the vehicle routing problem. New genetic algorithm is used to get the optimization solution in the paper. First of all, use natural number coding to simplify the problem; apply insertion method to improve the ...
Chunyu Ren, Shiwei Li
openaire   +1 more source

A Bilevel Ant Colony Optimization Algorithm for Capacitated Electric Vehicle Routing Problem

IEEE Transactions on Cybernetics, 2022
Ya-Hui Jia, Yi Mei, Mengjie Zhang
exaly