Genetic algorithm for biobjective urban transit routing problem

This paper considers solving a biobjective urban transit routing problem with a genetic algorithm approach. The objectives are to minimize the passengers’ and operators’ costs where the quality of the route sets is evaluated by a set of parameters. The proposed algorithm employs an adding-node procedure which helps in converting an infeasible solution to a feasible solution. A simple yet effective route crossover operator is proposed by utilizing a set of feasibility criteria to reduce the possibility of producing an infeasible network. The computational results from Mandl’s benchmark problems are compared with other published results in the literature and the computational experiments show that the proposed algorithm performs better than the previous best published results in most cases

Numerical simulation of the effect of a moving wall on separation of flow past a symmetrical aerofoil

Proceedings of the Institution of Mechanical Engineers, Part A: Journal of Power and Energy212169-77PPEN

Multicommodity network flow model for Asia's container ports

10.1080/03088830600895626Maritime Policy and Management334387-40

A randomized comparative trial of the Lippes Loop D, Gravigard and TCu 220C IUDs

ADV. CONTRACEPT. DEL. SYST.monogr. 1113-12

Generalized transport vortex method

10.1016/j.compfluid.2006.09.003Computers and Fluids3661081-1091CPFL

Reduced crystallization temperature in a microemulsion-derived zirconia precursor

Materials Letters301119-124MLET

Numerical Flow Visualization of Stall Suppression of a Symmetrical Aerofoil by Leading-edge Moving Surface

Journal of Visualization33245-25

An application of spectroscopic emission microscopy and cathodoluminescence to the failure analysis of near-infrared light emitting diodes

Microelectronics Reliability356935-946MCRL

FPGA implementation of CORDIC algorithm in digital modulation

No Abstract