DP-TABU: an algorithm to solve single-depot multi-line vehicle scheduling problem
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2198-6053
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
DP-TABU: an algorithm to solve single-depot multi-line vehicle scheduling problem ; day:19 ; month:6 ; year:2021 ; pages:1-11
Complex & intelligent systems ; (19.6.2021), 1-11
- Urheber
-
Xinchao, Zhao
Hao, Sun
Juan, Lu
Zhiyu, Li
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s40747-021-00443-5
- URN
-
urn:nbn:de:101:1-2021100800223599965573
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:29 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Xinchao, Zhao
- Hao, Sun
- Juan, Lu
- Zhiyu, Li
- SpringerLink (Online service)
Ähnliche Objekte (12)
1D Vehicle Scheduling with Conflicts
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Optimal vehicle scheduling in public transit
Scheduling of tests on vehicle prototypes
Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Drivers’ working hours in vehicle routing and scheduling
Solve.
Exploiting combinatorial relaxations to solve a routing & scheduling problem in car body manufacturing
Integration of vehicle and duty scheduling in public transport
1D Vehicle Scheduling with Conflicts
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Optimal vehicle scheduling in public transit
Scheduling of tests on vehicle prototypes
Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Drivers’ working hours in vehicle routing and scheduling
Solve.
Exploiting combinatorial relaxations to solve a routing & scheduling problem in car body manufacturing
Integration of vehicle and duty scheduling in public transport
1D Vehicle Scheduling with Conflicts
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Optimal vehicle scheduling in public transit
Scheduling of tests on vehicle prototypes
Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models
Drivers’ working hours in vehicle routing and scheduling
Solve.
Exploiting combinatorial relaxations to solve a routing & scheduling problem in car body manufacturing