The Vehicle Routing Problem with Backhauls is a generalization of the ordinary capacitated vehicle routing problem where goods are delivered from the depot to the linehaul customers, and additional goods are brought back to the depot from the backhaul customers. Numerous ways of modeling the backhaul constraints have been proposed in the literature, each imposing different restrictions on the h...

The purpose of this paper is to describe industrial aspects of combined fleet composition and routing in maritime and road-based transportation, and to present the current status of research in the form of a comprehensive literature review. With a backdrop of industrial aspects, a categorized survey of relevant literature since the first published papers in the 1950’s is given. First, the liter...

This paper introduces the fleet size and mix location-routing problem with time windows (FSMLRPTW) which extends the location-routing problem by considering a heterogeneous fleet and time windows. The main objective is to minimize the sum of vehicle fixed cost, depot cost and routing cost. We present mixed integer programming formulations, a family of valid inequalities and we develop a powerfu...

The purpose of this talk is to describe industrial aspects of combined fleet composition and routing in maritime and road-based transportation, and to present the current status of research in the form of a comprehensive literature review. With a backdrop of industrial aspects, a categorized survey of relevant literature since the first published papers in the 1950’s is given. First, the litera...

AIM Workload Mixes • Domain Server Mix “typical” for Enterprise shared servers (50 tests) – Email Network routing – Spreadsheets Word Processing – File Transfers Network Maintenance • File Server Mix (37 tests) – different size file transfers (synch & asynch) – network routing security checking – heavy memory use IPC calls • Custom User Mix – varying the mix to model your applications – add C-s...

A user is only anonymous within a set of other users. Hence, the core functionality of an anonymity providing technique is to establish an anonymity set. In open environments, such as the Internet, the established anonymity sets in the whole are observable and change with every anonymous communication. We use this fact of changing anonymity sets and present a model where we can determine the pr...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...

in this paper we address the vrpcd, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. the products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. the objective of the vrpcd is to minimize the total traveled distance while respe...

the vehicle routing problem with backhauls (vrpb) as an extension of the classical vehicle routing prob-lem (vrp) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. a primary objective for the problem usually is minimizing the total distribution cost. most real-life problems have othe...