• Nenhum resultado encontrado

[PDF] Top 20 A Clustering Approach for Vehicle Routing Problems with Hard Time Windows

Has 10000 "A Clustering Approach for Vehicle Routing Problems with Hard Time Windows" found on our website. Below are the top 20 most common "A Clustering Approach for Vehicle Routing Problems with Hard Time Windows".

A Clustering Approach for Vehicle Routing Problems with Hard Time Windows

A Clustering Approach for Vehicle Routing Problems with Hard Time Windows

... of problems: a class of clustered problems whose requests form geographical clusters; a class of random problems, whose requests are randomly scattered; a class that combines both clustered and ... See full document

70

Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows

Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows

... This study presents a genetic algorithm that uses an optimized crossover operator to solve the vehicle routing problem with time windows. The proposed algorithm has been tested against ... See full document

7

Planning of vehicle routing with backup provisioning using wireless sensor technologies

Planning of vehicle routing with backup provisioning using wireless sensor technologies

... open vehicle routing problem (OVRP), attracted the attention of practitioners and ...real-world problems, like the planning of train services or bus routes (see [10]), or when industries do not own a ... See full document

22

Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem

Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem

... This approach significantly differs from current applications that combine GAs and DM because, until now, most of the efforts deal with the development of GAs as optimization methods to solve DM ... See full document

8

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

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

... network clustering is to divide a network into different clusters based on certain ...planning vehicle routes from these depots to geographically scattered customers ...interdependent problems have ... See full document

12

Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach

Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach

... test problems, SA and GA are ...compared with each other and LINGO ...computational time is evaluated in some randomly generated ...compared with the optimal solutions obtained from LINGO ... See full document

20

Modelos e algoritmos para problemas integrados de distribuição e roteamento (Models and algorithms for the integrated routing and distribution problems)

Modelos e algoritmos para problemas integrados de distribuição e roteamento (Models and algorithms for the integrated routing and distribution problems)

... dealt with VRPCD is the assumption that vehicles must stop at the CD after the requests are collected from ...the vehicle collects and delivers the same ...same time, frees space and resources at the ... See full document

136

Contributions to the single and multiple vehicle routing problems with deliveries and selective pickups

Contributions to the single and multiple vehicle routing problems with deliveries and selective pickups

... along with the frequency it has appeared in the solutions already ana- ...first time an approach combining a heuristic and a data mining algorithm is proposed for a vehicle routing ... See full document

89

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

... VRPTW with time-dependent travel-times, where the travel-times between two locations depend on both the distance and the time of the ...heuristic approach based on the Tabu Search and ... See full document

10

Route Elimination Heuristic for Vehicle Routing Problem with Time Windows

Route Elimination Heuristic for Vehicle Routing Problem with Time Windows

... Many computation trials were made to check this model on the Solomon problems, although trials were possible only on those problem instances where the initial number of routes were more then the ever found best ... See full document

13

A matheuristic for the consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector

A matheuristic for the consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector

... relationship with the customer and operate on a tight delivery lead time have the most benefits to withdraw from using a delivery system with consistent ...customers, with pharmaceutical and ... See full document

68

13 Logistics: The Vehicle Routing Problem

13 Logistics: The Vehicle Routing Problem

... for problems, since solving it is equiv- alent to solving multiple TSP problems at once ...including time windows re- strictions –VRPTW– (customers must be supplied following a certain ... See full document

12

Application of Harmony Search to Vehicle Routing

Application of Harmony Search to Vehicle Routing

... analogy with music improvisation process where musicians in an ensemble continue to polish their pitches in order to obtain better harmony [9] ...optimization problems such as truss structure design, pipe ... See full document

6

Energy Efficient Adaptive Protocol for Clustered Wireless Sensor Networks

Energy Efficient Adaptive Protocol for Clustered Wireless Sensor Networks

... and with LEACH protocol in under the continuous delivery ...considered with small (100x100) ...the time of the first node failure is a meaningful measurement in the sense that a single node failure ... See full document

6

Nearest neighbors with operating time constraints and optimal sequenced route queries in timedependent road Networks

Nearest neighbors with operating time constraints and optimal sequenced route queries in timedependent road Networks

... operating time of facilities is taken into ...in time- dependent road networks has been studied in previous ...long time for these POIs to open from the moment they are ...the time for one to ... See full document

76

Clustering of variables with a three-way approach for health sciences

Clustering of variables with a three-way approach for health sciences

... individuals with the set of ...associated with four different aggregation criteria: two empirical ― single link and com- plete link ― and two probabilistic criteria ― Aggregation Validity Link (AVL) and ... See full document

13

Ant Colony Optimization for Capacitated Vehicle Routing Problem

Ant Colony Optimization for Capacitated Vehicle Routing Problem

... 847 by the real life behavior of ants foraging for food. During the search for food from their nest to the food source, it was found that a moving ant will lay a chemical substance called pheromone on the trail. The ... See full document

7

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

Comparison of Cell formation techniques in Cellular manufacturing using three cell formation algorithms

Comparison of Cell formation techniques in Cellular manufacturing using three cell formation algorithms

... In the present era of globalization and competitive market, cellular manufacturing has become a vital tool for meeting the challenges of improving productivity, which is the way to sustain growth. Getting best results of ... See full document

4

On the Support of Multimedia Applications over Wireless Mesh Networks

On the Support of Multimedia Applications over Wireless Mesh Networks

... of routing protocols based clusters, whose principle is very simple: divide the whole network into several parts, each party will elect a central node, responsible for coordination of routing information ... See full document

17

Show all 10000 documents...