A RICH MIN-MAX VEHICLE ROUTING PROBLEM
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 fleet 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
Details
Primary Language
English
Subjects
Engineering
Journal Section
-
Authors
Ertan Yakıcı
This is me
Publication Date
April 24, 2016
Submission Date
April 24, 2016
Acceptance Date
March 28, 2016
Published in Issue
Year 2016 Volume: 12 Number: 1