This paper deals with a long distance routing problem. The aim is to improve the use of the resources in order to reduce the distance. In this way of transport are known three kinds of pure distribution strategies: many to many, the trips are full truckload or the time restrictions are very tight, so they are direct shipments; the second one is known as peddling, in this case, closed collecting...

In the real world, mobile users routinely move in between and spend a considerable amount of time at a few specific places of social interest. For example, a regular day in the life of a professor may involve routine visits to his/her office, a classroom or a conference room, while spending considerable amount of time in each of these venues. Thus, although it is hard to keep track of an user a...

One of the most important problems for distribution companies is to find the best locations for depots and to find proper routes for transportation vehicles and to optimize supply network. This study intends to develop a model for the problem of location-routing in post offices. So, a new Bi-Objective Location-Routing Problem for Locating Town Post Office and Routing Parcels is defined. This pr...

An Intermittently Connected Network (ICN) is often modeled as a weighted graph, where the capacities and durations of edges (radio links) between nodes (users) are time varying due to user mobility. As such, there is no guarantee of a contemporaneous end-to-end path from the source to the destination through intermediary peers. This sets an ICN 1 strictly apart from a conventional mobile ad hoc...

In this paper, we consider the design of large-scale hub-and-spoke transportation networks in a competitive environment. We adopt the hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for passengers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given that the follower firm w...

This paper studies capacitated single-allocation hub covering location problem with fuzzy cover radius and travel time. Objective of hub covering problem is to find the minimum number of hubs considering the maximum allowable travel time. Computational results show that due to uncertainty, number of hubs and the allocation of non-hub nodes to hub nodes are changed. This paper proposes heuristic...