We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus. Specifically, for any P N, our algorithm routes any permutation of N elements on a P-processor model optimally in O( P) steps. This algorithm extends naturally to one for routing h-relations optimally in O(h) steps. ...

We present a non standard Euclidean vehicle routing problem adding a level of clustering, and we revisit the use of self-organizing maps as a tool which naturally handles such problems. We present how they can be used as a main operator into an evolutionary algorithm to address two conflicting objectives of route length and distance from customers to bus stops minimization and to deal with capa...

The Rural Postman Problem (RPP) consists of determining a minimum cost tour of a specified arc set of a graph (G=(V,A)) with the particularity that only a subset T (T ⊆ A) of arcs is required to be traversed at least once. The arcs can be directed, undirected or both. This problem appears in a variety of practical contexts like mail, fuel and newspaper deliveries, school bus routing, electrical...

To evaluate the layout adjustment scheme of bus line during subway construction, the method combining quantitative survey and fuzzy aggregation is used. One criterion is transit service level, which considered nonlinear coefficient, line length, transfer distance and average waiting time. Another criterion is traffic impact degree incorporating three factors: saturation degree on work-zone sect...

The task of computing binary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable VLSI architecture for the BPS problem. We adopt as the central theme of this effort, the recognition of the fact that the broadcast delay incurred by a signal propagating along a bus is, at best, linear in the distance...

one of methods of improvement of the material flow is cross docking that in is considered as a good method to reduce inventory and improve customer satisfaction. too, the vehicle routing problem is one of the important problems in distribution management and its goal is to find paths for delivering various cargos. therefore, this study was conducted in order to vehicle routing problem with cros...

16 A Bi-Objective Vehicle Routing Problem with Time Window by Considering Customer Satisfaction; Masoud Rabbani, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Mahyar Taheri, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Mohammad Ravanbakhsh, School of Industrial Engineering, College of Engineering, Uni...

We study real-time routing policies in smart transit systems, where the platform has a combination of cars and high-capacity vehicles (e.g., buses or shuttles) seeks to serve set incoming trip requests. The can use its fleet as feeder connect passengers fleet, which operates on fixed routes. Our goal is find optimal (bus) routes corresponding frequencies maximize social welfare system given tim...