• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 92
  • 36
  • 8
  • 5
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 158
  • 158
  • 43
  • 37
  • 37
  • 32
  • 29
  • 28
  • 27
  • 25
  • 19
  • 19
  • 18
  • 17
  • 16
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
21

A group theoretic approach to metaheuristic local search for partitioning problems

Kinney, Gary W. 28 August 2008 (has links)
Not available / text
22

A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics

Lü, Haili., 吕海利. January 2011 (has links)
published_or_final_version / Industrial and Manufacturing Systems Engineering / Doctoral / Doctor of Philosophy
23

Integrated modern-heuristic and B/B approach for the classical traveling salesman problem on a parallel computer

李寶榮, Lee, Po-wing. January 1999 (has links)
published_or_final_version / Mathematics / Master / Master of Philosophy
24

Container loading problem by a multi-stage heuristics approach

古偉業, Koo, Wai-yip. January 1997 (has links)
published_or_final_version / Mathematics / Master / Master of Philosophy
25

The quadratic assignment problem : exact and heuristic methods

Sherali, Hanif Dostmahomed 08 1900 (has links)
No description available.
26

Airline crew scheduling under uncertainty

Schaefer, Andrew James 12 1900 (has links)
No description available.
27

An evaluation of heuristics for in-the-aisle order picking

Schorn, Ellen Christine 05 1900 (has links)
No description available.
28

Efficient heuristics for collision avoidance in three dimensions

Rushall, David Aaron, 1964- January 1989 (has links)
This thesis represents a relatively new aspect of computing with regard to robotics. The need for fast, efficient collision avoidance algorithms is growing rapidly. Because conventional methods are complex and require vast amounts of computation, heuristic algorithms are more appealing. The focus of this thesis is the problem of moving a point through three dimensional space while avoiding known polyhedral obstacles. A heuristic algorithm to find shortest (near-optimal) collision-free paths in the presence of polyhedral obstacles, given initial and final positions, is presented. Previous methods for the problem rely on an a priori discretization of the space. The points in the discretization form nodes of a graph, and the collision avoidance problem is then solved by using some shortest path algorithm on the graph. The heuristic suggested here successively adds nodes to a graph, thus keeping the size of the graph manageable. The computational results are extremely encouraging.
29

Graph approach modeling and optimal heuristics for the one-dimensional cutting and packing problems

Wong, Chun Chuen 01 January 2002 (has links)
No description available.
30

Gender based meta-heuristic optimization algorithms

Tian, Zhong Huan January 2017 (has links)
University of Macau / Faculty of Science and Technology / Department of Computer and Information Science

Page generated in 0.1158 seconds