Computational complexity of integrated models of network design and facility location.
Configuration des lignes d'usinage à boîtiers multibroches : une approche mixte
Ce travail porte sur l'optimisation des lignes d'usinage pour la grande série. Une telle ligne comporte plusieurs postes de travail, chacun étant équipé avec boîtiers multibroches. Un boîtier multibroche exécute plusieurs opérations en parallèle. Lors de la conception en avant-projet, il est nécessaire d'affecter toutes les opérations à des boîtiers et des postes de travail de sorte à minimiser le nombre de postes et de boîtiers utilisés. Pour ce nouveau problème d'équilibrage des lignes de production,...
Constrained -means algorithm for resource allocation in mobile cloudlets
With the rapid increase in the number of mobile devices connected to the Internet in recent years, the network load is increasing. As a result, there are significant delays in the delivery of cloud resources to mobile users. Edge computing technologies (edge, cloudlet, fog computing, etc.) have been widely used in recent years to eliminate network delays. This problem can be solved by allocating cloud resources to the cloudlets that are close to users. The article proposes a clustering-based model...
Counting defective parking functions.
Decision Models for Industrial Plant Location Planning
Determining an Optimal Retail Location by Using GIS
Discrete facility location with nonlinear facility costs
Efficient and local efficient solutions for assignment type problems
In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sufficient conditions for a solution to be efficient for this problem. The notion of efficiency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general.
Efficient and Local Efficient Solutions for Assignment Type Problems
In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sufficient conditions for a solution to be efficient for this problem. The notion of efficiency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general.
Évaluation de la fiabilité d’un système de prévision de la demande dans le cas d’une politique de regroupement des besoins
To establish production plans or replenishment plans, firms use forecasting systems. Such a system is composed of a forecasting method and a lot-sizing method. We propose a scheme to evaluate the reliability of such a system. This evaluation is based on the impact of demand randomness on the long run total cost. The scheme is illustrated with a system including an exponential smoothing technique for the demand forcasting and the Florian and Klein [5] method for the lot-sizing. Simulation results...
Évaluation de la fiabilité d'un système de prévision de la demande dans le cas d'une politique de regroupement des besoins
Pour établir des plans de production et d'approvisionnements, une entreprise utilise un système de prévisions. Celui-ci est constitué d'une méthode de prévision de la demande et d'une méthode de lot-sizing permettant l'obtention de plans prévisionnels. Nous proposons une démarche permettant d'évaluer la fiabilité des prévisions fournies par un tel système. Cette analyse se base sur l'étude de l'impact des aléas de la demande sur les coûts induits par les plans prévisionnels. Nous avons appliqué...
From the median to the generalized center
Heuristic cluster algorithm for multiple facility location-allocation problem
Heurística complementaria a enfoques duales para la planificación de la producción.
Este trabajo presenta una heurística de varios pasos para la obtención de soluciones admisibles al problema de la planificación de la producción con limitaciones de capacidad, a partir de las soluciones aproximadas que presentan los métodos duales basados en la relajación del problema. La heurística es complementaria a la aplicación de dichos métodos, buscando soluciones admisibles derivadas de las proporcionadas por la solución a la relajación.
Heurísticas de descomposición lagrangiana para algunos problemas de localización discreta.
En este trabajo se considera el Problema de Localización de Plantas Simple y el Problema de la p-Mediana Generalizado. Se construyen dos algoritmos heurísticos, uno para cada problema, basados en una técnica de descomposición lagrangiana para problemas binarios. Los algoritmos son implementados en un microordenador y ejecutados sobre una serie de problemas generados aleatoriamente. Los resultados computacionales son comparados con los de otros dos algoritmos heurísticos basados en la optimización...
Improved approximation of the general soft-capacitated facility location problem
The soft-capacitated facility location problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the subproblem is approximately solved by a fully polynomial-time approximation...
Large Neighborhood Local Search for the P-Median Problem
Layout Design of User Interface Components With Multiple Objectives
Localizzazione di impianti e instradamento di materiali nocivi: il caso discreto
Location patterns and distances in Tinbergen-Bos systems