This is an edited version of the home page of the 1995 Program.

• Executive Committee
• Program for 1995
• And something for 1996!
• Visitors

• Students Conference
  Sept 6, 1:30-5:00
  RMIT

• September 15
  John Beasley gives a lecture at Melbourne University
  3:30 PM

• September 25-27
  National Conference
  See you in Canberra

• 6:00 PM, Monday, 23 October
  Professor George L Nemhauser will give a public lecture - Behrend Lecture - At Melbourne University
  For more details Dr Natashia Boland natashia@maths.mu.oz.au

• 4:00 PM, Monday 13 November 1995
  Seminar
  Silicon Graphics Operations Research Initiative<
  Jim Armstrong, Silicon Graphics.
  RMIT, Building 8, Level 9, Rm 66
  

• 2:00-6:00 PM, Wed 15 November at Lowe Theatre Redmond Barry Building University of Melbourne
  Half Day Workshop
  Interior Point Methods, Optimization and the World Wide Web
  by Dr Stephen J Wright Director - Optimization Technology CenterArgonne National Lab & Northwestern.

  Click for more information.

• 9:00Am -5:00 PM, 27-28 November at RMIT Building 8, Level 9, Room 66
  Two Day Workshop (with optional third day)
  Forecasting for Business & Industry
  by Professor Peter Brockwell Head - Department of Statistics and OR RMIT, Dr Rob Hyndman Department of Mathematics Monash University, Dr Dan Kildea Department of Statistics and OR RMIT, Ms Kaye Marion, Department of Statistics & OR RMIT

  For more details and registration forms contact Kaye Marion k.marion@rmit.edu.au

• 11:30am, November 29, 1996
  Mathematics Department Seminar

  "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

  We consider a special case of the minimum cost flow problem where some arcs in the network are required to have same flow value. This problem arose in the modelling of water resource management problem in the state of Sardinia (Italy). The talk will describe several algorithms for the equal flow problem including (i) a primal simplex algorithm; (ii) a parametric algorithm; and (ii) a binary search algorithm. The first two algorithms run in pseudopolynomial time, whereas the third algorithm runs in polynomial time. All these algorithms exploit the special structure of the equal flow problem. (Duration: 55 minutes).

• Thursday, 30 November
  One Day Seminar
  Recent Advances in OR
  RMIT
  Building 8, Level 9, Rm 66

  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.

  Final Call for Papers

  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
  Non-members	$70
  Full-time students	$22

  For full registration form see the newsletter or contact Paul. The full program is now available!

Back to front

• 3:30-4:30PM, Mon 4 December at CSIRO
  Greedy Genetic Algorithms

  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

  Genetic algorithms is an emerging heuristic technique forsolving complex real-life problems. However, genetic algorithmshave generally not been found to be competitive with other heuristic algorithms for optimization problems in terms of the quality of thesolutions obtained. We propose that incorporating several greedyprinciples, genetic algorithms can out perform other approaches. Wecall the resulting algorithms as greedy genetic algorithms. Theideas we incorporate in the greedy genetic algorithm include

  (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)

• 1:30-8:50 PM, Tue 5 December at CSIRO
  Telecommunication Network Design Problems.

  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

  The optimum design of telecommunication networks is an important research issue because of their widespread applicationsand high capital costs. Exact algorithms for the network designproblems can generally solve only small size problems, and there is aneed for heuristic algorithms that can solve large size problems to afair degree of accuracy. Until recently, the research on theheuristic algorithms for network design problems has been mostly limited to simple construction methods, or Lagrangian based improvement methods. Hence there has been a need for sophisticated methods that employ modern heuristic techniques and obtain more robust and more accurate solutions. In this talk, we describe

  (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)

• 1:30-8:50 PM, Wed 6 December at The University of Melbourne
  Half Day Workshop
  Optimization in Decision Support for Business and Industry
  by Professor George L Nemhauser Co-Director of The Logistic Instituteand A. Russell Chandler Professor of Industrial and Systems Engineering Georgia Institute of Technology.

  Please note that the workshop will be followed by a buffet dinner and a panel discussion. Stay tuned for more information.

• John Beasley
  Imperial College - London
  visiting OR Group DMS-CSIRO
  18 Aug- 19 Sept
  Contact: Mohan Krishnamoorthy
  mohan.krishnamoorthy@dms.csiro.au

