( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A memetic algorithm for the Multi Trip Vehicle Routing Problem.

, , , и . Eur. J. Oper. Res., 236 (3): 833-848 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Marco Cattaruzza

Marina Cattaruzza

Alexander Diego

Jesús Diego Linares

Diego Tonolla

 

Другие публикации лиц с тем же именем

An efficient and general approach for the joint order batching and picker routing problem., , , , , и . Eur. J. Oper. Res., 285 (2): 497-512 (2020)Synchronized Deliveries with a Bike and a Self-Driving Robot., , , и . Transp. Sci., 58 (1): 219-239 (января 2024)Improving MOEA/D with Knowledge Discovery. Application to a Bi-objective Routing Problem., , , и . EMO, том 13970 из Lecture Notes in Computer Science, стр. 462-475. Springer, (2023)New Neighborhood Strategies for the Bi-objective Vehicle Routing Problem with Time Windows., , , и . MIC, том 13838 из Lecture Notes in Computer Science, стр. 45-60. Springer, (2022)Investigation of the Benefit of Extracting Patterns from Local Optima to Solve a Bi-objective VRPTW., , , и . MIC (1), том 14753 из Lecture Notes in Computer Science, стр. 62-77. Springer, (2024)Vehicle routing problems with multiple commodities: A survey., , , , , и . Eur. J. Oper. Res., 317 (1): 1-15 (2024)Vehicle routing problems with multiple trips., , и . 4OR, 14 (3): 223-259 (2016)A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows., , , и . Oper. Res. Lett., 48 (2): 167-169 (2020)Enhancing MOEA/D with learning: application to routing problems with time windows., , , и . GECCO Companion, стр. 495-498. ACM, (2022)The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm., , и . CoRR, (2024)