Keyword: heuristics

Found 5460 papers in total
New Stabilization Procedures for the Cutting Stock Problem
New Stabilization Procedures for the Cutting Stock Problem
2011,
In this paper, we deal with a column generation‐based algorithm for the...
An Improved Primal Simplex Algorithm for Degenerate Linear Programs
An Improved Primal Simplex Algorithm for Degenerate Linear Programs
2011,
Since its appearance in 1947, the primal simplex algorithm has been one of the most...
Combination of Nonlinear and Linear Optimization of Transient Gas Networks
Combination of Nonlinear and Linear Optimization of Transient Gas Networks
2011,
In this paper, we study the problem of technical transient gas network optimization,...
A Clock‐and‐Offer Auction Market for Grid Resources When Bidders Face Stochastic Computational Needs
A Clock‐and‐Offer Auction Market for Grid Resources When Bidders Face Stochastic Computational Needs
2011,
Although significant technical advances have been made in the commercial deployment of...
Integrated intelligent techniques for remarshaling and berthing in maritime terminals
Integrated intelligent techniques for remarshaling and berthing in maritime terminals
2011,
Maritime container terminals are facilities where cargo containers are transshipped...
Human and organizational biases affecting the management of safety
Human and organizational biases affecting the management of safety
2011,
Management of safety is always based on underlying models or theories of organization,...
A Branch‐and‐Price Algorithm for the Bin Packing Problem with Conflicts
A Branch‐and‐Price Algorithm for the Bin Packing Problem with Conflicts
2011,
We provide a branch‐and‐price algorithm for the bin packing problem with...
Designing greedy algorithms for the flow‐shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH)
Designing greedy algorithms for the flow‐shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH)
2011,
This paper introduces Empirically Adjusted Greedy Heuristics (EAGH), a procedure for...
A Branch‐and‐Cut Algorithm Using a Strong Formulation and an A Priori Tour‐Based Heuristic for an Inventory‐Routing Problem
A Branch‐and‐Cut Algorithm Using a Strong Formulation and an A Priori Tour‐Based Heuristic for an Inventory‐Routing Problem
2011,
We address a vendor‐managed inventory‐routing problem where a supplier...
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands
2011,
The vehicle routing problem with stochastic demands (VRPSD) consists of designing...
The Two‐Echelon Capacitated Vehicle Routing Problem: Models and Math‐Based Heuristics
The Two‐Echelon Capacitated Vehicle Routing Problem: Models and Math‐Based Heuristics
2011,
Multiechelon distribution systems are quite common in supply‐chain and...
The Mobile Facility Routing Problem
The Mobile Facility Routing Problem
2011,
In many applications, ranging from cellular communications to humanitarian relief...
Short sales in Log‐robust portfolio management
Short sales in Log‐robust portfolio management
2011,
This paper extends the Log‐robust portfolio management approach to the case...
Natural gas bilevel cash‐out problem: Convergence of a penalty function method
Natural gas bilevel cash‐out problem: Convergence of a penalty function method
2011,
This paper studies a special bi‐level programming problem that arises from the...
A water‐flow algorithm for flexible flow shop scheduling with intermediate buffers
A water‐flow algorithm for flexible flow shop scheduling with intermediate buffers
2011,
We investigate the flexible flow shop scheduling problem with limited or unlimited...
Three heuristic procedures for the stochastic, two‐machine flow shop problem
Three heuristic procedures for the stochastic, two‐machine flow shop problem
2011,
Although the deterministic flow shop model is one of the most widely studied problems...
Set partitioning and packing versus assignment formulations for subassembly matching problems
Set partitioning and packing versus assignment formulations for subassembly matching problems
2011,
This paper addresses alternative formulations and model enhancements for two...
Hybrid metaheuristics for the profitable arc tour problem
Hybrid metaheuristics for the profitable arc tour problem
2011,
The profitable arc tour problem is a variant in the vehicle routing problems. It is...
Discrete cooperative covering problems
Discrete cooperative covering problems
2011,
A family of discrete cooperative covering problems is analysed in this paper. Each...
Single‐machine scheduling of proportionally deteriorating jobs by two agents
Single‐machine scheduling of proportionally deteriorating jobs by two agents
2011,
We consider a problem of scheduling a set of independent jobs by two agents on a...
Progressive hedging innovations for a class of stochastic mixed‐integer resource allocation problems
Progressive hedging innovations for a class of stochastic mixed‐integer resource allocation problems
2011,
Numerous planning problems can be formulated as multi‐stage stochastic programs...
Crop rotation scheduling with adjacency constraints
Crop rotation scheduling with adjacency constraints
2011,
In this article we propose a 0‐1 optimization model to determine a crop...
Supply network planning in the forest supply chain with bucking decisions anticipation
Supply network planning in the forest supply chain with bucking decisions anticipation
2011,
We consider a two‐echelon timber supply chain in which the first echelon...
An artificial bee colony algorithm for the capacitated vehicle routing problem
An artificial bee colony algorithm for the capacitated vehicle routing problem
2011,
This paper introduces an artificial bee colony heuristic for solving the capacitated...
Papers per page: