Keyword: heuristics: local search

Found 320 papers in total
Computing Bid Prices for Revenue Management Under Customer Choice Behavior
Computing Bid Prices for Revenue Management Under Customer Choice Behavior
2011,
We consider a choice‐based, network revenue management (RM) problem in a...
A heuristic for minimizing weighted carry‐over effects in round robin tournaments
A heuristic for minimizing weighted carry‐over effects in round robin tournaments
2011,
The carry‐over effects value is one of the various measures one can consider to...
A Profit-Maximizing Approach to Disposition Decisions for Product Returns*
A Profit-Maximizing Approach to Disposition Decisions for Product Returns*
2011,
Motivated by the asset recovery process at IBM, we analyze the optimal disposition...
A genetic algorithm with neighborhood search for the resource-constrained project scheduling problem
A genetic algorithm with neighborhood search for the resource-constrained project scheduling problem
2011,
The resource-constrained project scheduling problem (RCPSP) consists of a set of...
Exponential size neighborhoods for makespan minimization scheduling
Exponential size neighborhoods for makespan minimization scheduling
2011,
We investigate the quality of local search heuristics for the scheduling problem of...
Codifferential method for minimizing nonsmooth DC functions
Codifferential method for minimizing nonsmooth DC functions
2011,
In this paper, a new algorithm to locally minimize nonsmooth functions represented as...
A reduced Hessian SQP method for inequality constrained optimization
A reduced Hessian SQP method for inequality constrained optimization
2011,
This paper develops a reduced Hessian method for solving inequality constrained...
An improved proximal alternating direction method for monotone variational inequalities with separable structure
An improved proximal alternating direction method for monotone variational inequalities with separable structure
2011,
To solve a class of variational inequalities with separable structure, this paper...
Direct search algorithm for bilevel programming problems
Direct search algorithm for bilevel programming problems
2011,
In this paper, we study the application of a class of direct search methods to bilevel...
The penalized Fischer‐Burmeister SOC complementarity function
The penalized Fischer‐Burmeister SOC complementarity function
2011,
In this paper, we study the properties of the penalized Fischer‐Burmeister (FB)...
An active index algorithm for the nearest point problem in a polyhedral cone
An active index algorithm for the nearest point problem in a polyhedral cone
2011,
We consider the problem of finding the nearest point in a polyhedral cone C ={ x...
A new hybrid method for nonlinear complementarity problems
A new hybrid method for nonlinear complementarity problems
2011,
In this paper, a new hybrid method is proposed for solving nonlinear complementarity...
Massively parallel differential evolution–pattern search optimization with graphics hardware acceleration: an investigation on bound constrained optimization problems
Massively parallel differential evolution–pattern search optimization with graphics hardware acceleration: an investigation on bound constrained optimization problems
2011,
This paper presents a novel parallel Differential Evolution (DE) algorithm with local...
Tactical crew planning in railways
Tactical crew planning in railways
2011,
Tactical crew capacity planning problem in railways involves finding the minimum...
Pattern discrete and mixed Hit‐and‐Run for global optimization
Pattern discrete and mixed Hit‐and‐Run for global optimization
2011,
We develop new Markov chain Monte Carlo samplers for neighborhood generation in global...
Constructing composite search directions with parameters in quadratic interpolation models
Constructing composite search directions with parameters in quadratic interpolation models
2011,
In this paper, we introduce the weighted composite search directions to develop the...
Fast searching games on graphs
Fast searching games on graphs
2011,
Given a graph, suppose that intruders hide on vertices or along edges of the graph....
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
2011,
The orienteering problem (OP) consists in finding an elementary path over a subset of...
The Laguerre spectral method for solving Neumann boundary value problems
The Laguerre spectral method for solving Neumann boundary value problems
2011,
In this paper, we propose a Laguerre spectral method for solving Neumann boundary...
Attracting cycles for the relaxed Newton's method
Attracting cycles for the relaxed Newton's method
2011,
We study the relaxed Newton’s method applied to polynomials. In particular, we...
The k‐coloring fitness landscape
The k‐coloring fitness landscape
2011,
This paper deals with the fitness landscape analysis of the k ‐coloring...
The flexible blocking job shop with transfer and set‐up times
The flexible blocking job shop with transfer and set‐up times
2011,
The Flexible Blocking Job Shop (FBJS) considered here is a job shop scheduling problem...
An efficient local search scheme for minimizing mean absolute deviation of completion times
An efficient local search scheme for minimizing mean absolute deviation of completion times
2011,
We present a two phase local search scheme for finding a sequence of n jobs to be...
Population‐based neighborhood search for job shop scheduling with interval processing time
Population‐based neighborhood search for job shop scheduling with interval processing time
2011,
This paper applies interval number theory to production scheduling for its advantage...
Papers per page: