Skip to main content

1998 | Buch

Fleet Management and Logistics

herausgegeben von: Teodor Gabriel Crainic, Gilbert Laporte

Verlag: Springer US

Buchreihe : Centre for Research on Transportation

insite
SUCHEN

Über dieses Buch

TEODOR GABRIEL CRAINIC, DIRECTOR The Centre for Research on Transportation (C.R.T.) was founded in 1971 by the Universite de Montreal. From 1988 on, it is jointly managed by the Universite de Montreal and its affiliated schools, the Ecole des Hautes Etudes Commerciales and Ecole Poly technique. Professors, students and researchers from many institutions in the Montreal area join forces at the C.R.T. to analyze transportation, logistics and telecommunication systems from a multidisciplinary perspective. The C.R.T. pursues three major, complementary objectives: training of high-level specialists; the advancement of knowledge and technology; the transfer of technology towards industry and the public sector. Its main field of expertise is the develop­ ment of quantitative and computer-based models and methods for the analysis of urban, regional and intercity transportation networks, as well as telecommunication systems. This applies to the study of passenger and commodity flows, as well as to the socioeconomic aspects of transportation: policy, regulation, economics. The twenty-fifth anniversary of the C.R.T. offered the opportunity to evaluate past accomplishments and to identify future trends and challenges. Five colloquia were thus organized on major research and application themes that also reflected our main research areas. They gathered together internationally renowned researchers who linked recent scientific and technological advances to modeling and methodological challenges waiting to be tackled, particularly concerning new problems and applica­ tions, and the increasingly widespread use of new technologies.

Inhaltsverzeichnis

