Displaying similar documents to “Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs”

Editorial

Clarisse Dhaenens, Patrick Siarry, El-Ghazali Talbi (2008)

RAIRO - Operations Research

Similarity:

High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems

Roman Dębski (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

Effective, simulation-based trajectory optimization algorithms adapted to heterogeneous computers are studied with reference to the problem taken from alpine ski racing (the presented solution is probably the most general one published so far). The key idea behind these algorithms is to use a grid-based discretization scheme to transform the continuous optimization problem into a search problem over a specially constructed finite graph, and then to apply dynamic programming to find an...

An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function

José Luis Quintero, Alejandro Crema (2009)

RAIRO - Operations Research

Similarity:

The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to a generalized min max objective function such that the min sum and min max are particular cases.

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...

An Algorithm For Solving Multiple Objective Integer Linear Programming Problem

Moncef Abbas, Djamal Chaabane (2010)

RAIRO - Operations Research

Similarity:

In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.

A novel generalized oppositional biogeography-based optimization algorithm: application to peak to average power ratio reduction in OFDM systems

Sotirios K. Goudos (2016)

Open Mathematics

Similarity:

A major drawback of orthogonal frequency division multiplexing (OFDM) signals is the high value of peak to average power ratio (PAPR). Partial transmit sequences (PTS) is a popular PAPR reduction method with good PAPR reduction performance, but its search complexity is high. In this paper, in order to reduce PTS search complexity we propose a new technique based on biogeography-based optimization (BBO). More specifically, we present a new Generalized Oppositional Biogeography Based Optimization...

An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function

José Luis Quintero, Alejandro Crema (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.