Search results for "A* algorithm"
showing 10 items of 2538 documents
A contribution to the linear programming approach to joint cost allocation: Methodology and application
2009
Abstract The linear programming (LP) approach has been commonly proposed for joint cost allocation purposes. Within a LP framework, the allocation rules are based on a marginal analysis. Unfortunately, the additivity property which is required to completely allocate joint costs fails in presence of capacity, institutional or environmental constraints. In this paper, we first illustrate that the non allocated part can be interpreted as a type of producer’s surplus. Then, by using the information contained in the Simplex tableau we propose an original two-stage methodology based on the marginal costs and the production elasticity of input factors to achieve an additive cost allocation pattern…
Minimising value-at-risk in a portfolio optimisation problem using a multi-objective genetic algorithm
2011
[EN] In this paper, we develop a general framework for market risk optimisation that focuses on VaR. The reason for this choice is the complexity and problems associated with risk return optimisation (non-convex and non-differential objective function). Our purpose is to obtain VaR efficient frontiers using a multi-objective genetic algorithm (GA) and to show the potential utility of the algorithm to obtain efficient portfolios when the risk measure does not allow calculating an optimal solution. Furthermore, we measure differences between VaR efficient frontiers and variance efficient frontiers in VaR-return space and we evaluate out-sample capacity of portfolios on both bullish and bearis…
A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
2005
This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem, the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures.
Tabu search for a multi-objective routing problem
2006
Multi-objective optimization problems deal with the presence of different conflicting objectives. Given that it is not possible to obtain a single solution by optimizing all the objectives simultaneously, a common way to face these problems is to obtain a set of efficient solutions called the non-dominated frontier. In this paper, we address the problem of routing school buses with two objectives: minimize the number of buses, and minimize the longest time a student would have to stay in the bus. The trade-off in this problem is between service level, which is represented by the maximum route length, and operational cost, which is represented by the number of buses in the solution. We prese…
Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion
2002
This paper presents a real-world industrial application of the multi-product and multi-objective assembly line balancing problem, for a company involved in the production of four models of a white goods product. The problem solved is a GALBP-2, with 10 workstations and multiple objectives (to maximize the production rate in order to deal with an increase of the demand forecasted, to reach an equal cycle time of all the models and an equal workload of the different workstations, and finally, to minimize the dispersion of worker tasks on each one of the different models-the common tasks of the different models at the same workstation). The paper presents an integrated approach based on four h…
Heuristic solutions to the problem of routing school buses with multiple objectives
2002
In this paper we address the problem of routing school buses in a rural area. We approach this problem with a node routing model with multiple objectives that arise from conflicting viewpoints. From the point of view of cost, it is desirable to minimise the number of buses used to transport students from their homes to school and back. From the point of view of service, it is desirable to minimise the time that a given student spends en route. The current literature deals primarily with single-objective problems and the models with multiple objectives typically employ a weighted function to combine the objectives into a single one. We develop a solution procedure that considers each objecti…
Robust Assembly Assistance Using Informed Tree Search with Markov Chains
2022
Manual work accounts for one of the largest workgroups in the European manufacturing sector, and improving the training capacity, quality, and speed brings significant competitive benefits to companies. In this context, this paper presents an informed tree search on top of a Markov chain that suggests possible next assembly steps as a key component of an innovative assembly training station for manual operations. The goal of the next step suggestions is to provide support to inexperienced workers or to assist experienced workers by providing choices for the next assembly step in an automated manner without the involvement of a human trainer on site. Data stemming from 179 experiment partici…
Fuzzy Distributed Genetic Approaches for Image Segmentation
2010
This paper presents a new image segmentation algorithm (called FDGA-Seg) based on a combination of fuzzy logic, multiagent systems and genetic algorithms. We propose to use a fuzzy representation of the image site labels by introducing some imprecision in the gray tones values. The distributivity of FDGA-Seg comes from the fact that it is designed around a MultiAgent System (MAS) working with two different architectures based on the master-slave and island models. A rich set of experimental segmentation results given by FDGA-Seg is discussed and compared to the ICM results in the last section.
Application of Genetic Algorithms to 3-D Shape Reconstruction in an Active Stereo Vision System
2001
In this paper, a new method for reconstructing 3-D shapes is proposed. It is based on an active stereo vision system composed of a camera and a light system which projects a set of structured laser rays on the scence to be analyzed. The depth information is provided by matching the laser rays and the corresponding spots appearing in the image. The matching task is performed by using Genetic Algorithms (GAs). The process converges towards the optimum solution which proves that GAs can effectively be used for this problem. An efficient 3-D reconstruction method is introduced. The experimental results demonstrate that the proposed approach is stable and provides high accuracy 3-D object recons…
Social Network-Based Content Delivery in Device-to-Device Underlay Cellular Networks Using Matching Theory
2017
With the popularity of social network-based services, the unprecedented growth of mobile date traffic has brought a heavy burden on the traditional cellular networks. Device-to-device (D2D) communication, as a promising solution to overcome wireless spectrum crisis, can enable fast content delivery based on user activities in social networks. In this paper, we address the content delivery problem related to optimization of peer discovery and resource allocation by combining both the social and physical layer information in D2D underlay networks. The social relationship, which is modeled as the probability of selecting similar contents and estimated by using the Bayesian nonparametric models…