ENHANCEMENTS TO THE CLARKE AND WRIGHT ALGORITHM VIA GENRALIZATION AND LOOK-AHEAD

In this paper, the author presents two variants of the classical Clarke and Wright algorithm. One variant generalizes the savings measure by considering a larger neighborhood of the current solution. The other variant introduces a penalty (or look-ahead) factor aimed at reducing the "myopic" behavior of the classical approach. Computational results show that these two variants generate better solutions than the classical Clarke and Wright algorithm. In particular, the penalty approach generates solutions that compare favorably to the generalized approach, even with a complexity that remains in the order of N2logN, where N is the number of nodes in the network. (A)

• Corporate Authors:

  CENTRE DE RECHERCHE SUR LES TRANSPORTS. UNIVERSITE DE MONTREAL

  C.P. 6128, SUCCURSALE A
  MONTREAL, QUEBEC  Canada  H3C 3J7
• Authors:
  • Potvin, J Y
• Publication Date: 1989

Language

• English

Media Info

• Features: References;
• Serial:
  • CENTRE DE RECHERCHE SUR LES TRANSPORTS PUBLICATION
  • Issue Number: 669
  • Publisher: Universite de Montreal

Subject/Index Terms

• TRT Terms: Calculation; Itinerary; Mathematical models; Methodology; Optimization
• Uncontrolled Terms: Optimum
• ITRD Terms: 6464: Calculation; 699: Itinerary; 6473: Mathematical model; 9102: Method

Filing Info

• Accession Number: 00674522
• Record Type: Publication
• Source Agency: Transportation Association of Canada (TAC)
• Files: ITRD
• Created Date: Mar 8 1995 12:00AM