Locating Depots for Capacitated Vehicle Routing

We study a location-routing problem in the context of capacitated vehicle routing. The input is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for this problem. To achieve this result, we reduce to the k-median-forest problem, which generalizes both k-median and minimum spanning tree, and which might be of independent interest. We give a (3+c)-approximation algorithm for k-median-forest, which leads to a (12+c)-approximation algorithm for the above location-routing problem, for any constant c>0. The algorithm for k-median-forest is just t-swap local search, and we prove that it has locality gap 3+2/t; this generalizes the corresponding result known for k-median. Finally we consider the "non-uniform" k-median-forest problem which has different cost functions for the MST and k-median parts. We show that the locality gap for this problem is unbounded even under multi-swaps, which contrasts with the uniform case. Nevertheless, we obtain a constant-factor approximation algorithm, using an LP based approach.Comment: 12 pages, 1 figur

A real delivery problem dealt with Monte Carlo techniques

[EN] In this paper we use Monte Carlo Techniques to deal with a real world delivery problem of a food company in Valencia (Spain). The problem is modeled as a set of 11 instances of the well known Vehicle Routing Problem, VRP, with additional time constraints. Given that VRP is a NP-hard problem, a heuristic algorithm, based on Monte Carlo techniques, is implemented. The solution proposed by this heuristic algorithm reaches distance and money savings of about 20% and 5% respectively.This research was partially supported by MICINN, Project MTM2013-43540-P and by UPV, Project Programa de Apoyo a la Investigación y Desarrollo de la UPV PAID-06-12.S577181Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1998), A heuristic algorithm based on Monte Carlo methods for the Rural Postman Problem.Computers and Op. Research,25, No. 12, pp. 1097–1106, 1998.Fernández de Córdoba, P. and L.M. García-Raffi, E. Nieto and J.M. Sanchis Llopis (1999a), Aplicación de técnicas Monte Carlo a un problema real de Rutas de Vehículos.Anales de Ingeniería, Colombia. In press.Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1999b), A Constructive Parallel Algorithm based on Monte Carlo techniques for Routing Problems, Submitted toParallel Computers.Laporte, G. (1992), The Vehicle Routing Problem: an overview of exact and approximate algorithms,European Journal of Operations Research,59, 345.Laporte, G., M. Desrochers and Y. Nobert (1985), “Optimal Routing under Capacity and Distance Restrictions.Operations Research,33, pp. 1050–1073.Laporte G. and Y. Nobert (1987), Exact algorithms for The Vehicle Routing Problem,Surveys in Combinatorial Optimization (S. Martello, G. Laporte, M. Minoux and C. Ribeiro Eds.). North-HollandAmsterdamMayado, A. (1998), Organización de los itinerarios de la flota de camiones de reparto de una sociedad cooperativa. Optimización mediante técnicas de simulación Monte Carlo. Proyecto Fin de Carrera. E.T.S.I.I. Universidad Politécnica de Valencia

Dynamic routing problems with fruitful regions: models and evolutionary computation

We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to maximise the number of loads transported, while keeping to capacity and time constraints. Loads arrive while the problem is being solved, which makes it a real-time routing problem. The solver is a self-adaptive evolutionary algorithm that ensures feasible solutions at all times. We investigate under what conditions the exploration of fruitful regions improves the effectiveness of the evolutionary algorith

EAGLE multi-object AO concept study for the E-ELT

EAGLE is the multi-object, spatially-resolved, near-IR spectrograph instrument concept for the E-ELT, relying on a distributed Adaptive Optics, so-called Multi Object Adaptive Optics. This paper presents the results of a phase A study. Using 84x84 actuator deformable mirrors, the performed analysis demonstrates that 6 laser guide stars and up to 5 natural guide stars of magnitude R<17, picked-up in a 7.3' diameter patrol field of view, allow us to obtain an overall performance in terms of Ensquared Energy of 35% in a 75x75 mas^2 spaxel at H band, whatever the target direction in the centred 5' science field for median seeing conditions. The computed sky coverage at galactic latitudes |b|~60 is close to 90%.Comment: 6 pages, to appear in the proceedings of the AO4ELT conference, held in Paris, 22-26 June 200

The QCD string and the generalised wave equation

The equation for QCD string proposed earlier is reviewed. This equation appears when we examine the gonihedric string model and the corresponding transfer matrix. Arguing that string equation should have a generalized Dirac form we found the corresponding infinite-dimensional gamma matrices as a symmetric solution of the Majorana commutation relations. The generalized gamma matrices are anticommuting and guarantee unitarity of the theory at all orders of $v/c$. In the second quantized form the equation does not have unwanted ghost states in Fock space. In the absence of Casimir mass terms the spectrum reminds hydrogen exitations. On every mass level $r=2,4,..$ there are different charged particles with spin running from $j=1/2$ up to $j_{max}=r-1/2$, and the degeneracy is equal to $d_{r}=2r-1 = 2j_{max}$. This is in contrast with the exponential degeneracy in superstring theory.Comment: 11 pages LaTeX, uses lamuphys.sty and bibnorm.sty,; Based on talks given at the 6th Hellenic School and Workshop on Elementary Particle Physics, Corfu, Greece, September 19-26, 1998 and at the International Workshop "ISMP", Tbilisi, Georgia, September 12-18, 199

