• No se han encontrado resultados

A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem

N/A
N/A
Protected

Academic year: 2020

Share "A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem"

Copied!
16
0
0

Texto completo

Loading

Referencias

Documento similar

Abstract This paper addresses the problem of finding a static virtual topology design and flow routing in transparent optical WDM networks under a time-varying (multi-hour) traffic

considered as a crucial challenge in WSNs and there is a trade-off between energy-efficiency and QoS parameters [1, 3-5]. On the other hand, non- uniform energy consumption and

Within a time frame with a given demand data, competition is seen as a game with two players (one airline and all its competitors), where the strategies are all the

The factors that condition these differences are mainly: (1) the specific vehicle fleet composition, having Barcelona a larger proportion of diesel and commercial vehicles and

This result in under performance in highly dynamic networks as junction selection mechanism should be dynamic based on vehicular traffic, road width, shortest path, and other

In TREBOL, the upstream tree (i.e., the tree used in the forwarding of data packets from the vehicle to the Internet) is built and updated when each node learns about its parent

The RSG sends standard Router Advertisements (RAs) messages, con- taining the prefix(es) allocated to the TREBOL area, and have the on-link flag (L) unset [9]. The two

A vehicle routing problem with stochastic and fuzzy demands (VRP-S/F-D), a team orienteering problem with stochastic and fuzzy travel times (TOP-S/F-TT), and a location routing