Sciweavers

26 search results - page 4 / 6
» anor 2005
Sort
View
ANOR
2005
72views more  ANOR 2005»
13 years 10 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
ANOR
2005
56views more  ANOR 2005»
13 years 10 months ago
Two-Machine Flowshop Batching and Scheduling
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
Bertrand M. T. Lin, T. C. Edwin Cheng
ANOR
2005
118views more  ANOR 2005»
13 years 10 months ago
Multitiered Supply Chain Networks: Multicriteria Decision - Making Under Uncertainty
: In this paper, we present a supply chain network model with multiple tiers of decision-makers, consisting, respectively, of manufacturers, distributors, and retailers, who can co...
June Dong, Ding Zhang, Hong Yan, Anna Nagurney
ANOR
2005
120views more  ANOR 2005»
13 years 10 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
ANOR
2005
93views more  ANOR 2005»
13 years 10 months ago
Looking Ahead with the Pilot Method
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repea...
Stefan Voß, Andreas Fink, Cees Duin