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...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of production economics Vol. 141; no. 1; pp. 4 - 13
Main Authors:	Wang, Hsiao-Fan, Chen, Ying-Yen
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.01.2013 Elsevier Sequoia S.A
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!