|Start Page Number:||273|
|End Page Number:||288|
|Publication Date:||Nov 2016|
|Journal:||Annals of Operations Research|
|Authors:||Bruno Giuseppe, Marn Alfredo, Barbati Maria|
|Keywords:||combinatorial optimization, facilities, programming: integer, scheduling, demand, heuristics|
There has been a number of facility location problems dealing with the introduction of the equity issue in the travel distances distribution. In this paper we analyze a new aspect of equity concerning the distribution of the arrival times of customers. Given a depot and a set of demand points generating flow which also represent potential locations, we consider a discrete two‐stage location problem whose aim is to locate a given number of facilities and to allocate the demand points to a facility. We assume as objective the maximization of the minimum difference between two consecutive arrival times of flows to the depot through the patronized facility. This particular equity measure is introduced in order to reduce risks of congestion in the dynamic of flow arrivals at the common destination. The problem is described through two Integer Programming formulations. Computational results for solution methods based on both formulations are then shown and analyzed.