L. Bodin and B. Golden. Classification in vehicle routing and scheduling. Networks, 11(97--108), 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....without a fixed schedule ffl the problem to generate cycles of a determined length for instance working periods with daily rest periods A lot of the work that has been done in the project have focused on characterizing these problems. The following references put the problem in context [BG81] Sav85] GA86] Sol86] Sol87] SD88] PR93] TP93] We believe that mechanisms to solve problems of this type can be of great value to decision support systems in a wide variety of domains. 7.2 Set Partitioning The problem to determine the rosters can be formulated as set partitioning ....

L. Bodin and B. Golden. Classification in vehicle routing and scheduling. Networks, 11(97--108), 1981.

....whose expected gain computed from the performance profiles is greatest. The NP completeness result reported by Etzioni does not apply in this more general case. In job shop scheduling, if it is possible to suspend and later resume a job, then many otherwise difficult problems become trivial [18, 6]. Such (preemptive) scheduling problems are somewhat rare in real job shops given that there is often significant overhead involved is suspending and resuming jobs (e.g. traveling between workstations or changing tools) but they are considerably more common with regard to purely computational ....

Bodin, L. and Golden, B., Classification in Vehicle Routing and Scheduling, Networks, 11 (1981) 97--108.

....respectively, the machine environment, processing characteristics, and the number of machines (see Pinedo (1995) Eiselt, Laporte Thisse (1993) propose a I II III IV V taxonomy for classifying location problems, and use this to organize the extensive literature in location theory. Bodin Golden (1981) list 13 dimensions in their classification of vehicle routing problems, each of which is divided into several categories. A different approach to problem representation has been modeling languages, which are more generally oriented toward much broader problem classes. An excellent review of this ....

Bodin, L. & Golden, B. (1981), `Classification in vehicle routing and scheduling', Networks 11, 97-- 108.

....and on a cluster of workstations using PVM [1] The computational results obtained with sequential and parallel Simulated Trading show that our approach is superior compared to all heuristics known to the authors by now. 1. Introduction Vehicle Routing Problems can be found in many variants (see [2] for a survey) As a generalization of the well known Travelling Salesman Problem (TSP) it belongs to the class of NP complete problems. Thus, one cannot expect to find an algorithm which solves practical problems exactly in reasonable time. The standard vehicle routing problem is given as ....

L. Bodin and B. Golden, "Classification in vehicle routing and scheduling," Networks, vol. 11, pp. 97--108, 1981.

.... describe two parallel approaches for Simulated Trading, and finally in Section 7 we present our computational results using the test problem library of Solomon [19, 20] as well as fourteen standard vehicle routing problems taken from [4] We assume some familiarity with vehicle routing (see e.g. [2]) and use standard graph theoretic notation (see [1] 2 The Idea of Simulated Trading The key idea of Simulated Trading is to apply the mechanisms of trading to optimizing the partition of the customers into the tours. To get an idea of this consider the following talk between four truck ....

L. Bodin and B. Golden, Classification in vehicle routing and scheduling, Networks, 11 (1981), pp. 97--108.

....depot. 3. Distribute the goods in the service area of the destination depot. Steps 1 and 3 represent the classical Single Depot Vehicle Routing Problem (SDVRP) In step 2 we are faced with a transportation problem belonging to the class of task or trip routing. For a classification of VRP see [Bodin 1981], Desrochers 1990] Each container to be transported, i.e. each trip, is characterized by a place of origin, a destination, and a time window during which the transportation must be carried out. These transportation requests are serviced by an inhomogeneous fleet of vehicles consisting of trucks ....

Lawrence Bodin, Bruce Golden. Classification in Vehicle Routing and Scheduling. NETWORKS 11, 97-108 (1981)

....on certain sources of complexity and neglecting others. In Section 5, we explore how to deal with dynamic sources of complexity. 3. 1 Subscriber Dial a Ride Problem One reformulation of the general transportation problem that has been studied in the literature is the Subscriber Dial a Ride Problem [38, 7]. This problem consists of a set of customers (packages) who each need to be delivered from a source location to a destination location. In addition, the pickup and or delivery time for each customer is specified. Given a set of vehicles (assets) the problem is to construct a set of schedules ....

Bodin, Lawrence and Golden, Bruce, Classification in Vehicle Routing and Scheduling, Networks, (11) 1981, 97--108.

....or scheduling is carried 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 ....

L. Bodin and B. Golden. Classification in vehicle routing and scheduling. Networks, 11:97--108, 1981.

No context found.

Bodin, L.D., and Golden, B.L., "Classification in vehicle routing and scheduling", Networks 11 (1981) 97--108.

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