Search Results - subject:"combinatorial optimization"

AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM

YOU, BYUNGJUN; YOKOYA, DAISUKE; YAMADA, TAKEO - In: Asia-Pacific Journal of Operational Research (APJOR) 29 (2012) 05, pp. 1250032-1

We are concerned with a variation of the assignment problem, where the assignment costs differ under different scenarios. We give a surrogate relaxation approach to derive a lower bound and an upper bound quickly, and show that the pegging test known for zero–one programming problems is also...

Persistent link: https://www.econbiz.de/10010585666

Coupling ant colony systems with strong local searches

Gambardella, L.M.; Montemanni, R.; Weyland, D. - In: European Journal of Operational Research 220 (2012) 3, pp. 831-843

described. The resulting framework, called Enhanced Ant Colony System is tested on three well-known combinatorial optimization …Ant colony system is a well known metaheuristic framework, and many efficient algorithms for different combinatorial … optimization problems have been derived from this general framework. In this paper some directions for improving the original …

Persistent link: https://www.econbiz.de/10010597583

A reference length approach for the 3D strip packing problem

Wei, Lijun; Oon, Wee-Chong; Zhu, Wenbin; Lim, Andrew - In: European Journal of Operational Research 220 (2012) 1, pp. 37-47

In the three-dimensional strip packing problem (3DSP), we are given a container with an open dimension and a set of rectangular cuboids (boxes) and the task is to orthogonally pack all the boxes into the container such that the magnitude of the open dimension is minimized. We propose a block...

Persistent link: https://www.econbiz.de/10010597678

A constraint programming approach for a batch processing problem with non-identical job sizes

Malapert, Arnaud; Guéret, Christelle; Rousseau, … - In: European Journal of Operational Research 221 (2012) 3, pp. 533-545

This paper presents a constraint programming approach for a batch processing machine on which a finite number of jobs of non-identical sizes must be scheduled. A parallel batch processing machine can process several jobs simultaneously and the objective is to minimize the maximal lateness. The...

Persistent link: https://www.econbiz.de/10010597703

A new exact discrete linear reformulation of the quadratic assignment problem

Nyberg, Axel; Westerlund, Tapio - In: European Journal of Operational Research 220 (2012) 2, pp. 314-319

The quadratic assignment problem (QAP) is a challenging combinatorial problem. The problem is NP-hard and in addition, it is considered practically intractable to solve large QAP instances, to proven optimality, within reasonable time limits. In this paper we present an attractive mixed integer...

Persistent link: https://www.econbiz.de/10010597714

Biased random-key genetic algorithms with applications in telecommunications

Resende, Mauricio - In: TOP: An Official Journal of the Spanish Society of … 20 (2012) 1, pp. 130-153

Persistent link: https://www.econbiz.de/10010557926

Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

Karapetyan, D.; Gutin, G. - In: European Journal of Operational Research 219 (2012) 2, pp. 234-251

The generalized traveling salesman problem (GTSP) is a well-known combinatorial optimization problem with a host of …

Persistent link: https://www.econbiz.de/10010574163

Choice Rules with Size Constraints for Multiple Criteria Decision Making

Alfandari, Laurent - ESSEC Business School - 2004

In outranking methods for Multiple Criteria Decision Making (MCDM), pair-wise comparisons of alternatives are often summarized through a fuzzy preference relation. In this paper, the binary preference relation is extended to pairs of subsets of alternatives in order to define on this basis a...

Persistent link: https://www.econbiz.de/10005021635

Cargo revenue management : bid-prices for a 0-1 multi knapsack problem

Pak, Kevin (contributor); Dekker, Rommert (contributor) - 2004 - [Elektronische Ressource]

Persistent link: https://www.econbiz.de/10002190945

Scheduling and combinatorial auctions: Lagrangean relaxation-based bonds for the WJISP

Elendner, Thomas - 2003

In this paper we consider the following problem: a Company wants to sell consecutive time slots on a single machine. It wants to maximize the revenues, whereby market prizes are not known. Additionally, consider a number of potential buyers of those time slots providing each at least one job....

Persistent link: https://www.econbiz.de/10011558787