Parallel Variable Neighbourhood Search for the p-Median
نویسندگان
چکیده
† Département d’informatique et recherche opérationnelle and Centre de recherche sur les transports, Université de Montréal Email: {hoeb, michelg}@crt.umontreal.ca ‡ GERAD and École des Hautes Etudes Commerciales 3000 ch. de la Côte-Sainte-Catherine, Montréal H3T 1V6, Canada Email: {pierreh, nenad}@crt.umontreal.ca § Matematički Institut, SANU Knez Mihajlova 35, Beograd, Yugoslavia Email: [email protected]
منابع مشابه
A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملSolving large p-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
A hybridisation of a clustering-based technique and of a Variable Neighbourhood Search (VNS) is designed to solve large-scale p-median problems. The approach is based on a multi-stage methodology where learning from previous stages is taken into account when tackling the next stage. Each stage is made up of several subproblems that are solved by a fast procedure to produce good feasible solutio...
متن کاملA Modified p-Median Model for the Emergency Facilities Location Problem and Its Variable Neighbourhood Search-Based Algorithm
Emergency incidents, including natural disasters, terrorist attacks, public health outbreaks, and industrial and mining accidents, and so forth, result in severe human casualties and property losses. Emergency facilities, which provide relief materials and services, play an important role in rescue management. The decision of where to locate the emergency rescue facilities is very important, as...
متن کاملThe Parallel Variable Neighborhood Search for the <Emphasis Type="Italic">p</Emphasis>-Median Problem
The Variable Neighborhood Search (VNS) is a recent metaheuristic that combines series of random and improving local searches based on systematically changed neighborhoods. When a local minimum is reached, a shake procedure performs a random search. This determines a new starting point for running an improving search. The use of interchange moves provides a simple implementation of the VNS algor...
متن کاملImprovements and Comparison of Heuristics for Solving the Multisource Weber Problem
The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane in order to minimize the total transportation cost for satisfying the demand of n xed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial...
متن کامل