Results 51 to 60 of about 250 (77)
A new algorithm for the 2-period Balanced Traveling Salesman Problem in Euclidean graphs [PDF]
In a previous paper, we proposed two heuristic algorithms for the euclidean 2-period Balanced Travelling Salesman Problem (2B-TSP). In this problem, which arises from a similar one introduced by Butler et al., a certain number of customers must be ...
Francesco Mason, Tatiana Bassetto
core
Combinatorics and Geometry of Transportation Polytopes: An Update [PDF]
, 2013 A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries.
De Loera, Jesús A., Kim, Edward D.
core
Optimal Fleet Composition via Dynamic Programming and Golden Section Search [PDF]
, 2011 In this paper, we consider an optimization problem arising in vehicle fleet management. The problem is to construct a heterogeneous vehicle fleet in such a way that cost is minimized subject to a constraint on the overall fleet size.
A. Hoff +10 more
core +1 more source
Elasticidad precio de la demanda y perfil de los usuarios de la parada "Pablo de Olavide" de metro de Sevilla [PDF]
, 2014 In this paper the most relevant results obtained in a survey conducted by 300 users of the "Pablo de Olavide" Seville metro stop are presented. The aim of the paper is twofold.
García Cobián, Emilio Carlos +1 more
core
Ramified optimal transportation in geodesic metric spaces
, 2009 An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels, draining and ...
Xia, Qinglan
core
Integrating network design and frequency setting in public transportation networks : a survey [PDF]
, 2014 This work reviews the literature on models which integrate the network design and the frequency setting phases in public transportation networks. These two phases determine to a large extent the service for the passengers and the operational costs for ...
López Ramos, Francisco
core
, 2002 The stable allocation problem is the generalization of the well-known and much studied stable (0,1)-matching problems to the allocation of real numbers (hours or quantities). There are two distinct sets of agents, a set I of "employees" or "buyers" and a
Balinski, Michel,, Baïou, Mourad
core +1 more source
Neural network models for solving the maximum flow problem [PDF]
, 2008 In this paper, two new neural network models for solving the maximum flow problem are presented. The maximum flow problem in networks is formulated as a special type of linear programming problem and it is solved by appropriately defined neural networks.
Effati, S., Ranjbar, M.
core +1 more source
A large deviation approach to optimal transport
, 2007 A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle with an ...
Léonard, Christian
core +2 more sources
Cost Optimization of Ice Distribution [PDF]
Two questions regarding minimizing fuel costs while delivering ice along a pre-set route are tackled. The first question is when demand exceeds the load of a single truck, so that a second truck of ice has to be taken to some point of the route for the ...
Hjorth, P.G. +8 more
core