All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 390

Showing per page

A mathematical model for an optimal appointed delivery date on a home delivery market

Hidefumi Kawakatsu, Hiroaki Sandoh (2010)

RAIRO - Operations Research

In recent years, the home delivery market has rapidly been growing since customers can purchase a variety of products very easily via Internet. At the same time, however, customers tend to switch from a supplier to another seeking for better service for them. For this reason, it is necessary for suppliers to enclose their customers by means of various kinds of service and strategy. An appointed delivery date of a product ordered by a customer is one of important factors of supplier's services....

A memetic algorithm for the vehicle routing problem with time windows

Nacima Labadi, Christian Prins, Mohamed Reghioui (2008)

RAIRO - Operations Research

This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a least-cost set of trips to serve customers during specific time windows. The proposed solution method is a memetic algorithm (MA), a genetic algorithm hybridised with a local search. Contrary to most papers on the VRPTW, which minimize first the number of vehicles, our method is also able to minimize the total distance travelled. The results on 56 classical instances are compared...

A method for sensor placement taking into account diagnosability criteria

Abed Alrahim Yassine, Stéphane Ploix, Jean-Marie Flaus (2008)

International Journal of Applied Mathematics and Computer Science

This paper presents a new approach to sensor placement based on diagnosability criteria. It is based on the study of structural matrices. Properties of structural matrices regarding detectability, discriminability and diagnosability are established in order to be used by sensor placement methods. The proposed approach manages any number of constraints modelled by linear or nonlinear equations and it does not require the design of analytical redundancy relations. Assuming that a constraint models...

A method of multiobjective decision making using a vector value function.

Sixto Ríos-Insua, Jacinto González Pachón, Alfonso Mateos (1994)

Qüestiió

A decision situation with partial information on preferences by means of a vector value function is assumed. The concept of minimum value dispersion solution as a reference point joined with a pseudodistance function from such a point and a dispersion level ε, lead to the notion of ε-dispersion set. The dispersion level represents the amount of value that the decision maker can be indifferent to, therefore he should choose his most preferred solution in this set. Convergence properties, as well...

A model and an algorithm for the grouping problem in telecom networks.

F. García, K. D. Hackbarth (1991)

Qüestiió

This paper deals with the so called grouping problem which arises in telecommunication network optimization when transmission equipment with a certain hierarchy is used. It is shown how this problem is embedded in the complete scheme of network optimization and a general combinatorial model is developed to derive afterwards a solution procedure. The implementation of this procedure forms part of a software tool for the complete problem of transmission network planning. Some results deriving from...

A model for opinion agreement and confidence in multi-expert multi-criteria decisión making.

Gerardo Canfora, Luigi Troiano (2004)

Mathware and Soft Computing

In multi-expert multi-criteria decision making problems, we often have to deal with different opinions, different importance of criteria and experts, missing data, unexpressed opinions and experts who are not fully confident with their judgment. All these factors make the problem more difficult to solve, and run the risk of making the model logic less transparent. In this paper, we present a model based on simple assumptions described by logical rules, in order to maintain the model transparency...

A multi-destination daily carpooling problem and an ant colony based resolution method

Yuhan Guo, Gilles Goncalves, Tienté Hsu (2013)

RAIRO - Operations Research - Recherche Opérationnelle

The rising car usage deriving from growth in jobs and residential population causes air pollution, energy waste and consumption of people’s time. Public transport cannot be the only answer to this increasing transport demand. Carpooling, which is based on the idea that sets of car owners pick up colleagues while driving to or from the workplace, has emerged to be a viable possibility for reducing private car usage in congested areas. Its actual practice requires a suitable information system support...

A multi-subpopulation bat optimization algorithm for economic dispatch problem with non-essential demand response

Yanjun Shen, Bo Yang, Xiongfeng Huang, Yujiao Zhang, Chao Tan (2019)

Kybernetika

In this paper, we propose a new economic dispatch model with random wind power, demand response and carbon tax. The specific feature of the demand response model is that the consumer's electricity demand is divided into two parts: necessary part and non-essential part. The part of the consumer's participation in the demand response is the non-essential part of the electricity consumption. The optimal dispatch objective is to obtain the minimum total cost (fuel cost, random wind power cost and emission...

Currently displaying 81 – 100 of 390