L.D. Bodin, B.L. Golden, A.A.Assad and M.O.Ball, Routing and Scheduling of Vehicles andC rews: The State of the Art,C omputers and OR Special Issue, Vol. 10, pp. 69-211, 1983.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....set of minimum cost vehicle routes, originating and terminating at a central depot, for a fleet of vehicles that services a set of customers with known demands. Each customer is serviced exactly once and, furthermore, all customers must be assigned to vehicles without exceeding vehicle capacities [1]. Whereas the VRP has been studied widely, the MDVRP has attracted less attention. In the MDVRP, customers must be serviced by one of several depots. As with the VRP, each vehicle must leave and return to the same depot and the fleet size at each depot must range between a specified minimum and ....

....studied widely, the MDVRP has attracted less attention. In the MDVRP, customers must be serviced by one of several depots. As with the VRP, each vehicle must leave and return to the same depot and the fleet size at each depot must range between a specified minimum and maximum. The MDVRP is NP hard [1], 4] therefore, the development of heuristic algorithms for this problem class is of primary interest. The MDVRP can be viewed as a clustering problem in the sense that the output is a set of vehicle schedules clustered by depot. This interpretation suggests a class of approach that clusters ....

[Article contains additional citation context not shown here]

- L. BODIN, B. GOLDEN, A. ASSAD and M. BALL, "Routing and scheduling of vehicles and crews: The state of the art". Computers and Operations Research Vol. 10, 1983.

....8 T 11 T 6 (b) Fig. 1. a) Trips to be covered every day. b) Duties covering all the trips; each duty overlaps at most L = 2 consecutive days. Several papers on crew (and vehicle) management appeared in the literature. We refer the interested reader to Wren [33] Bodin, Golden, Assad and Ball [10], Carraresi and Gallo [13] Daduna and Wren [16] Rousseau [28] Desrochers and Rousseau [17] Barnhart, Johnson, Nemhauser, Savelsbergh and Vance [4] Desrosiers, Dumas, Solomon and Soumis [18] and Wise [32] In this paper we focus on crew management problems arising in railway applications, ....

.... the published works on the crew rostering problem refer to urban masstransit systems, where the minimum number of crews required to perform the duties can easily be determined, and the objective is to evenly distribute the workload among the crews: see Jachnik [24] Bodin, Gloden, Assad and Ball [10], Carraresi and Gallo [14] Hagberg [23] and Bianco, Bielli, Mingozzi, Ricciardelli and Spadoni [9] Set partitioning approaches for airline crew rostering are described in Ryan [29] Gamache and Soumis [21] Gamache, Soumis, Marquis and Desrosiers [22] and Jarrah and Diamond [26] Finally, ....

L. Bodin, B. Golden, A. Assad and M. Ball, "Routing and Scheduling of Vehicles and Crews: the State of the Art", Computer and Operations Research 10 (1983) 63--211.

....dynamic programming algorithms [7, 13, 27, 28] heuristic algorithms [21, 22, 26, 29, 30] and algorithms based on the polyhedral structure of integer programming formulations [31] Most research has focussed on empirical evaluation of algorithms. For a description of many of these approaches, see [8] and the recent survey by Savelsbergh and Sol [32] The theoretical work on this problem has been restricted to algorithms for special cases, either k = 1 or k = 1 or instances on simple metric spaces such as paths, cycles or trees. For the unit capacity nonpreemptive case, Frederickson, Hecht ....

L. D. Bodin, B. L. Golden, A. Assad and M. O. Ball, \Routing and scheduling of vehicles and crews: the state of the art", Computers and Operations Research, 10:63-211, (1983).

....The fleet of vehicles service a set of customers with a known set of constraints. All customers must be assigned to vehicles such that each customer is serviced exactly once and each vehicle cannot exceed its capacity. The vehicle routing problem has been studied extensively. Bodin et al. [5] provides a comprehensive survey of VRP and several variations. The vehicle routing problem with time windows (VRPTW) adds the additional constraint to the VRP where each customer provides a time window for servicing. Hence, in the presence of time windows, optimization of routing and scheduling ....

L. Bodin, B. Golden, A. Assad, and M. Ball. Routing and scheduling of vehicles and crews: The state of the art. Comput. Opns. Res., 10:62--212, 1983.

