Displaying similar documents to “A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks”

Integer Programming Formulation of the Bilevel Knapsack Problem

R. Mansi, S. Hanafi, L. Brotcorne (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that ...

A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components

Peng-Sheng You, Yi-Chih Hsieh, Hisn-Hung Chen (2011)

RAIRO - Operations Research

Similarity:

Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection...

A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components

Peng-Sheng You, Yi-Chih Hsieh, Hisn-Hung Chen (2011)

RAIRO - Operations Research

Similarity:

Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection...

Interactive compromise hypersphere method and its applications

Sebastian Sitarz (2012)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of...

Interactive compromise hypersphere method and its applications

Sebastian Sitarz (2012)

RAIRO - Operations Research

Similarity:

The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of...

Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming

John Sylva, Alejandro Crema (2008)

RAIRO - Operations Research

Similarity:

An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.