Search
Now showing items 1-10 of 121
Formulations and valid inequalities for the heterogeneous vehicle routing problem
(Springer, 2006)
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin ...
An insight on designers’ sketching activities in traditional versus digital media
(Pergamon Press, 2003-01)
This study aims at gaining an insight on designers' cognitive processes while sketching in digital vs traditional media. Empirical data on design processes have been obtained from protocol analyses of six interior designers ...
A problem space genetic algorithm in multiobjective optimization
(Springer New York LLC, 2003)
In this study, a problem space genetic algorithm (PSGA) is used to solve bicriteria tool management and scheduling problems simultaneously in flexible manufacturing systems. The PSGA is used to generate approximately ...
A problem space algorithm for single machine weighted tardiness problems
(Taylor & Francis Inc., 2003)
We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ...
Simulation metamodelling with neural networks: an experimental investigation
(2002)
Artificial neural networks are often proposed as an alternative approach for formalizing various quantitative and qualitative aspects of complex systems. This paper examines the robustness of using neural networks as a ...
The robust spanning tree problem with interval data
(Elsevier, 2001)
Motivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the ...
Comparison of surface-modeling techniques
(IEEE, 1997-07)
Solution techniques based on surface integral equations are widely used in computational electromagnetics. The accurate surface models increase the accuracy solutions by using exact and flat-triangulation models for a ...
Solution of radiation problems using the fast multipole method
(IEEE, 1997-07)
Electromagnetic radiation problems involving electrically large radiators and reflectors are solved using the fast multipole method (FMM). The FMM enables the solution of large problems with existing computational resources ...
Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
(IEEE, 1998)
The fast noniterative steepest descent path (SDP) algorithm for planar and quasi-planar patch geometries are discussed. The comparison of scattered fields as computed by the method of moments (MOM) and fast direct algorithm ...
Analysis of the 2D nonconcentric large reflector antenna-in-radome system: H-polarization case
(IEEE, 2004)
2D nonconcentric reflector antenna-in-radome system is analyzed for H-polarization case. Rigorous formulation is performed depending on the MoR, Green's function and CSP methods. Larger geometries are solved in reasonable ...