....these approaches were based on solving one or more related problems to optimality. The third (current) generation has two main streams: artificial intelligence based heuristics and exact optimization. Many extensions of the basic VRP have been studied in the last decades (see Bodin et al. [2] for a survey) These extensions include complications such as time constraints, multiple capacity constraints, a heterogeneous fleet and multiple depots. Some of the solution approaches for the basic problem can be adapted to deal with additional constraints, but this is typically much easier for ....

L. Bodin, B. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews -- The state of the art, Computers and Operations Research 10, 63-211 (1983).

....dynamic programming algorithms [7, 13, 27, 28] heuristic algorithms [21, 22, 26, 29, 30] and algorithms based on the polyhedral structure of integer programming formulations [31] Most research has focussed on empirical evaluation of algorithms. For a description of many of these approaches, see [8] and the recent survey by Savelsbergh and Sol [32] The theoretical work on this problem has been restricted to algorithms for special cases, either k = 1 or k = 1 or instances on simple metric spaces such as paths, cycles or trees. For the unit capacity non preemptive case, Frederickson, Hecht ....

L. D. Bodin, B. L. Golden, A. Assad and M. O. Ball, "Routing and scheduling of vehicles and crews: the state of the art", Computers and Operations Research, 10:63-211, (1983).

....shortest paths problem with additional constraints. A new and different approach is described in the Ph.D. thesis [Kon97] by Kontoravdis. This is the only approach where work is done directly on the mathematical model formulated previously ( 1) 9) The research on the VRPTW has been surveyed in [BGAB83, SD88, DLSS88, DDSS93]. 3 Solving the VRPTW using column generation As in many routing problems, the VRPTW can be described as a set partitioning problem (SPP) In this model each column corresponds to a feasible route, while the rows in the constraint matrix corresponds to customers. For each column, the variable x r ....

Lawrence Bodin, Bruce Golden, Arjang Assad, and Michael Ball. Routing and scheduling of vehicles and crews - the state of art. Computers & Operations Research, 10(2):62 -- 212, 1983.

....time but no later than the deadline. This is called the path version of the VSP. If the vehicle has to return to the starting site at the end of the trip, it is called a tour version. The literature on the problems with time windows has been growing at an explosive rate over the last few years [2][3] 4] Unfortunately, many of the interesting routing problems are NP complete[2] Karuno proved the VSP on a tree topology with arbitrary degree and ready time only is NP hard [5] Psaraftis [1] proposed a new model for routing of ships for a shoreline topology. He gave an O(n 2 ) algorithm ....

....If the vehicle has to return to the starting site at the end of the trip, it is called a tour version. The literature on the problems with time windows has been growing at an explosive rate over the last few years [2] 3] 4] Unfortunately, many of the interesting routing problems are NP complete[2]. Karuno proved the VSP on a tree topology with arbitrary degree and ready time only is NP hard [5] Psaraftis [1] proposed a new model for routing of ships for a shoreline topology. He gave an O(n 2 ) algorithm for solving the path version of the VSP on a convex shoreline with ready time only, ....

L. Bodin, B. Golden, A. Assad, and M. Ball. "Routing and Scheduling of Vehicles and Crews: The State of the Art". Computers and Operations Research, vol 10:pp. 62--212, 1983.

....even a minor improvement in route design methodology may result in significant savings. The VRP has received extensive attention from operations researchers in the past three decades. Most of the research was reviewed in the survey by A Network Flow Based Tabu Search Heuristic for the VRP 3 Bodin, et al. 1983), the volume edited by Golden and Assad (1988) and an article by Laporte (1992) The VRP is a well known NP hard problem. Thus, the size of solvable instances of the VRP is limited. For example, Christofides (1985) reports solving a symmetric problem with 53 customers using a k degree center ....

L. D. Bodin, B.L. Golden, A.A. Assad and M.O. Ball, "Routing and Scheduling of Vehicles and Crews: The State of the Art," Computers and Operations Research 10, 69-211 (1983).

