Results 181 to 190 of about 11,512 (226)
Some of the next articles are maybe not open access.

The VRP Generalized Inverse and Its Application in DCM/VRP-Based Walking Control

IEEE Robotics and Automation Letters, 2019
A generalized inverse, referred to as the virtual-repellent-point generalized inverse (VRP-GI), is proposed to solve the underdetermined body-wrench distribution problem. The VRP-GI is derived as a modification of the divergent-component-of-motion generalized inverse (DCM-GI) introduced in a previous study. The VRP-GI inherits all the advantages of the
Akinori Miyata   +2 more
exaly   +3 more sources

An Improved Ant Colony Algorithm for VRP Problem

2010 Third International Symposium on Intelligent Information Technology and Security Informatics, 2010
Vehicle routing problem(VRP) is an NP-hard problem, Ant colony algorithm is an effective tool for solving combinatorial optimization problems like VRP. On the base of understanding VRP problem and Ant Colony Algotithm(ACA), analysis ACA’s application in VRP, for its shortcomings, reference MMAS thought, introduce dynamic negative feedback mechanism and
Geng-Sheng Wang, Yun-Xin Yu
exaly   +3 more sources

Analisis Permodelan Periodic VRP with Driver-Consistency dan Consistency-VRP with Time-Windows

Progresif: Jurnal Ilmiah Komputer, 2022
<p><strong>Abstrak.</strong> Sistem distribusi merupakan bagian penting dalam aktivitas pemasaran untuk mempermudah penyampaian barang dan jasa kepada konsumen. Dalam sistem distribusi terdapat komponen-komponen berupa Pelanggan, Kendaraan, Pengemudi, Rute dan Depot yang menjadi tujuan pendistribusian.
Muhammad Reza Riansyah   +2 more
openaire   +1 more source

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   +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   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy