Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Leendert Kok"'
Publikováno v:
Flexible Services and Manufacturing Journal. 33:879-913
The last decades have seen a tremendous amount of research being devoted to effectively managing vehicle fleets and minimizing empty mileage. However, in contrast to, e.g., the air transport sector, the question of how to best assign crews to vehicle
Publikováno v:
Transportation Science. INFORMS Institute for Operations Research and the Management Sciences
Online grocers typically let customers choose a delivery time slot to receive their goods. To ensure reliable service, the retailer may want to close time slots as capacity fills up. The number of customers that can be served per slot largely depends
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a2930e3b91970ab90dcb5eb125cb344
https://pure.eur.nl/en/publications/9a90a1a2-fbbe-471c-a876-94931329e952
https://pure.eur.nl/en/publications/9a90a1a2-fbbe-471c-a876-94931329e952
Autor:
Asvin Goel, Leendert Kok
Publikováno v:
Transportation Science. 46:317-326
The U.S. truck driver scheduling problem (US-TDSP) is the problem of visiting a sequence of λ locations within given time windows in such a way that driving and working activities of truck drivers comply with U.S. hours-of-service regulations. In th
Autor:
Leendert Kok, Asvin Goel
Publikováno v:
Flexible Services and Manufacturing Journal. 24:81-96
This paper studies the problem of scheduling working hours of team drivers in European road freight transport where a sequence of λ locations must be visited within given time windows. Since April 2007 working hours of truck drivers in the European
Autor:
Adrianus Leendert Kok Kok
Vehicle routing is a complex daily task for businesses such as logistic service providers and distribution firms. Planners have to assign many orders to many vehicles and, for each vehicle, assign a delivery sequence. The objective is to minimize tot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d57ab961ba0a794f3491a4bb8f5d0d5
https://doi.org/10.3990/1.9789036529907
https://doi.org/10.3990/1.9789036529907