Treffer: Heuristic algorithms for the multiple depot vehicle scheduling problem

Title:
Heuristic algorithms for the multiple depot vehicle scheduling problem
Authors:
DELL'AMICO, M, FISCHETTI, M, TOTH, P
Source:
Management science. 39(1):115-125
Publisher Information:
Linthicum, MD: Institute for Operations Research and the Management Sciences, 1993.
Publication Year:
1993
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Management economics, Gestion, économie, management, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Algorithme, Algorithm, Algoritmo, Chemin plus court, Shortest path, Camino más corto, Complexité calcul, Computing complexity, Complejidad cálculo, Méthode heuristique, Heuristic method, Método heurístico, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Ordonnancement, Scheduling, Ordonamiento, Problème NP dur, NP hard problem, Problema NP duro, Problème livraison, Vehicle dispatching problem, Problema reparto, Problème transport, Transportation problem, Problema transporte, Résultat expérimental, Experimental result, Resultado experimental, Temps polynomial, Polynomial time, Tiempo polinomial, Théorie graphe, Graph theory, Teoría grafo
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Bologna, DEIS, Bologna, Italy
ISSN:
0025-1909
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=4586921
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.4586921
Database:
PASCAL Archive

Weitere Informationen

We consider the NP-hard Multiple Depot Vehicle Scheduling Problem, in which a given set of time-tabled trips have to be assigned to vehicles stationed at different depots, so as to minimize the number of vehicles used and the overall operational cost. The problem arises in the management of transportation companies. In this paper some structural properties of the problem are studied and used to design a new polynomial-time heuristic algorithm which always guarantees the use of the minimum number of vehicles. Several effective refining procedures are also proposed. Extensive computational results on test problems involving up to 1,000 trips and 10 depots are reported, showing that the new approach always produces very tight approximate solutions in small computing times and outperforms other heuristics from the literature.