نتایج جستجو برای: capacitated vehicle routing problem combinatorial optimization cuckoo search le vy flights

تعداد نتایج: 1598906  

Journal: :Proceedings of the Institute for System Programming of RAS 2019

Journal: :International Journal of Advanced Computer Research 2020

Journal: :journal of optimization in industrial engineering 2014
hossein larki majid yousefikhoshbakht

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

Journal: :IJAEC 2013
Ziauddin Ursani Daryl Essam David Cornforth Rob Stocker

This paper is a continuation of two previous papers where the authors used Genetic Algorithm with automated problem decomposition strategy for small scale capacitated vehicle routing problems (CVRP) and vehicle routing problem with time windows (VRPTW). In this paper they have extended their scheme to large scale capacitated vehicle routing problems by introducing selective search version of th...

Journal: :JORS 2003
Jean Berger Mohamed Barkaoui

Recently proved successful for variants of the vehicle routing problem (VRP) involving time windows, genetic algorithms have not yet shown to compete or challenge current best search techniques in solving the classical capacitated VRP. In this paper, a hybrid genetic algorithm to address the capacitated vehicle routing problem is proposed. The basic scheme consists in concurrently evolving two ...

2010
S. Geetha P. T. Vanathi

The Vehicle Routing Problem (VRP) is a NP-hard and Combinatorial optimization problem. Combinatorial optimization problem can be viewed as searching for best element in a set of discrete items, which can be solved using search algorithm or meta heuristic. In this work, VRP is solved using population based search algorithm, Particle Swarm Optimization (PSO) with crossover and mutation operators....

Journal: :European Journal of Operational Research 2010

Journal: :international journal of transportation engineering 0
amirsaeed nikkhah qamsari msc. student, school of industrial engineering, iran university of science and technology, tehran, iran seyed mahdi hosseini motlagh assistant professor, school of industrial engineering, iran university of science and technology, tehran, iran abbas jokar ph.d. candidate, school of industrial engineering, iran university of science and technology, tehran, iran

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

Journal: :Transportation Science 2016
Mauro Dell'Amico José Carlos Díaz Díaz Geir Hasle Manuel Iori

We study the Mixed Capacitated General Routing Problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem has theoretical interest because it is a generalization of the Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and th...

2014
Chengming Qi Ping Li

Vehicle routing problem(VRP) is important combinatorial optimization problems which have received considerable attention in the last decades. The optimization of vehicle routing problem is a well-known research problem in the logistics distribution. In order to overcome the prematurity of Ant Colony Algorithm (ACA) for logistics distribution routing optimization, a hybrid algorithm combining im...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید