Search results for "routing"
showing 7 items of 587 documents
Two-phase routing in three-dimensional blocked optical tori
2014
The contribution of this paper is an all-optical 3D network architecture. We describe scheduled, two-phase routing for it. The three-dimensional blocked optical torus BOT of block size b consists of b2 × b2 × b2 nodes for the first phase routing. Processors are evenly deployed at the underlying torus so that every bth node consists of a processor. Additionally, a BOT consists of b3 blocks of b × b × b subnetworks for the second phase routing. Routing of each packet is done in two phases. Firstly, packets are routed from source processor to an intermediate target node at the target block. Secondly, packets are routed from the intermediate targets at the target block to the target processor (…
Feature Extractors for Describing Vehicle Routing Problem Instances
2016
The vehicle routing problem comes in varied forms. In addition to usual variants with diverse constraints and specialized objectives, the problem instances themselves – even from a single shared source - can be distinctly different. Heuristic, metaheuristic, and hybrid algorithms that are typically used to solve these problems are sensitive to this variation and can exhibit erratic performance when applied on new, previously unseen instances. To mitigate this, and to improve their applicability, algorithm developers often choose to expose parameters that allow customization of the algorithm behavior. Unfortunately, finding a good set of values for these parameters can be a tedious task that…
Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm
2019
Tensor decomposition is a powerful tool for analyzing multiway data. Nowadays, with the fast development of multisensor technology, more and more data appear in higherorder (order > 4) and nonnegative form. However, the decomposition of higher-order nonnegative tensor suffers from poor convergence and low speed. In this study, we propose a new nonnegative CANDECOM/PARAFAC (NCP) model using proximal algorithm. The block principal pivoting method in alternating nonnegative least squares (ANLS) framework is employed to minimize the objective function. Our method can guarantee the convergence and accelerate the computation. The results of experiments on both synthetic and real data demonstrate …
Computer aided scheduling and routing of vehicle-carrier fleet—a case study
2016
This paper presents a case study of development of an information system for a large enterprise from vehicle-transport industry. A novel optimization model and algorithms developed to solve scheduling and routing of vehicle-carrier fleet are presented and discussed. Carried out qualitative experiments confirmed the usability of developed user-guided search paradigm and high performance of autonomous algorithmic solution search methods.
A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
2006
Abstract This work deals with a dynamic dial-a-ride problem with time window constraints. In particular, new unplanned requests for service may arise at a vehicle stop and the driver must decide in real-time whether to accept or reject them. For this problem, we have developed a two-phase insertion algorithm based on route perturbations: the first phase, which is run off-line when the vehicle moves between two successive stops, aims at creating a feasible neighborhood of the current route; while the second phase, which is run in real-time every time a new request occurs, inserts, when possible, the delivery stop of the new customer in the current route.
Minimizing fleet operating costs for a container transportation company
2006
Abstract This paper focuses on a fleet management problem that arises in container trucking industry. From the container transportation company perspective, the present and future operating costs to minimize can be divided in three components: the routing costs, the resource (i.e., driver and truck) assignment costs and the container repositioning costs (i.e., the costs of restoring a given container fleet distribution over the serviced territory, as requested by the shippers that own the containers). This real-world problem has been modeled as an integer programming problem. The proposed solution approach is based on the decomposition of this problem in three simpler sub-problems associate…