Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints
Year of publication: |
2005
|
---|---|
Authors: | Ibaraki, T. ; Imahori, S. ; Kubo, M. ; Masuda, T. ; Uno, T. ; Yagiura, M. |
Published in: |
Transportation science : the publication of the Transportation Science Section, Operation Research Society of America. - Hanover, Md : INFORMS, ISSN 0041-1655, ZDB-ID 1609580. - Vol. 39.2005, 2, p. 206-232
|
Saved in:
Saved in favorites
Similar items by person
-
Improved local search algorithms for the rectangle packing problem with general spatial costs
Imahori, S., (2005)
-
Efficient implementations of construction heuristics for the rectilinear block packing problem
Hu, Y., (2015)
-
The use of dynamic programming in genetic algorithms for permutation problems
Yagiura, M., (1996)
- More ...