This is an edited version of the home page of the 1995 Program.
1995 ProgramSeptember 1995
 
October 1995
 
November 1995
 
December 1995

Click for more information.
For more details and registration forms contact Kaye Marion k.marion@rmit.edu.au
"Polynomial Algorithms for the Equal Flow Problem"
by
Ravindra K. Ahuja
Dept. of Industrial & Management Eng.
Indian Institute of Technology
at
11:30am
Wednesday 29th November
Latham Theatre, Redmond Barry Building
University of Melbourne
This is always a stimulating day, providing a forum for the exchange of ideas. The programme is filling fast so do not miss this opportunity.
Titles and Abstracts to be submitted by 3/11/95to David Sier or Paul Lochert.
Any papers submitted will be distributed to attendees with the programme and abstracts provided they are submitted to David at the address above before 17/11/95.
COST to cover lunch and papers:
ASOR Members  $50 
Nonmembers  $70 
Fulltime students  $22 
Time: 3.30pm, Monday 4 December 1995
CSIRO, Division of Mathematics and Statistics
Gate 7, 71 Normamby Road
Clayton VIC 3169
Duration: 1 Hour PLUS discussion
Abstract
(i) generating the initial population using a randomized construction heuristic; (ii) new crossover schemes; (iii) a special purpose immigration scheme that promotes diversity; (iv) periodic local optimization of a subset of the population;(v) tournamenting among different populations; and (vi) anoverall design that attempts to strike a balance betweendiversity and a bias towards fitter individuals. The talkdescribes the details of a greedy genetic algorithm for theQuadratic Assignment Problem (QAP), one of the hardest nut incombinatorial optimization. The extensive computational results reveal that our algorithm is the best heuristic algorithm fordense QAP developed to date in terms of the quality of the solution. (Duration: 90 minutes)
Time: 3.30pm, Tuesday 5 December 1995
CSIRO, Division of Mathematics and Statistics
Gate 7, 71 Normamby Road
Clayton VIC 3169
Duration: 1 Hour PLUS discussion
Abstract
(i) a greedy genetic algorithm for the fixed charge network flow problem; and
(ii) a local improvement method for the capacitated minimum spanning tree problem employing a new type of neighborhoods whichis potentially quite powerful. Preliminary computational resultsof these algorithms will also be described. (Duration: 90 minutes)
Please note that the workshop will be followed by a buffet dinner and a panel discussion. Stay tuned for more information.
NOTE: George will be an Invited speaker at the National ConferenceHe will also be visiting other States as well as giving the lectures and workshops and/or seminars listed above in Melbourne.
Crawl back to ASOR National
APORS'97