Frontmatter
1. Exact Solution of the Vehicle Routing Problem
Abstract
The Vehicle Routing Problem (VRP) is a hard and well-known combinatorial optimization problem which calls for the determination of the optimal routes used by a fleet of vehicles, based at one or more depots, to serve a set of customers. In practical applications of the VRP arising in the design and management of distribution systems, several operational constraints are imposed on the route construction. For example, the service may involve both deliveries and collections, the load along each route must not exceed the given capacity of the vehicles, the total length of each route must not be greater than a prescribed limit, the service of the customers must occur within given time windows, the fleet may contain heterogeneous vehicles, precedence relations may exist between the customers, the customer demands may not be completely known in advance, the service of a customer may be split among different vehicles, and some problem characteristics, as the demands or the travel times, may vary dynamically.
Paolo Toth, Daniele Vigo
2. The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results
Abstract
In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles services a set of customers from a single depot. Each vehicle has a fixed capacity that cannot be exceeded and each customer has a known demand that must be satisfied. Each customer must be serviced by exactly one visit of a single vehicle and each vehicle must leave and return to the depot. There may be route-length restrictions that limit the distance traveled by each vehicle. The objective is to generate a sequence of deliveries for each vehicle so that all customers are serviced and the total distance traveled by the fleet is minimized.
Bruce L. Golden, Edward A. Wasil, James P. Kelly, I-Ming Chao
3. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
Abstract
Time constrained routing and scheduling is of significant importance across land, air and water transportation. These problems are also encountered in a variety of manufacturing, warehousing and service sector environments. Their mathematical complexity and the magnitude of the potential cost savings to be achieved by utilizing O.R. methodologies have attracted researchers since the early days of the field. Witness to this are the pioneering efforts of Dantzig and Fulkerson (1954), Ford and Fulkerson (1962), Appelgren (1969, 1971), Levin (1971), Madsen (1976) and Orloff (1976). Much of the methodology developed has made extensive use of network models and algorithms.
Guy Desaulniers, Jacques Desrosiers, Irina loachim, Marius M. Solomon, François Soumis, Daniel Villeneuve
4. The Inventory Routing Problem
Abstract
The role of logistics management is changing. Many companies are realizing that value for a customer can, in part, be created through logistics management (Langley and Holcomb, 1996). Customer value can be created through product availability, timeliness and consistency of delivery, ease of placing orders, and other elements of logistics service. Consequently, logistics service is becoming recognized as an essential element of customer satisfaction in a growing number of product markets today.
Ann Campbell, Lloyd Clarke, Anton Kleywegt, Martin Savelsbergh
5. Dynamic Vehicle Routing and Dispatching
Abstract
Real-time decision problems are playing an increasingly important role in the economy due to advances in communication and information technologies that now allow realtime information to be quickly obtained and processed (Séguin et al., 1997). Among these, dynamic vehicle routing and dispatching problems have emerged as an intense area of research in the operations research community. Numerous examples may be found in Haines and Wolfe (1982), Powell, Jaillet and Odoni (1995) and Psaraftis (1995). In these problems, a set of vehicles is routed over a particular time horizon (typically, a day) while new service requests are occuring in real-time. With each new request, the current solution may be reconfigured to better service the new request, as well as those already assigned to a route.
Michel Gendreau, Jean-Yves Potvin
6. On Languages for Dynamic Resource Scheduling Problems
Abstract
Consider the situation of an American businessman early in the century who is interested in making money by selling Arab oil in the United States. The first problem is designing the chemical process needed to convert the type of oil in Saudi Arabia to the kind of gasoline needed in the U.S., a problem that has been solved by a French chemist. The American businessman needs to determine if global energy prices will rise to the point to make the enterprise profitable, a problem that is well understood by an English economist. The economist needs to understand how this new source of oil will affect the other oil markets, which can be solved by a Russian mathematician.
Warren B. Powell
7. Solving Stochastic Routing Problems with the Integer L-Shaped Method
Abstract
The deterministic Vehicle Routing Problem (VRP) is defined on a graph G = (V, E), where V = v 1,…, v n is a vertex set, and E = (v i, v j): v i,v jV, i < j is an edge set. Vertex v 1 represents a depot at which are based m identical vehicles of capacity D, while the remaining vertices are customers. A travel cost matrix C = (c ij) and a travel time matrix T = (t ij) are defined on E. Since the problem is defined on an edge structure, C and T are symmetrical. There exist, however, asymmetric versions of the VRP defined on an arc structure arising, for example in urban contexts with several one-way streets. The VRP consists of designing a set of m least cost vehicle routes starting and ending at the depot, such that each customer is visited exactly once, and satisfying some side constraints. We consider the following constraints.
Gilbert Laporte, François V. Louveaux
8. Crew Scheduling in Air Transportation
Abstract
This paper addresses some crew scheduling problems faced by airlines during both the planning and the operational phases. Given a flight schedule and a fleet assignment, the planning process consists first in solving a crew pairing problem for each fleet of aircraft and then in constructing a monthly work schedule for each individual crew member. At the operational level, some crew pairings and schedules must be modified in order to compensate for certain disruptions that occur during the operations. The operational crew scheduling problem involves making these modifications.
Guy Desaulniers, Jacques Desrosiers, Michel Gamache, François Soumis
9. Path, Tree and Cycle Location
Abstract
Traditional network location theory is concerned with the optimal location of facilities which can be considered as single points (emergency medical service stations, switching centers in communication networks, bus stops, mail boxes, etc.) However, in many real problems the facility to be located is too large to be modeled as a point. Examples of such problems include the location of pipelines and high speed train lines, the design of emergency routes, newspaper delivery routes, subway lines, etc. We will refer to this kind of facilities as extensive facilities or structures, and they may have the shape of a path, a tree, a cycle or a more general subgraph.
Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez-Martín
10. Parallel Metaheuristics
Abstract
Heuristics have been, and continue to be, an essential component of the methodological approaches used to address combinatorial optimization formulations, in general, and transportation applications, in particular. In the last ten to fifteen years, metaheuristics have profoundly changed the way we solve these problems and have significantly contributed to efficiently address complex, hard problem settings (see, for example, Crainic and Laporte, 1997, or Golden et al., 1998).
Teodor Gabriel Crainic, Michel Toulouse
Metadaten
Titel
Fleet Management and Logistics
herausgegeben von
Teodor Gabriel Crainic
Gilbert Laporte
Copyright-Jahr
1998
Verlag
Springer US
Electronic ISBN
978-1-4615-5755-5
Print ISBN
978-1-4613-7637-8
DOI
https://doi.org/10.1007/978-1-4615-5755-5