Learn More
Keywords: Vehicle routing with multiple deliverymen Vehicle routing with time windows Mixed integer programming Tabu search Ant colony optimization Beverage distribution a b s t r a c t In real life distribution of goods, relatively long service times may make it difficult to serve all requests during regular working hours. These difficulties are even(More)
The maximal expected covering location problem (MEXCLP) and its adjusted counterpart (AMEXCLP) compute expected coverage arising only from unqueued calls, whereas the interactive use of the hypercube queueing model (HQM) considers both unqueued and queued calls in this computation. In this note we show that the three models are not strictly comparable(More)
This paper studies the application of the hypercube queueing model to SAMU-192, the urban Emergency Medical Service of Campinas in Brazil. The hypercube is a powerful descriptive model to represent server-to-customer systems, allowing the evaluation of a wide variety of performance measures for different configurations of the system. In its original(More)