Chapter 2 Time constrained routing and scheduling

Abstract

Publisher Summary Time constrained routing and scheduling problems are encountered in a variety of industrial and service sector applications, ranging from logistics and transportation systems to material handling systems in manufacturing. The traveling salesman problem with time windows has applications in single and multiple vehicle problems. The vehicle routing problem with time windows has many industrial applications including those where dock availability is a bottleneck such as for distribution centers. This chapter describes the significant advances made in time constrained routing and scheduling. In terms of solution methodology capable of solving realistic size problems, this field has seen a natural progression from ad-hoc methods to simple heuristics, to optimization-based heuristics and recently optimal algorithms. The chapter discusses fixed schedule problems and develops in detail the Dantzig-Wolfe decomposition/column generation approach which will then be applied to many of the other problem types. The vehicle routing problem with time windows and several important problem variants including the multiple traveling salesman problems is explored. The chapter examines a unified framework for fleet and crew scheduling problems.