A coevolutionary algorithm for the flexible delivery and pickup problem with time windows

This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model in order to minimize the number of vehicles and to minimize the total traveling distance. This problem is shown to be NP-hard. In this study...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of production economics Ročník 141; číslo 1; s. 4 - 13
Hlavní autori:	Wang, Hsiao-Fan, Chen, Ying-Yen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.01.2013 Elsevier Sequoia S.A
Predmet:	Algorithms Benchmarking Bi-directional logistics Coevolutionary algorithm Deliveries Delivery and pickup Economics Effectiveness studies Genetic algorithms Insertion Integer programming Mathematical models Route optimization Vehicle routing problem with backhaul Vehicles Windows (intervals) Coevolutionary algorithm Delivery and pickup Bi-directional logistics Vehicle routing problem with backhaul
ISSN:	0925-5273, 1873-7579
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!