Multiwavelength characterisation of an ACT-selected, lensed dusty star-forming galaxy at z=2.64

We present \ci\,(2--1) and multi-transition $^{12}$CO observations of a dusty star-forming galaxy, ACT\,J2029+0120, which we spectroscopically confirm to lie at $z$\,=\,2.64. We detect CO(3--2), CO(5--4), CO(7--6), CO(8--7), and \ci\,(2--1) at high significance, tentatively detect HCO$^{+}$(4--3), and place strong upper limits on the integrated strength of dense gas tracers (HCN(4--3) and CS(7--6)). Multi-transition CO observations and dense gas tracers can provide valuable constraints on the molecular gas content and excitation conditions in high-redshift galaxies. We therefore use this unique data set to construct a CO spectral line energy distribution (SLED) of the source, which is most consistent with that of a ULIRG/Seyfert or QSO host object in the taxonomy of the \textit{Herschel} Comprehensive ULIRG Emission Survey. We employ RADEX models to fit the peak of the CO SLED, inferring a temperature of T$\sim$117 K and $n_{\text{H}_2}\sim10^5$ cm$^{-3}$, most consistent with a ULIRG/QSO object and the presence of high density tracers. We also find that the velocity width of the \ci\ line is potentially larger than seen in all CO transitions for this object, and that the $L'_{\rm C\,I(2-1)}/L'_{\rm CO(3-2)}$ ratio is also larger than seen in other lensed and unlensed submillimeter galaxies and QSO hosts; if confirmed, this anomaly could be an effect of differential lensing of a shocked molecular outflow.Comment: Accepted for publication in Ap

Travelling on Graphs with Small Highway Dimension

We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al. [SODA 2010] as a model for transportation networks, on which TSP and STP naturally occur for various applications in logistics. It was previously shown [Feldmann et al. ICALP 2015] that these problems admit a quasi-polynomial time approximation scheme (QPTAS) on graphs of constant highway dimension. We demonstrate that a significant improvement is possible in the special case when the highway dimension is 1, for which we present a fully-polynomial time approximation scheme (FPTAS). We also prove that STP is weakly NP-hard for these restricted graphs. For TSP we show NP-hardness for graphs of highway dimension 6, which answers an open problem posed in [Feldmann et al. ICALP 2015]

Dynamic Collection Scheduling Using Remote Asset Monitoring: Case Study in the UK Charity Sector

Remote sensing technology is now coming onto the market in the waste collection sector. This technology allows waste and recycling receptacles to report their fill levels at regular intervals. This reporting enables collection schedules to be optimized dynamically to meet true servicing needs in a better way and so reduce transport costs and ensure that visits to clients are made in a timely fashion. This paper describes a real-life logistics problem faced by a leading UK charity that services its textile and book donation banks and its high street stores by using a common fleet of vehicles with various carrying capacities. Use of a common fleet gives rise to a vehicle routing problem in which visits to stores are on fixed days of the week with time window constraints and visits to banks (fitted with remote fill-monitoring technology) are made in a timely fashion so that the banks do not become full before collection. A tabu search algorithm was developed to provide vehicle routes for the next day of operation on the basis of the maximization of profit. A longer look-ahead period was not considered because donation rates to banks are highly variable. The algorithm included parameters that specified the minimum fill level (e.g., 50%) required to allow a visit to a bank and a penalty function used to encourage visits to banks that are becoming full. The results showed that the algorithm significantly reduced visits to banks and increased profit by up to 2.4%, with the best performance obtained when the donation rates were more variable

Developing Organ Offer and Acceptance Measures: When ‘Good’ Organs Are Turned Down

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/75521/1/j.1600-6143.2007.01784.x.pd

Maxwell equations in matrix form, squaring procedure, separating the variables, and structure of electromagnetic solutions

The Riemann -- Silberstein -- Majorana -- Oppenheimer approach to the Maxwell electrodynamics in vacuum is investigated within the matrix formalism. The matrix form of electrodynamics includes three real 4 \times 4 matrices. Within the squaring procedure we construct four formal solutions of the Maxwell equations on the base of scalar Klein -- Fock -- Gordon solutions. The problem of separating physical electromagnetic waves in the linear space \lambda_{0}\Psi^{0}+\lambda_{1}\Psi^{1}+\lambda_{2}\Psi^{2}+ lambda_{3}\Psi^{3} is investigated, several particular cases, plane waves and cylindrical waves, are considered in detail.Comment: 26 pages 16 International Seminar NCPC, May 19-22, 2009, Minsk, Belaru