Search results for "routing"
showing 10 items of 587 documents
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
2019
Abstract The vehicle-routing problem with private fleet and common carrier (VRPPC) extends the capacitated VRP by considering the option of outsourcing customers to subcontractors at a customer-dependent cost instead of serving them with the private fleet. The VRPPC has important applications in small package shipping and manufacturing, but despite its relevance, no exact solution approach has been introduced so far. We propose a branch-price-and-cut algorithm that is able to solve small to medium-sized instances and provides tight lower bounds for larger instances from the literature. In addition, we develop a large neighborhood search that shows a decent solution quality and competitive r…
New Results on the Mixed General Routing Problem
2005
[EN] In this paper, we deal with the polyhedral description and the resolution of the Mixed General Routing Problem. This problem, in which the service activity occurs both at some of the nodes and at some of the arcs and edges of a mixed graph, contains a large number of important arc and node routing problems as special cases. Here, a large family of facet-defining inequalities, the Honeycomb inequalities, is described. Furthermore, a cutting-plane algorithm for this problem that incorporates new separation procedures for the K-C, Regular Path-Bridge, and Honeycomb inequalities is presented. Branch and bound is invoked when the final solution of the cutting-plane procedure is fractional. …
Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment
2018
In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into ac…
Nash Equilibrium in a Road Network with Many Groups of Users
2019
In this chapter concentrates on the relationships between individual and group behaviour of drivers in a road network. Such relationships are established by comparing the optimal routing of drivers (system optimum of Wardrop), the competitive drivers’ groups routing (Nash equilibrium), and the selfish drivers routing (user equilibrium of Wardrop). Thus, the boundary conditions for traffic assignment in a road network were recently obtained for the first time. Wide analytical discussion on the topic as well as a survey of relevant references are presented. Moreover, a new behavioural model of traffic assignment in case of simultaneous selfish and group behaviour of drivers in a road network …
The Vector QD Algorithm for Smooth Functions (f, f′)
1996
AbstractWe deal with the functionz↦(f(z), f′(z)) wheref(z)=∑i⩾0aizi, (ai∈C) with limi→∞ai+1×ai−1/(ai)2=q. We investigate the convergence of the vector QD algorithm. We give the asymptotic behaviour of the generalized Hankel determinants. A convergence result on the vector orthogonal polynomials is proved.
Convergence of subdifferentials and normal cones in locally uniformly convex Banach space
2014
International audience; In this paper we study the behaviour of normal cones and subdifferentials with respect to two types of convergence of sets and functions: Mosco and Attouch–Wets convergences. Our analysis is devoted to proximal, Fréchet, and Mordukhovich limiting normal cones and subdifferentials. The results obtained can be seen as extensions of the Attouch theorem to the context of non-convex functions on locally uniformly convex Banach space. They also generalize, to sequences of subsmooth sets or functions, various results in the literature.
The Heterogeneous Fleet Vehicle Routing Problem with Draft Limits
2023
Over the past two decades, international maritime transport has been characterized by the advent of ever larger ships. This phenomenon is known as naval gigantism. If, on the one hand, naval gigantism allows to reduce transport costs by exploiting the economies of scale achievable by large ships, on the other hand, it implies a series of operational issues. Indeed, due to their large draft, such giant vessels are not allowed to enter small ports when fully or near-fully loaded, and in some cases, they cannot enter such small ports at all. In fact, their draft can strongly vary depending on the load on board. This implies restrictions for vessels in accessing ports, which impact not only at …
A matheuristic for the Team Orienteering Arc Routing Problem
2015
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…
The McShane, PU and Henstock integrals of Banach valued functions
2002
Some relationships between the vector valued Henstock and McShane integrals are investigated. An integral for vector valued functions, defined by means of partitions of the unity (the PU-integral) is studied. In particular it is shown that a vector valued function is McShane integrable if and only if it is both Pettis and PU-integrable. Convergence theorems for the Henstock variational and the PU integrals are stated. The families of multipliers for the Henstock and the Henstock variational integrals of vector valued functions are characterized.
Evaluation of a Real, Low Cost, Urban WSN Deployment for Accurate Environmental Monitoring
2011
There are many areas where Wireless Sensor Networks (WSN) can offer innovative solutions for environmental monitoring applications and the meteorological community, but due to their complexity in terms of energy constraints and low performance devices, very few real deployments can be found. In this paper we will explain in detail the design, implementation and performance evaluation of a sparse WSN that has been working maintenance-free for over 12 months. The network has been designed for environmental monitoring purposes, and several motes, attached to lampposts, accurately measure the Temperature and Relative Humidity at various locations in a local street. Our contribution is an enhanc…