Skip to main content
SpringerLink
Log in

The Vehicle Scheduling Problem with Multiple Vehicle Types

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

The vehicle scheduling problem is specified in terms of a set of tasks to be executed with a fleet of multiple vehicle types. The purpose of this paper is to formulate the problem and to show that the heuristic and exact methods developed for the vehicle scheduling problem with time windows and with a single type of vehicle can be extended in a straightforward fashion to the multiple-vehicle-types problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Département d'informatique et de recherche opérationnelle et Centre de recherche sur les transports, Université de Montréal, Canada

    Jacques A. Ferland

  2. Département de mathématiques appliquées, Université de Clermont, Canada

    Philippe Michelon

Authors
  1. Jacques A. Ferland
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Michelon
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ferland, J., Michelon, P. The Vehicle Scheduling Problem with Multiple Vehicle Types. J Oper Res Soc 39, 577–583 (1988). https://doi.org/10.1057/jors.1988.97

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1988.97

Keywords

Search

Navigation