A RICH MIN-MAX VEHICLE ROUTING PROBLEM

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Journal of Naval Sciences and Engineering
Volume:12 Issue:1
A RICH MIN-MAX VEHICLE ROUTING PROBLEM

A RICH MIN-MAX VEHICLE ROUTING PROBLEM

Authors : Ertan YAKICI

Pages : 19-32

View : 14 | Download : 16

Publication Date : 2016-04-24

Article Type : Research Paper

Abstract :We present a new variant of vehicle routing problem with a min-max objective function. The problem has different types of service demands satisfied by a heterogeneous ﬂeet of vehicles. Unlimited service capacitated vehicles serve the demand points with multiple time windows and requirement of operation synchronization when demand is split between vehicles. A mixed integer linear programming based heuristic solution approach is proposed and a numerical study is carried out to assess the performance of the proposed method.
Keywords : Vehicle Routing Problem, Heuristic Method, Synchronization

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.