Minmax Vehicle Routing Problems: Application to School Transport in the Province of Burgos

  • Delgado Serna C
  • Pacheco Bonrostro J
N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This volume gives an overview on new theoretical approaches on computer-aided methods for strategic and operational planning in public transport. The papers of this volume cover the most important steps of the complete process of planning and operational control in public transport and public mass transit. Readers of this book obtain detailed information on current developments in vehicle and crew scheduling and in solving such problems in practice. Interesting results in scheduling theory are shown, using procedures for solving combinatorial problems with more complex structures. Furthermore, experiences in the application of specific software tools are presented. Content Level » Research Keywords » Bus/Rail systems - Computer-aided scheduling - Monitoring and control - Public transport - Reihenfolgenplanung - Vehicle and crew scheduling - öffentlicher Nah- und Fernverkehr Related subjects » Artificial Intelligence - Complexity - Operations Research & Decision Theory

Cite

CITATION STYLE

APA

Delgado Serna, C. R., & Pacheco Bonrostro, J. (2001). Minmax Vehicle Routing Problems: Application to School Transport in the Province of Burgos (pp. 297–317). https://doi.org/10.1007/978-3-642-56423-9_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free