Results 1  10
of
9,758
An Overview of Heuristic Solution Methods
 IN PROCEEDINGS OF THE 7TH ANNUAL INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING THEORY, APPLICATIONS AND PRACTICE
, 2002
"... This paper is particularly directed to analysts and managers with some limited familiarity with the use of mathematical modelling as an aid to decision making. It is concerned with obtaining usable solutions to welldefined mathematical representations of real world problem situations. Heuristic pro ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This paper is particularly directed to analysts and managers with some limited familiarity with the use of mathematical modelling as an aid to decision making. It is concerned with obtaining usable solutions to welldefined mathematical representations of real world problem situations. Heuristic
Optimal and Heuristic Solutions in the Transshipment Problem
"... We consider a multilocation inventory system where inventory choices at each location are centrally coordinated. Transshipments are allowed as recourse actions occurring after demand are realized but before it must be satisfied. This problem has not been solved for more than two locations with gene ..."
Abstract
 Add to MetaCart
with general cost parameters before. In this paper we present a simple and intuitive model that allow us to characterize optimal inventory and transshipment policies for three and four locations as well. The insights gained from these analytical results lead us to examine the performance of a greedy heuristic
Enhanced Optimal and Heuristic Solutions of the Routing
"... Abstract—Lighttrail is an efficient and feasible technology for IP transport over alloptical networks. The proposition of light trails for alloptical networks has demonstrated a number of advantages over other paradigms such as Wavelength Routing (WR), Optical Burst Switching (OBS), and Optical P ..."
Abstract
 Add to MetaCart
Packet Switching (OPS). This paper tackles the routing problem of lighttrails with the solution objective of minimizing the number of needed lighttrails to accommodate an offered traffic matrix. We present two enhancements to the Integer Linear Programming (ILP) formulation of the routing problem. We
For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1norm Solution is also the Sparsest Solution
 Comm. Pure Appl. Math
, 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract

Cited by 568 (10 self)
 Add to MetaCart
that for large n, and for all Φ’s except a negligible fraction, the following property holds: For every y having a representation y = Φα0 by a coefficient vector α0 ∈ R m with fewer than ρ · n nonzeros, the solution α1 of the ℓ 1 minimization problem min �x�1 subject to Φα = y is unique and equal to α0
Heuristic solutions to multidepot locationrouting problems
 Computers & Operations Research
, 2002
"... This paper presents a method for solving the multidepot locationrouting problem (MDLRP). Since several unrealistic assumptions, such as homogeneous #eet type and unlimited number of available vehicles, are typically made concerning this problem, a mathematical formulation is given in which these a ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
in terms of the solution quality and run time consumed. In addition, the setting of parameters throughout the solution procedure for obtaining quick and favorable solutions is also suggested. Scope and purpose In many logistic environments managers must make decisions such as location for distribution
Heuristic Solution of the Multisource Weber Problem as a pMedian Problem
, 1996
"... Good heuristic solutions for large Multisource Weber problems can be obtained by solving related pmedian problems in which potential locations of the facilities are users locations and then solving Weber problems for the sets of users of each facility. ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related pmedian problems in which potential locations of the facilities are users locations and then solving Weber problems for the sets of users of each facility.
Depthfirst IterativeDeepening: An Optimal Admissible Tree Search
 Artificial Intelligence
, 1985
"... The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadthfirst search requires too much space and depthfirst search can use too much time and doesn't always find a cheapest path. A depthfirst iteratiwdeepening a ..."
Abstract

Cited by 527 (24 self)
 Add to MetaCart
The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadthfirst search requires too much space and depthfirst search can use too much time and doesn't always find a cheapest path. A depthfirst iteratiw
The Ant System: Optimization by a colony of cooperating agents
 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICSPART B
, 1996
"... An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation ..."
Abstract

Cited by 1300 (46 self)
 Add to MetaCart
computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed
Results 1  10
of
9,758