DIAL HAS DEVELOPED A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT ALGORITHM WHICH IS VERY EFFICIENT. HOWEVER, THE ASSIGNMENT OF TRIPS TO PATHS IS BASED ON A LOGIT MODEL WHICH HAS SOME UNDESIRABLE PROPERTIES. THE PURPOSE OF THIS PAPER IS TO EXTEND DIAL'S ALGORITHM BY UTILIZING A SIMPLE MODEL OF TRIPMAKERS' PERCEPTIONS AND BEHAVIOR. AN IMPORTANT ADVANTAGE THESE MODELS HAVE IS THAT THEY CAN BE CALIBRATED THROUGH THE STUDY OF TRIPMAKERS' BEHAVIOR ON A LIMITED SET OF TRIPS RATHER THAN THROUGH THE STUDY OF ORIGIN AND DESTINATION PATTERNS AND LINK FLOWS ON A LARGE NETWORK. THREE TRAFFIC ASSIGNMENT MODELS ARE PRESENTED WHICH ARE COMPUTATIONALLY EQUIVALENT TO DIAL'S MODEL AND WHICH CAN BE IMPLEMENTED BY MAKING MINOR CHANGES IN HIS ALGORITHM. ONE OF THE NEW MODELS, BASED ON PATH LIKELIHOODS CONTAINS DIAL'S MODEL AS A SPECIAL CASE. THE ASSUMPTIONS REQUIRED ABOUT TRIPMAKERS' PERCEPTIONS TO OBTAIN THIS SPECIAL CASE SEEM UNREASONABLE AND THIS EXPLAINS SOME OF THE UNDESIRABLE PROPERTIES OF DIAL'S MODEL. IN ITS GENERAL FORM, THE NEW MODEL ELIMINATES SOME OF THESE UNDESIRABLE PROPERTIES. HOWEVER, LIKE DIAL'S MODEL, IT GENERALLY ALLOCATES A DISPROPORTIONATE NUMBER OF TRIPS TO PORTIONS OF A ROAD NETWORK IN WHICH THERE IS A LARGE NUMBER OF CHOICES OF MINOR VARIATIONS IN ROUTE. THE OTHER TWO MODELS, BASED ON ARRIVAL LIKELIHOODS AND TURN LIKELIHOODS, BOTH OVERCOME THIS SHORTCOMING. THESE TWO MODELS HAVE DIFFERENT INTERPRETATIONS IN TERMS OF TRIPMAKER BEHAVIOR. THE MODEL BASED ON TURN LIKELIHOODS IS THE MOST INTUITIVE AND CONTAINS GUNNARSSON'S MULTIPATH TRAFFIC ASSIGNMENT MODEL AS A SPECIAL CASE.(Author/publisher).
Samenvatting