The analysis of a bi-dimensional dynamic routing model for alternative routing telecommunication networks led to the identification of an instability problem in the synchronous path selection associated with the complex interdependencies among the coefficients of the objective functions and the computed paths for every node pair. In this paper an analytical model enabling to make explicit this ...

In multi-echelon distribution strategy freight is delivered to customers via intermediate depots. Rather than using direct shipments, this strategy is an increasingly popular one in urban logistics. This is primarily to alleviate the environmental (e.g., energy usage and congestion) and social (e.g., traffic-related air pollution, accidents and noise) consequences of logistics operations. This ...

This paper presented an approach to solve Cluster Real Time Vehicle Routing Problem with Time Window (CRTVRPTW) in different scenarios. The objectives of the problem was to find routes for vehicles to service all the customers at a minimal cost in terms of number of vehicles, total travel distance, total time and vehicle refueling. This paper tries to address this issue by proposing an original...

In this paper a general approach to gate array routing is presented, based on an abstract routing space model. An efficient k–terminal net maze runner is described. It does not partition nets into 2–terminal net routing problems, but solves the problem by simultaneously growing k search waves. It is shown that the explored routing space diminishes when compared to bi–directional routing schemes...

The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with soft time windows. The work is motivated by the question, if and how the problem structure influences the effectiveness of different configurations of the genetic algorithm. Computational results...

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...

This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost.  In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...

an integrated model considers all parameters and elements of different deficiencies in one problem. this paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (lri) problem. this model also considers stochastic demands ...

Unlike widely available literatures in hazardous material (HAZMAT) transportation that basically aim at finding non dominated paths for a given origin-destination pair, our main focus in this study is on vehicle routing problem with time window (VRPTW) aspect of HAZMAT transportation problem that has received very less attention in literatures. We present a new multi-objective optimization mode...

This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...