Sciweavers

EOR
2016
45views more  EOR 2016»
8 years 28 days ago
Large-network travel time distribution estimation for ambulances
We propose a regression approach for estimating the distribution of ambulance travel times between any two locations in a road network. Our method uses ambulance location data tha...
Bradford S. Westgate, Dawn B. Woodard, David S. Ma...
EOR
2016
37views more  EOR 2016»
8 years 28 days ago
A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertai
Facility location problems reported in the literature generally assume the problem parameter values (like cost, budget, etc.) to be known with complete certainty, even if they cha...
Amit Kumar Vatsa, Sachin Jayaswal
EOR
2016
54views more  EOR 2016»
8 years 28 days ago
Time-inconsistent multistage stochastic programs: Martingale bounds
Multistage stochastic programs show time-inconsistency in general, if the objective is neither the expectation nor the maximum functional. This paper considers distortion risk mea...
Georg Ch. Pflug, Alois Pichler
EOR
2016
37views more  EOR 2016»
8 years 28 days ago
Using Choquet integral as preference model in interactive evolutionary multiobjective optimization
abstract We present an interactive evolutionary multiobjective optimization method that can be applied to both continuous and combinatorial problems. The search is driven by userâ€...
Jürgen Branke, Salvatore Corrente, Salvatore ...
EOR
2016
41views more  EOR 2016»
8 years 28 days ago
Regulating vehicle sharing systems through parking reservation policies: Analysis and performance bounds
: We study the regulation of one-way vehicle sharing systems through parking reservation policies. We measure the performance of these systems in terms of the total excess travel t...
Mor Kaspi, Tal Raviv, Michal Tzur, Hila Galili
EOR
2016
53views more  EOR 2016»
8 years 28 days ago
Integer programming formulations for the elementary shortest path problem
Given a directed graph G = (V, A) with arbitrary arc costs, the Elementary Shortest Path Problem (ESPP) consists of ï¬nding a minimum-cost path between two nodes s and t such tha...
Leonardo Taccari
EOR
2016
75views more  EOR 2016»
8 years 28 days ago
Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
We consider the One Warehouse Multi-Retailer (OWMR) problem with deterministic time-varying demand in the case where shortages are allowed. Demand may be either backlogged or lost...
Jean-Philippe Gayon, G. Massonnet, Christophe Rapi...
EOR
2016
37views more  EOR 2016»
8 years 28 days ago
The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints
We introduce and solve the Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and TwoDimensional Loading Constraints (2L-SPD). The 2L-SPD model covers cases where c...
Emmanouil E. Zachariadis, Christos D. Tarantilis, ...