.... the published works on the crew rostering problem refer to urban mass transit systems, where the minimum number of crews required to perform the duties can easily be determined, and the objective is to evenly distribute the workload among the crews: see Jachnik [42] Bodin, Golden, Assad and Ball [11], Carraresi and Gallo [24] Hagberg [38] and Bianco, Bielli, Mingozzi, Ricciardelli and Spadoni [10] We next give a description of the real world crew rostering problem arising at the Italian railways. We are given a set of n duties to be covered by a set of crew rosters. Each duty i has a ....

L. Bodin, B. Golden, A. Assad and M. Ball, "Routing and Scheduling of Vehicles and Crews: the State of the Art", Computer and Operations Research 10 (1983) 63--211.

....out. In contrast, if all the demands are immediately considered, then routing and scheduling is done in real time and the problem is called dynamic. The problem in question is an extension to the generic routing and scheduling problem with full loads (see Bodin and Golden [6] Bodin et al. [7] for a survey in routing and scheduling problems) Due to the inherent difficulty of the truck routing and scheduling problems, pure exact solutions algorithms are out of the question for even simplified versions of any practical size. To our knowledge, very few published papers deal with the ....

L. Bodin, B. Golden, A. Assad, and M. Ball. Routing and scheduling of vehicles and crews: the state of the art. Computers and Operations Research, 10:63--212, 1983.

....of the roster. The crew planning problem then consists of finding a set of rosters covering every trip once, so as to satisfy all the operational constraints with minimum cost. Analogous crew planning problems arising in different public transportation areas are examined in Wren [31] Bodin et al. [10], Carraresi and Gallo [13] Rousseau [27] Daduna and Wren [16] Desrochers and Rousseau [17] Barnhardt et al. 4] and Desrosiers et al. 18] In transportation jargon and literature, rosters that are produced within crew planning are sometimes called blank , in the sense that they will be ....

....operations management, which also copes with contingencies, unscheduled traffic, service perturbations, etc. The general approach used by FS for the solution of the above defined crew planning problem follows a methodology which is fairly traditional in the literature (see, e.g. Bodin et al. [10]) The problem is decomposed into three phases as follows: 1. Pairing generation: a very large number of feasible pairings is generated. A pairing is defined as a sequence of trips which can be assigned to a crew in a short working period (1 2 days) A pairing starts and ends at the same depot and ....

[Article contains additional citation context not shown here]

L. Bodin, B. Golden, A. Assad and M. Ball, "Routing and Scheduling of Vehicles and Crews: the State of the Art", Computers and Operations Research 10 (1983) 63--211.

....The local optimizer services could also be given manually by a transportation coordinator in dispatch centers that do not use automatic optimization. Interactive routing is discussed in (Waters 1984) and (Powell Sheffi 1989) 5 A good overview of centralized routing algorithms is given in (Bodin et al. 1983). 3 Local control In TRACONET, an agent first calls its own local optimizer to make the routing decisions concerning the deliveries and vehicles that belong to the associated dispatch center. Based on these initial solutions, the agents start the negotiations. During the negotiations, the local ....

Bodin, L. et al. 1983. Routing and scheduling of vehicles and crews: The state of the art. Computers and Operations Research 10(2):63-211.

No context found.

L.D. Bodin, B.L. Golden, A.A.Assad and M.O.Ball, Routing and Scheduling of Vehicles andC rews: The State of the Art,C omputers and OR Special Issue, Vol. 10, pp. 69-211, 1983.

No context found.

Bodin, L., B. Golden, A. Assad and M. Ball, Routing and Scheduling of Vehicles and Crews - the State of the Art. Pergamon Press (1983).

No context found.

Bodin, L., B. Golden, A. Assad and M. Ball, Routing and Scheduling of Vehicles and Crews - the State of the Art. Pergamon Press (1983).

No context found.

L. BODIN,B.GOLDEN,A.ASSAD,M.BALL (1983). Routing and scheduling of vehicles and crews - The state of the art. Comput. Oper. Res. 10, 63-211.

No context found.

L.D. Bodin, B.L. Golden, A. Assad, M. Ball, "Routing and scheduling of vehicles and crews, the state of art", Computers and Operations Research 10 (1983) 69--211.

No context found.

L. Bodin, B. Golden, A, Assad, M. Ball, "Routing and Scheduling of Vehicles and Crews: the State of the Art", Computer and Operations Research 10 (1983) 63--211.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC