• Nenhum resultado encontrado

[PDF] Top 20 The mixed capacitated arc routing problem with non-overlapping routes

Has 10000 "The mixed capacitated arc routing problem with non-overlapping routes" found on our website. Below are the top 20 most common "The mixed capacitated arc routing problem with non-overlapping routes".

The mixed capacitated arc routing problem with non-overlapping routes

The mixed capacitated arc routing problem with non-overlapping routes

... zones with clear geographical borders (Cattrysse et ...from routes overlapping (Poot et ...However, the literature has been scarce on the evaluation of zones ...evaluate the ... See full document

31

A mathematical modeling proposal for a Multiple Tasks Periodic Capacitated Arc Routing Problem

A mathematical modeling proposal for a Multiple Tasks Periodic Capacitated Arc Routing Problem

... of the PCARP is made and a problem in mixed arcs is proposed, suggesting a Memetic Algorithm (MA) to solve the ...to the author is a hybrid genetic algorithm with a local search. ... See full document

11

A mixed load rural school bus routing problem with heterogeneous fleet: a study for the Brazilian problem

A mixed load rural school bus routing problem with heterogeneous fleet: a study for the Brazilian problem

... In the last decade, the federal government has been encouraging the nucleation of rural schools to offer better structured schools to the rural ...to the rural families but with ... See full document

86

Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle

Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle

... a mixed cost, where the first term denotes the construction cost of charging stations, the second term the cost of electricity recharged at depot and stations, and the third term ... See full document

12

A solution for a real-time stochastic capacitated vehicle routing problem with time windows

A solution for a real-time stochastic capacitated vehicle routing problem with time windows

... detail, the system is composed of the following modules: (a) i3FR-Opt – the actual route optimization algorithm is implemented in the optimization module designated ...i3FR-Opt. The ... See full document

10

Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows

Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows

... replacement with filtration: Elitism replacement scheme is applied in this study as follows: Both parent and offspring population are combined into a single population and sorted in a non-increasing order ... See full document

7

Modeling a four-layer location-routing problem

Modeling a four-layer location-routing problem

... 2007). The LRP models can be applied in a variety of businesses and ...of the applications mentioned in (Nagy & Salhi, 2007) are food and drink distribution, newspaper distribution, parcel delivery, and ... See full document

10

The influence of the arc plasma treatment on the structure and microhardness C120U carbon tool steel

The influence of the arc plasma treatment on the structure and microhardness C120U carbon tool steel

... on the basis EN ISO 4957:1999 norms to obtain a structure with a relatively high ...tungsten arc welding method. The surface of the samples were remelted by means of ... See full document

4

Coarse-Grained Parallel Genetic Algorithm to solve the Shortest Path Routing problem using Genetic operators

Coarse-Grained Parallel Genetic Algorithm to solve the Shortest Path Routing problem using Genetic operators

... be the master and the others are slaves. The master node is responsible to hold the population and performs most of the genetic algorithm ...operations. The master will assign ... See full document

4

Ant colony optimization techniques for the hamiltonian p-median problem

Ant colony optimization techniques for the hamiltonian p-median problem

... follows the most favorable path already established or may randomly select a path to follow based on a probability distribution established by distance and pheromone ...time the ant k visits the ... See full document

8

Contributions to the single and multiple vehicle routing problem with deliveries and selective pickup

Contributions to the single and multiple vehicle routing problem with deliveries and selective pickup

... In the Single Vehicle Routing Problem with Deliveries and Selective Pickups (SVR- PDSP) there are a set of customers to be served and a depot from where a vehicle departs to serve the ... See full document

87

RouteSpray: A multiple-copy routing algorithm based on transit routes

RouteSpray: A multiple-copy routing algorithm based on transit routes

... presented. The main difference among these protocols is the infor- mation they consider in routing (history of contacts among nodes, location information, ...and the strategy they use to ... See full document

8

Branch-and-Cut and GRASP with Hybrid Local Search for the Multi-Level Capacitated Minimum Spanning Tree Problem

Branch-and-Cut and GRASP with Hybrid Local Search for the Multi-Level Capacitated Minimum Spanning Tree Problem

... for the Multi-Level Capacitated Minimum Spanning Tree ...use the branch-and-cut within GRASP to evaluate subproblems during the ...search. The computational experiments conducted have ... See full document

5

Multipath inter-domain policy routing

Multipath inter-domain policy routing

... designed with the separation of routing protocol into policy and al- gorithm in ...by the algebraic routing model community as a systematic way to analyse a routing protocol and ... See full document

180

A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls

A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls

... (2008), the authors examined multiobjective versions of several variants of the Vehicle Routing Problem (VRP) in terms of their objectives, their characteristics and the types of ... See full document

14

Elementary Investigation of Transportation Problems

Elementary Investigation of Transportation Problems

... remove the latter (thus the critical number decreases by 1). The remaining elements form a basis for the remaining array, as they do not contain a loop and they are of a sufficient ...among ... See full document

24

REPOSITORIO INSTITUCIONAL DA UFOP: A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem.

REPOSITORIO INSTITUCIONAL DA UFOP: A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem.

... Vehicle Routing Problem (MDVRP) is an important variant of the classical Vehicle Routing Problem (VRP), where the customers can be served from a number of ...minimize the ... See full document

14

Feedback-based, system-level properties of vertebrate-microbial interactions.

Feedback-based, system-level properties of vertebrate-microbial interactions.

... together with bacteriological test results (Figures 2 A, B), showed patterns similar to those observed in birds, such as a single line of data points, circularity and directionality (arrows, Figure 2 ...While ... See full document

16

Substructural local search in discrete estimation of distribution algorithms

Substructural local search in discrete estimation of distribution algorithms

... at the performance achieved by BOA as a function of a parameter that determines the maximum number of incoming edges for each ...on the number of parents for each variable, simplifying the ... See full document

192

Problema de Roteamento de Veículos – Vehicle Routing Problem (VRP)

Problema de Roteamento de Veículos – Vehicle Routing Problem (VRP)

... geograficamente dispersas, encontrar o melhor conjunto de rotas para atender todos os. clientes[r] ... See full document

45

Show all 10000 documents...