L'Optimisation des Frequences d'un Reseau de Transport en Commun

Constantin, Isabelle
February 1994
Transportation Science;Feb94, Vol. 28 Issue 1, p84
Academic Journal
The optimization of frequencies is an important step in the design of a transit network, yet it is not well integrated in the traditional models used in the transit planning process. Until now, it has received scant attention in the literature and has often been studied in conjunction with the design of transit line itineraries. Furthermore, none of the models proposed so far take explicitly into account the travelers' behavior regarding route choice. The optimal frequencies is defined as the ones that minimize the total expected travel time on the network, while satisfying a fleet size constraint as well as lower and upper bound constraints on the line frequencies. This article formulate the problem as a mixed integer non-linear program with an ill behaved objective function, which is neither convex nor concave, and binary variables.


Related Articles

  • A PENALTY FUNCTION PROCEDURE FOR SENSITIVITY ANALYSIS OF CONCAVE PROGRAMS. Howe, Stephen // Management Science;Nov74, Vol. 21 Issue 3, p341 

    Given a concave program, consider its optimal objective value as a function of the right-hand side. The behavior of this optimal response function reflects the sensitivity of the objective value to changes in the right-hand side. A scheme involving the optimization of a penalty function is...

  • Minimizing Trailer-on-Flat-Car Costs: A Network Optimization Model. Dial, Robert B. // Transportation Science;Feb94, Vol. 28 Issue 1, p24 

    This paper discusses the mathematical and computational underpinnings of an optimization model that reduces United Parcel Service, Inc.'s trailer-on-flat-car (TOFC) usage costs by $4 million per year. It includes an informal statement of the TOFC problem, an integer linear program (ILP)...

  • Learning Heuristics for Repetitive Combinatorial Optimization Problems: With an Application in Train Scheduling. Kraay, David R. // Transportation Science;Feb94, Vol. 28 Issue 1, p85 

    This article presents a case-based approach for the development of learning heuristics for solving repetitive operations research problems. The article first define the subset of problems and then present several general forms which can be used to select previously solved problems which might...

  • Slider-link driven compressor (I). Mathematical model. Dagilis, V.; Vaitkus, L.; Kirejchick, D. // Mechanika;2006, Vol. 62 Issue 6, p25 

    The presented mathematical model is targeted for the optimization of slider-link driven compressor, i.e. for the selection of such geometrical parameters (piston stroke to diameter ratio, piston eccentricity, clearance between the piston and the cylinder, etc.), which will ensure the highest...

  • A PRIMAL METHOD FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS. Balinski, M. L.; Gomory, R. E. // Management Science;Apr1964, Vol. 10 Issue 3, p578 

    This paper describes a simple calculation for the assignment and transportation problems which is "dual to" the well-known Hungarian Method. While the Hungarian is a dual method, this method is primal and so gives a feasible assignment at each stage of the calculation. Bounds on the number of...

  • OPTIMUM NO-RISK STRATEGY FOR WIN-PLACE PARI-MUTUEL BETTING. Willis, Kenneth E. // Management Science;Apr1964, Vol. 10 Issue 3, p574 

    The problem of finding an optimum, no-risk strategy for placing simultaneous win and place parimutuel bets is formulated in terms of a linear programming problem. For a basic feasible solution (i.e., a profitable schedule of bets) to exist, it is necessary for the win and place pools to weight...

  • A TREATMENT OF TRANSPORTATION PROBLEMS BY PRIMAL PARTITION PROGRAMMING. Grigoriadis, Michael D.; Walker, William F. // Management Science;May68, Vol. 14 Issue 9, p565 

    J. B. Rosen's Primal Partition Programming method [16] is applied to the classical transportation problem and to some related generalizations or extensions. Observations on the special structure of the constraint matrix result in a subproblem which may be solved by inspection, a unimodular...

  • A combined optimization–simulation approach to the master surgical scheduling problem. Banditori, Carlo; Cappanera, Paola; Visintin, Filippo // IMA Journal of Management Mathematics;Apr2013, Vol. 24 Issue 2, p155 

    This paper addresses the master surgical scheduling problem. First, we present a mixed integer programming model. The model assumes that the cases in a hospital's waiting list can be classified into homogeneous surgery groups based on the resources (e.g. operating room, post-surgical beds) that...

  • Reliability optimization of a complex system by the stochastic branch and bound method. V. Norkin; B. Onishchenko // Cybernetics & Systems Analysis;May2008, Vol. 44 Issue 3, p418 

    Abstract  An optimal redundancy problem is considered as a stochastic optimization problem. The mean lifetime of a network is maximized by the stochastic branch and bound algorithm. To obtain (stochastic) estimates of branches, use is made of stochastic tangent minorants and majorants of...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics