A RICH MIN-MAX VEHICLE ROUTING PROBLEM

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

Full description

Bibliographic Details
Main Author: Ertan YAKICI
Format: Article
Language:English
Published: National Defense University Barbaros Naval Sciences and Engineering Institute Journal of Naval Science and Engineering 2016-04-01
Series:Journal of Naval Science and Engineering
Subjects:
Online Access:http://dergipark.gov.tr/jnse/issue/20908/224510?publisher=msu
id doaj-3ff45e4d84af49d8aa95ba34d074b4e8
record_format Article
spelling doaj-3ff45e4d84af49d8aa95ba34d074b4e82020-11-25T00:11:41ZengNational Defense University Barbaros Naval Sciences and Engineering Institute Journal of Naval Science and EngineeringJournal of Naval Science and Engineering1304-20252016-04-011211932891A RICH MIN-MAX VEHICLE ROUTING PROBLEMErtan YAKICI0?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.http://dergipark.gov.tr/jnse/issue/20908/224510?publisher=msuVehicle Routing ProblemHeuristic MethodSynchronization
collection DOAJ
language English
format Article
sources DOAJ
author Ertan YAKICI
spellingShingle Ertan YAKICI
A RICH MIN-MAX VEHICLE ROUTING PROBLEM
Journal of Naval Science and Engineering
Vehicle Routing Problem
Heuristic Method
Synchronization
author_facet Ertan YAKICI
author_sort Ertan YAKICI
title A RICH MIN-MAX VEHICLE ROUTING PROBLEM
title_short A RICH MIN-MAX VEHICLE ROUTING PROBLEM
title_full A RICH MIN-MAX VEHICLE ROUTING PROBLEM
title_fullStr A RICH MIN-MAX VEHICLE ROUTING PROBLEM
title_full_unstemmed A RICH MIN-MAX VEHICLE ROUTING PROBLEM
title_sort rich min-max vehicle routing problem
publisher National Defense University Barbaros Naval Sciences and Engineering Institute Journal of Naval Science and Engineering
series Journal of Naval Science and Engineering
issn 1304-2025
publishDate 2016-04-01
description 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.
topic Vehicle Routing Problem
Heuristic Method
Synchronization
url http://dergipark.gov.tr/jnse/issue/20908/224510?publisher=msu
work_keys_str_mv AT ertanyakici arichminmaxvehicleroutingproblem
AT ertanyakici richminmaxvehicleroutingproblem
_version_ 1725402759410221056