Efficient algorithms for optimal pickup-point selection in the selective pickup and delivery problem with time-window constraints

We address the selective pickup and delivery problem with time-window constraints, which is a problem of finding vehicle routes that pick up commodities at stores and deliver them to customers so as to minimize the total distance of the routes under capacity and time-window constraints. In this pape...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of advanced mechanical design, systems, and manufacturing Ročník 14; číslo 5; s. JAMDSM0074
Hlavní autoři:	Yosuke TAKADA, Masaru SHIMAZAKI, Yannan HU, Mutsunori YAGIURA
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	The Japan Society of Mechanical Engineers 01.01.2020
Témata:	dynamic programming selective pickup and delivery problem vehicle routing problem
ISSN:	1881-3054
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!