53 research outputs found
Parallel 2-Opt Local Search on GPU
To accelerate the solution for large scale traveling
salesman problems (TSP), a parallel 2-opt local search algorithm
with simple implementation based on Graphics Processing Unit
(GPU) is presented and tested in this paper. The parallel scheme is
based on technique of data decomposition by dynamically assigning
multiple K processors on the integral tour to treat K edges’ 2-opt
local optimization simultaneously on independent sub-tours, where
K can be user-defined or have a function relationship with input size
N. We implement this algorithm with doubly linked list on GPU.
The implementation only requires O(N) memory. We compare this
parallel 2-opt local optimization against sequential exhaustive 2-opt
search along integral tour on TSP instances from TSPLIB with more
than 10000 cities
Multi-Agent Environment for Modelling and Solving Dynamic Transport Problems
The transport requirements in modern society are becoming more and more important. Thus, offered transport services need to be more and more advanced and better designed to meet users demands. Important cost factors of many goods are transport costs. Therefore, a reduction of costs, a better adjustment of strategies to the demand as well as a better planning and scheduling of available resources are important for the transport companies. This paper is aimed at modelling and simulation of transport systems, involving a dynamic Pickup and Delivery problem with Time Windows and capacity constraints (PDPTW). PDPTW is defined by a set of transport requests which should be performed while minimising costs expressed by the number of vehicles, total distance and total travel time. Each request is described by two locations: pickup and delivery, periods of time when the operations of pickup or delivery can be performed and a load to be transported. The nature of this problem, its distribution and the possibility of using a lot of autonomous planning modules, lead us to use a multi-agent approach. Our approach allows the modeling of entities which do not appear in the classical PDPTW such as company organisation, communication among vehicles, interactions between vehicles and company dispatcher or different strategies of requests acceptation by different vehicles. This paper presents also a software environment and experimentations to validate the proposed approach
Intravascular lymphoma presenting as a specific pulmonary embolism and acute respiratory failure: a case report
This is an Open Access article distributed under the terms of the Creative Commons Attribution Licens
Dynamic vehicle routing problems: Three decades and counting
Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing a real explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy of DVRP papers according to 11 criteria. These are (1) type of problem, (2) logistical context, (3) transportation mode, (4) objective function, (5) fleet size, (6) time constraints, (7) vehicle capacity constraints, (8) the ability to reject customers, (9) the nature of the dynamic element, (10) the nature of the stochasticity (if any), and (11) the solution method. We comment on technological vis-à-vis methodological advances for this class of problems and suggest directions for further research. The latter include alternative objective functions, vehicle speed as decision variable, more explicit linkages of methodology to technological advances and analysis of worst case or average case performance of heuristics.© 2015 Wiley Periodicals, Inc
NCC Based Correspondence Problem for First- and Second-Order Graph Matching
Automatically finding correspondences between object features in images is of main interest for several applications, as object detection and tracking, identification, registration, and many derived tasks. In this paper, we address feature correspondence within the general framework of graph matching optimization and with the principal aim to contribute. We proposed two optimized algorithms: first-order and second-order for graph matching. On the one hand, a first-order normalized cross-correlation (NCC) based graph matching algorithm using entropy and response through Marr wavelets within the scale-interaction method is proposed. First, we proposed a new automatic feature detection processing by using Marr wavelets within the scale-interaction method. Second, feature extraction is executed under the mesh division strategy and entropy algorithm, accompanied by the assessment of the distribution criterion. Image matching is achieved by the nearest neighbor search with normalized cross-correlation similarity measurement to perform coarse matching on feature points set. As to the matching points filtering part, the Random Sample Consensus Algorithm (RANSAC) removes outliers correspondences. One the other hand, a second-order NCC based graph matching algorithm is presented. This algorithm is an integer quadratic programming (IQP) graph matching problem, which is implemented in Matlab. It allows developing and comparing many algorithms based on a common evaluation platform, sharing input data, and a customizable affinity matrix and matching list of candidate solution pairs as input data. Experimental results demonstrate the improvements of these algorithms concerning matching recall and accuracy compared with other algorithms
- …