Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-7479
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows ; volume:20 ; number:6 ; day:11 ; month:3 ; year:2015 ; pages:2309-2327 ; date:6.2016
Soft computing ; 20, Heft 6 (11.3.2015), 2309-2327, 6.2016
- Urheber
-
Nalepa, Jakub
- Beteiligte Personen und Organisationen
-
Blocho, Miroslaw
SpringerLink (Online service)
- DOI
-
10.1007/s00500-015-1642-4
- URN
-
urn:nbn:de:1111-201605132639
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:59 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
- Nalepa, Jakub
- Blocho, Miroslaw
- SpringerLink (Online service)
Ähnliche Objekte (12)
Cost Allocation in Vehicle Routing Problems with Time Windows
Distance approximation to support customer selection in vehicle routing problems
Implicit time windows and multi-commodity mixed-fleet vehicle routing
Dynamic vehicle routing with time windows in theory and practice
Vehicle routing problem
Test-data generation and integration for long-distance e-vehicle routing
A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem
Modified artificial bee colony for the vehicle routing problems with time windows
Minimizing delays of patient transports with incomplete information: A modeling approach based on the vehicle routing problem
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Synchronization requirements in vehicle routing
Anticipation in dynamic vehicle routing
Cost Allocation in Vehicle Routing Problems with Time Windows
Distance approximation to support customer selection in vehicle routing problems
Implicit time windows and multi-commodity mixed-fleet vehicle routing
Dynamic vehicle routing with time windows in theory and practice
Vehicle routing problem
Test-data generation and integration for long-distance e-vehicle routing
A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem
Modified artificial bee colony for the vehicle routing problems with time windows
Minimizing delays of patient transports with incomplete information: A modeling approach based on the vehicle routing problem
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Synchronization requirements in vehicle routing
Anticipation in dynamic vehicle routing
Cost Allocation in Vehicle Routing Problems with Time Windows
Distance approximation to support customer selection in vehicle routing problems
Implicit time windows and multi-commodity mixed-fleet vehicle routing
Dynamic vehicle routing with time windows in theory and practice
Vehicle routing problem
Test-data generation and integration for long-distance e-vehicle routing
A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem
Modified artificial bee colony for the vehicle routing problems with time windows
Minimizing delays of patient transports with incomplete information: A modeling approach based on the vehicle routing problem
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Synchronization requirements in vehicle routing