• Professor George Nemhauser
  visiting OR Group - Department of Mathematics - Melbourne Uni
  Sept-Dec
  Contact: Natashia Boland - natashia@maths.mu.oz.au

  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.

• Steve Wright
  Maths & Comp Sc
  Argonne Nat Labs
  USA
  Visiting Dr D Ralph, University of Melbourne. danny@mundoe.maths.mu.oz.au
  Nov 1995

• Summer Course on Interactive Adhoc Computing and Prototyping with APL

• MISG, January February 2, 1996There are two OR problems in the program. Stay tunded for more information.

• Chair: Steve Weal
  Department of Mathematics
  Swinburne University of Technology
  P.O.Box 218
  HAWTHORNE VIC 3121
  (W) 819 8270/728 7131
  (F) 819 0821
  (E) sew@stan.xx.swin.oz.au

• Vice-Chair: Kaye Marion
  Department of Statistics and Operations Research
  RMIT
  124 La Trobe Street
  Melbourne 3000
  (W) 660 3162
  (F) 661 4113
  (E)k.marion@rmit.edu.au

• Secretary: Baikunth Nath
  Division of Computing, FCIT
  Monash University- Gippsland Campus
  CHURCHIL 3842
  (W) 902 6468
  (F) 902 6842
  (E) b.nath@@fcit.monash.edu.au

• Treasurer: Jim Youngman
  RACV
  550 Princes Highway
  NOBLE PARK 3174
  (W) 790 2914
  (F) 790 2628
  (E) im@or.racv.com.au

• Committee:
  
  • Peter Cerone
    Department of COmputer Mathematical Sciences
    Victoria University of Technology
    P.O.Box 14428 MMC
    MELBOURNE 3000
    (W) 688 4689
    (F) 687 7632
    (E) pc@matilda.vut.edu.au

  • Andrew Eberhard, (Newsletter Editor)
    Department of Mathematics
    RMIT
    124 La Trobe Street
    Melbourne 3000
    (W) 660 2616
    (F) 661 4113
    (E)rmaae@laplace.ma.rmit.edu.AU

  • Paul Lochert
    Department of Mathematics and Sciences
    Monash University - Caulfield Campus
    P.O.Box 197
    CAULFIELD EAST 3145
    (W) 903 2337
    (F) 903 2227
    (E) p.lochert@maths.monash.edu.au

  • David Noble
    Department of Mathematics
    Swinburne University of Technology
    Edinburgh Road
    LILYDALE 3052
    (W) 728 7134
    (F) 728 7139
    (E) dnoble@banyan.swin.edu.au

  • David Sier
    Division of Mathematics and Statistics
    CSIRO
    Private Bag 10, Rosebank MDC
    CLAYTON 3169
    (W) 542 2646
    (F) 542 2474
    (E) david@mel.dms.csiro.au

  • Moshe Snieodvich
    Department of Mathematics
    University of Melbourne
    PARKVILLE 3052
    (W) 9344 5559
    (F) 9344 4599
    (E) moshe@maths.mu.oz.au
    (WWW) http://www.maths.mu.oz.au/~moshe/

  • Patrick Tobin
    Department of Mathematics
    Swinburne University of Technology
    P.O.Box 218
    HAWTHORNE 3121
    (W) 819 8013
    (F) 818 3645
    (E) pct@stan.xx.swin.oz.au

  • Susanne Irvine (Student Member)
    Department of Mathematics
    University of Melbourne
    PARKVILLE 3052
    (W) 9344 5559
    (F) 9344 4599
    (E) ssi@maths.mu.oz.au
    (WWW) http://www.maths.mu.oz.au/~ssi/

• Co-Opted:
  
  • David Dowe
    Monash University
    (W) 9905 5776
    

• Ex Offcio:
  
  • Santosh Kumar
    

• OR Solutions: Problem Solving through Quantitative Analysis
  P.O.Box 2086
  1/242 Bambra Road
  Caulfield 3161
  Tel: (03) 9578 6380
  Fax: (03) 9578 2321
  

• Hearne Scientific Software
  
• SiliconGraphics
  Mr Andrew Wyatt
  357 Camberwell Rd
  Camberwell VIC 3124
  Tel: (+613) 9882 8211
  Fax: (+613) 9882 8030

Crawl back to ASOR National
APORS'97